There is an increasing interest in quantum algorithms for optimization problems. Within convex optimization, interior-point methods and other recently proposed quantum algorithms are non-trivial to implement on noisy quantum devices. Here, we discuss how to utilize an alternative approach to convex optimization, in general, and semidefinite programming (SDP), in particular. This approach is based on a randomized variant of the cutting-plane method. We show how to leverage quantum speed-up of an eigensolver in speeding up an SDP solver utilizing the cutting-plane method. For the first time, we demonstrate a practical implementation of a randomized variant of the cutting-plane method for semidefinite programming on instances from SDPLIB, a well-known benchmark. Furthermore, we show that the RCP method is very robust to noise in the boundary oracle, which may make RCP suitable for use even on noisy quantum devices.
Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；Imperial College London（帝国理工学院）；University of Oxford（牛津大学）；MajuLab, CNRS-UNS-NUS-NTU International Joint Research Unit（Maju实验室，法国国家科学研究中心-尼斯大学-新加坡国立大学-南洋理工大学国际联合研究单位）；National Institute of Education, Nanyang Technological University（南洋理工大学国立教育学院）
Semidefinite programs (SDPs) are convex optimization programs with vast applications in control theory, quantum information, combinatorial optimization and operational research. Noisy intermediate-scale quantum (NISQ) algorithms aim to make an efficient use of the current generation of quantum hardware. However, optimizing variational quantum algorithms is a challenge as it is an NP-hard problem that in general requires an exponential time to solve and can contain many far from optimal local minima. Here, we present a current term NISQ algorithm for solving SDPs. The classical optimization pro…
We introduce a new method to reconstruct unknown quantum states out of incomplete and noisy information. The method is a linear convex optimization problem, therefore with a unique minimum, which can be efficiently solved with Semidefinite Programs. Numerical simulations indicate that the estimated state does not overestimate purity, and neither the expectation value of optimal entanglement witnesses. The convergence properties of the method are similar to compressed sensing approaches, in the sense that, in order to reconstruct low rank states, it needs just a fraction of the effort correspon…
The accuracies of modern quantum logic clocks have surpassed those of standard atomic fountain clocks. These clocks also provide a greater degree of control, because before and after clock queries, we are able to apply chosen unitary operations and measurements. Here, we take advantage of these choices and present a numerical technique designed to increase the accuracy of these clocks. We use a greedy approach, minimizing the phase variance of a noisy classical oscillator with respect to a perfect frequency standard after an interrogation step; we do not optimize over successive interrogations…
Quantum error correction (QEC) is an essential element of physical quantum information processing systems. Most QEC efforts focus on extending classical error correction schemes to the quantum regime. The input to a noisy system is embedded in a coded subspace, and error recovery is performed via an operation designed to perfectly correct for a set of errors, presumably a large subset of the physical noise process. In this paper, we examine the choice of recovery operation. Rather than seeking perfect correction on a subset of errors, we seek a recovery operation to maximize the entanglement f…
In this work, inspired by the study of semidefinite programming for block-diagonalizing matrix *-algebras, we propose an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum channel. We prove that this algorithm will work for all cases with probability one, and it is more efficient than the algorithm proposed by Holbrook, Kribs, and Laflamme [Quant. Inf. Proc. 80, 381 (2003)]. In fact, our results reveal that this previous algorithm only works for special cases. As an application, we discuss how this method can be applied to increase t…
Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography
Institute for Quantum Information, RWTH Aachen University（亚琛工业大学量子信息研究所）；Institut für Theoretische Physik, Leibniz Universität Hannover（汉诺威莱布尼茨大学理论物理研究所）
CutBackdoor: A Circuit Cut Triggered Backdoor Attack on Variational Quantum Algorithms
University of Central Florida（中佛罗里达大学）；University of Florida（佛罗里达大学）；North Carolina State University（北卡罗来纳州立大学）；Indiana University Bloomington（印第安纳大学伯明顿分校）
National University of Singapore（新加坡国立大学）；Nanyang Technological University（南洋理工大学）；University of Maryland（马里兰大学）；Joint Quantum Institute, NIST/University of Maryland（美国国家标准与技术研究院/马里兰大学联合量子研究所）；Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（美国国家标准与技术研究院/马里兰大学联合量子信息与计算科学中心）
