Program
中国科学院数学与系统科学研究院－悉尼科技大学
量子计算与量子信息处理联合研究实验室年会 2016
UTSAMSS Joint Annual Workshop on
Quantum Computing and Quantum Information Processing 2016
(QCQIP’2016)
November 12, 2016, Beijing
Chairs
Ruqian Lu, Mingsheng Ying
Organizers
Runyao Duan, Shunlong Luo, Yun Shang
Venue:
Room N202
Academy of Mathematics and Systems Science, CAS, Beijing
55 Zhongguancun East Road, 100190, Beijing
北京中关村东路55号, 数学院南楼202室
Sponsors:
Academy of Mathematics and Systems Science (AMSS), CAS
National Center for Mathematics and Interdisciplinary Sciences, CAS
University of Technology Sydney (UTS)
UTSAMSS Joint Annual Workshop on Quantum Computing and Quantum Information Processing 2016 (QCQIP’2016)
Date: November 12, 2016
Venue: Room N202 (数学院南楼N202)
Academy of Mathematics and Systems Science, CAS, Beijing
55 Zhongguancun East Road, 100190, Beijing
北京 中关村东路55号
Contact: Runyao Duan (段润尧 runyao.duan@uts.edu.au)
Shunlong Luo (骆顺龙 luosl@amt.ac.cn)
Yun Shang (尚云 shangyun@amss.ac.cn, 01082541275, 13581891852)
Scientific Program (会议程序) 

Morning 

08:50－08:53 
Ruqian Lu (陆汝钤) 
Workshop opening 
08:53－09:00 
Yuefei Wang (王跃飞) 
Opening address 
Morning Session 
Chair: Shunlong Luo (骆顺龙) 

09:00—09:45 
Mingsheng Ying (应明生) 
Invariants of quantum programs: characterisations and generation 
09:45—10:30 
Shaoming Fei (费少明) 
On quantum uncertainty relations 
10:30—10:50 
Tea Break 

10:50—11:35 
Peng Xue (薛鹏) 
Realization of the contextualitynonlocality tradeoff with a qubitqutrit photon pair 
11:35—12:20 
Xiongfeng Ma (马雄峰) 
Quantum Bernoulli factory and its experimental demonstration 
12:30— 14:00 
Lunch 

Afternoon Session 
Chair: Yun Shang (尚云) 

14:00—14:45 
Yuan Feng (冯元) 
Model checking omegaregular properties for quantum Markov chains 
14:45—15:30 
Bei Zeng (曾蓓) 
Channeladapted quantum error correction via code concatenation 
15:30—15:50 
Tea Break 

15:50—16:35 
Lin Chen (陈霖) 
Recent progress on the distillability problem

16:35—17:20 
Runyao Duan (段润尧) 
Asymptotic entanglement manipulation under PPT operations: new SDP bounds and irreversibility 
17:20—17:30 
Shunlong Luo (骆顺龙) 
Closing remarks 
18:00— 
Dinner 
Abstracts
Mingsheng Ying (UTS) 09:00—09:45
Invariants of quantum programs: characterisations and generation
Abstract: Program invariant is a fundamental notion widely used in program verification and analysis. The aim of this paper is twofold: (i) find an appropriate definition of invariants for quantum programs; and (ii) develop an effective technique of invariant generation for verification and analysis of quantum programs.
Interestingly, the notion of invariant can be defined for quantum programs in two different ways  additive invariants and multiplicative invariants  corresponding to two interpretations of implication in a continuous valued logic: the Lukasiewicz implication and the Godel implication. It is shown that both of them can be used to establish partial correctness of quantum programs.
The problem of generating additive invariants of quantum programs is addressed by reducing it to an SDP (Semidefinite Programming) problem. This approach is applied with an SDP solver to generate invariants of two important quantum algorithms  quantum walk and quantum Metropolis sampling. Our examples show that the generated invariants can be used to verify correctness of these algorithms and are helpful in optimising quantum Metropolis sampling.
To our knowledge, this paper is the first attempt to define the notion of invariant and to develop a method of invariant generation for quantum programs.
This talk is based on a joint work with Shenggang Ying (UTS) and Xiaodi Wu (University of Oregon).
Short Bio: Mingsheng Ying is a Distinguished Professor with and the Research Director of the Centre for Quantum Software and Information (since 15 September 2016), Faculty of Engineering and Information Technology, University of Technology Sydney (UTS), Australia. He was Cheung Kong Professor with the National Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing, China. Prof Ying's research interests are quantum computation, programming theory, and foundations of artificial intelligence. He has published more than 100 papers in top international journals and conferences. He is the author of the books "Foundations of Quantum Programming" (Elsevier  Morgan Kaufmann 2016) and "Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs" (SpringerVerlag, 2001).
Shaoming Fei (Capital Normal University) 9:45—10:30
On quantum uncertainty relations
Abstract: We introduce optimal universal uncertainty relations based on any entropic uncertainty relations given by nonnegative Schurconcave functions including Shannon entropy, and uncertainty relations for arbitrary N observables in terms of the sum of variances and standard deviations, weighted quantum uncertainty relations, Heisenberg’s measurement uncertainty relation based on statistical distances as well as their experimental verifications.
Short Bio: Prof. Shaoming Fei is with the School of Mathematical Sciences, Capital Normal University, Beijing. University education: 19781982 (Bachelor), 19851991 (Ph.D.), Department of Physics, Zhejiang University. Professional background: 19821985 Hangzhou Institute of Electronic and Engineering; 19911993 Institute of Theoretical Physics, Chinese Academy of Sciences; 19931994 Institute of Physics, Chinese Academy of Sciences, Beijing; 19941999 Institute of Mathematics, RuhrUniversity Bochum, Germany; 19992001 Institute of Applied Mathematics, University of Bonn, Germany; 2001 Capital Normal University, Beijing & MaxPlanckInstitute for Mathematics in the Sciences, Germany. 2010 Editor of “Science in China: Physics, Mechanics & Astronomy”; 2015 Editor of “Scientific Reports”. Current research area: quantum information and computation.
Peng Xue (Southeast University) 10:50—11:35
Realization of the contextualitynonlocality tradeoff with a qubitqutrit photon pair
Abstract: We report our experimental results on the nodisturbance principle, which imposes a fundamental monogamy relation on contextuality vs nonlocality. We employ a photonic qutritqubit hybrid to explore nodisturbance monogamy at the quantum boundary spanned by noncontextuality and locality inequalities. In particular we realize the single point where the quantum boundary meets the nodisturbance boundary. Our results agree with quantum theory and satisfy the stringent monogamy relation thereby providing direct experimental evidence of a tradeoff between locally contextual correlations and spatially separated correlations. Thus, our experiment provides evidence that entanglement is a particular manifestation of a more fundamental quantum resource.
Short Bio: Dr Peng Xue is a Professor of the Physics Department at Southeast University, Nanjing, China. Dr Xue received her Bachelor of Science degree in 1999 and a PhD in 2004 from University of Science and Technology of China supervised by Professor GuangCan Guo. She continued research on quantum information science as postdoctoral at the University of Innsbruck, Austria, and then at the University of Calgary, Canada. Dr Xue joined the Physics Department of Southeast University in 2009.
Dr Xue’s current research interests belong in a broad sense to the field of physical implementation of quantum computing and quantum simulation idea, especially on experimental realization of quantum information processing with linear optics. Apart from the design of interactions and quantum gates this research also includes the analysis of decoherence source as well as state preparation and measurement techniques as prerequisites for quantum computations. Due to the interdisciplinary character of this research field she has become interested in various physical systems, both from the field of linear optics, the field of atomic, molecular and optical physics, as well as the field of solid state physics.
Xiongfeng Ma (Tsinghua University) 11:35—12:20
Quantum Bernoulli factory and its experimental demonstration
Abstract: Quantum mechanics provides means to process information that are hard or even impossible for classical mechanics. A fundamental question is whether quantum advantages persist only by exploiting multipartite correlations, such as entanglement. Recent studies on a randomness processing task, quantum Bernoulli factory, show that quantum advantages can be shown using quantum coherence without entanglement. Meanwhile, we demonstrate the protocol by exploiting the highfidelity quantum state preparation and measurement with a superconducting qubit. The experiment shows the advantage of using quantum coherence of a single qubit for information processing even when multipartite correlation is not present.
Short Bio: The primary research fields of Xiongfeng Ma are quantum cryptography, quantum optics, and quantumness measure. In particular, Xiongfeng is interested in quantum key distribution, quantum randomness, coherence, quantum hacking, selftesting quantum information processing, and nonlocality tests. After finishing his undergraduate study in the School of Physics at Peking University in 2003, Xiongfeng moved to the University of Toronto, where he got his Ph. D. degree under the supervision of Prof. HoiKwong Lo in 2008. Then Xiongfeng took a postdoc position in the Institute for Quantum Computing at the University of Waterloo, and visiting scholar positions at the University of Toronto and the University of Leeds. In 2012, Xiongfeng joined the Institute for Interdisciplinary Information Sciences at Tsinghua University as an assistant professor, when he got the 1000 Youth Scholarship.
Yuan Feng (UTS) 14:00—14:45
Model checking omegaregular properties for quantum Markov chains
Abstract: Quantum Markov chains are an extension of classical Markov chains which are labelled with superoperators rather than probabilities. They allow to faithfully represent quantum programs and quantum protocols. A very general class of properties of interest can be specified in an omegaregular language (e.g. LTL properties). Therefore, it would be of great benefit to check omegaregular properties of this model class.
For classical Markov chains, such properties are usually checked by building the product of the model with a language automaton. Subsequent analysis is then performed on this product. When doing so, one takes into account its graph structure, and for instance performs different analyses per bottom strongly connected component (BSCC). Unfortunately, for quantum Markov chains such an approach does not work directly, because superoperators behave differently from probabilities. To overcome this problem, we transform the product quantum Markov chain into a single superoperator, which induces a decomposition of the state space (the tensor product of classical state space and the quantum one) into a family of BSCC subspaces. Interestingly, we show that this BSCC decomposition provides a solution to the issue of model checking omegaregular properties for quantum Markov chains.
Short Bio: Yuan Feng is a professor at the Centre for Quantum Software and Information (CQSI), University of Technology Sydney (UTS), Australia. He received his BS and PhD degrees from the Department of Applied Mathematics and the Department of Computer Science and Technology, Tsinghua University, in 1999 and 2004, respectively. Before joining UTS in 2009, he was an Associate Professor at Tsinghua University. Prof Feng’s research interests include the theory of quantum programming, quantum information and quantum computation, and probabilistic systems. He has published more than 60 research papers in computer science journals like ACM TOPLAS, ACM TOCL, IEEE TIT, IEEE TSE, IEEE TC, I&C, and JCSS; physics journals like PRL, PRA, and QIC; and conferences like POPL, CONCUR, CSF, MFCS, FM, IJCAI, UAI, and AAMAS. He was a winner of National Excellent Doctoral Dissertation of China in 2006 and an ARC (Australian Research Council) Future Fellowship in 2010.
Bei Zeng (Univeristy of Guelph) 14:45—15:30
Channeladapted quantum error correction via code concatenation
Abstract: Quantum error correction (QEC) is crucial for faithful transmission of quantum information and successful realization of quantum computers. Typically, QEC is designed with minimal assumptions about the noise process, i.e. depolarizing noise that happens independently on each individual particle. In real physical systems, errors are unlikely to be arbitrary. Rather we have reasonable knowledge about the system to model its quantum decoherence process. In this talk, we examine QEC that are adapted to the physical noise models. We start from an overview of the concepts and general methods for channeladapted QEC. We then examine a technique, called code concatenation, for constructing channeladapted quantum codes. Applying to the amplitude damping channels, we demonstrate the power of the code concatenation method for constructing good codes for channeladapted QEC.
Short Bio: Bei Zeng received the B.Sc. degree in Physics and Mathematics and M.Sc. degree in Physics from Tsinghua University, Beijing, China, in 2002 and 2004, respectively. She received the Ph.D. degree in physics from Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts, USA, in 2009. From Sept. 2009 to Aug. 2010, she was a postdoctoral fellow at the Institute for Quantum Computing (IQC) and the Department of Combinatorics & Optimization, University of Waterloo, Waterloo, Ontario, Canada. In Sept. 2010, she joined the Department of Mathematics & Statistics, University of Guelph, Guelph, Ontario, Canada, as an Assistant professor, and became Associate professor in 2014.
Lin Chen (Beihang University) 15:50—16:35
Recent progress on the distillability problem
Abstract: The distillability problem is a wellknown open problem in entanglement theory. It asks whether quantum states can be asymptotically converted into pure entanglement, which is the necessary resource for quantuminformation tasks. We report the recent progress on the distillability problem, by showing that the following two families of M×N bipartite entangled states ρ are 1distillable. (i) ρ has rank max{M, N}, and (ii) M = N = 3, ρ has negative partial transpose (NPT), and the partial transpose of ρ has at least two nonpositive eigenvalues. The result (i) solves an open problem proposed by P. Horodecki and J. Smolin et al in 1999. As a corollary of (i) and (ii) all NPT states of rank at most four are 1distillable. We further construct a family of 1undistillable twoqutrit NPT states ρ(ε) of rank five containing a positive parameter ε. For any given integer n and sufficiently small ε, it turns out that ρ(ε)^{⊗}^{n} is 1undistillable. We also conjecture that ρ(ε)^{⊗}^{n} is an undistillable NPT bound entangled state when n approaches the infinity.
Short Bio: Lin Chen is an Associate Professor in the department of mathematics, Beihang University since 2015. Prior to joining Beihang he was a postdoc in the Center for Quantum Technologies (CQT) of NUS, the Institute for Quantum Computing (IQC) of University of Waterloo, and Singapore University of Technology and Design from 2008 to 2014. He received his PhD in Theoretical Physics in Zhejiang University in 2008. His work focuses on entanglement theory such as the distillability problem, controlled unitary operations, and mutually unbiased basis recently.
Runyao Duan (UTS) 16:35—17:20
Asymptotic entanglement manipulation under PPT operations: new SDP bounds and irreversibility
Abstract: We study various aspects of asymptotic entanglement manipulation of general bipartite states under operations that completely preserve positivity of partial transpose (PPT). Our key findings include: i) nonadditivity of Rains’ bound for a class of twoqubit states; and ii) two additive SDP lower bounds to the Rains’ bound and relative entropy of entanglement, respectively. These findings enable us to better evaluate the distillable entanglement and entanglement cost. As applications, we show that for any ranktwo mixed state supporting on the 3level antisymmetric subspace, both the Rains’ bound and its regularization are strictly less than the asymptotic relative entropy of entanglement. That also implies the irreversibility of asymptotic entanglement manipulation under PPT operations, one of the major open problems in quantum information theory. We further present an SDPcomputable sufficient condition for the irreversibility under PPT operations. This talk is based on joint works with Xin Wang (UTS).
Short Bio: Runyao Duan is currently a Professor and the Founding Director of the Centre for Quantum Software and Information (since 15 September 2016), Faculty of Engineering and Information Technology (FEIT), UTS, Australia. He received the BS and PhD from the Department of Computer Science and Technology, Tsinghua University, Beijing, China in the years of 2002 and 2006, respectively. On graduation he joined the same department as an Assistant Professor. From October 2007 to April 2008, he was a visiting Research Scientist in the University of Michigan. In December 2008, he moved to UTS as a Senior Lecturer (continuing position) and the Founding Director of the Quantum Computation Laboratory at UTS, and was promoted to Associate Professor in August 2010. Since July 2012, he has become an ARC (Australian Research Council) Future Fellow and Professor.
Prof Duan has been working in the field of quantum information theory since 2002, and has made several fundamental and methodological contributions in the areas of quantum operation discrimination, quantum state discrimination, zeroerror communication via noisy quantum channels, and quantum entanglement transformation. Up to now, he has published about 70 papers in prominent international referred journals including Physical Review Letters and IEEE Transactions on Information Theory. His research works were presented at international competitive conferences including POPL, QIP, AQIS, and ISIT. He served and chaired the Steering Committee of QIP conferences, and was the head of QIP2015 Local Organizing Committee. He also served the Program Committee of AQIS2012, AQIS20146, TQC2013, and QIP2017.
附件 

相关文档 
