Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Noise reconstruction in quantum hardware via convex optimization

Li Li, Harry J. Slatyer, Harrison Ball, Michael Hush, Michael J. Biercuk, Alistair R. Milne, Cornelius Hempel, Claire Edmunds

Published Mar 15, 2021• 0 citations
OpenAlex

Related papers

Reconstruction of quantum channel via convex optimization

Xuan-Lun Huang, Jun Gao, Zhi‐Qiang Jiao +6 more

arXiv:1809.04404•中国科学通报:英文版•Nov 14, 2019•19 citations

True experimental reconstruction of quantum states and processes via convex optimization

Akshay Vijay Gaikwad, Arvind, Kavita Dorai

arXiv:2003.14011•Quantum Information Processing•Jan 1, 2021•17 citations

Simple, Reliable, and Noise-Resilient Continuous-Variable Quantum State Tomography with Convex Optimization

Ingrid Strandberg

Precise reconstruction of unknown quantum states from measurement data, a process commonly called quantum state tomography, is a crucial component in the development of quantum information processing technologies. Many different tomography methods have been proposed over the years. Maximum-likelihood estimation is a prominent example, being the most popular method for a long period of time. Recently, more advanced neural-network methods have started to emerge. Here, we go back to basics and present a method for continuous-variable state reconstruction that is both conceptually and practically simple, based on convex optimization. Convex optimization has been used for process tomography and qubit-state tomography, but seems to have been overlooked for continuous-variable quantum-state tomography. We demonstrate high-fidelity reconstruction of an underlying state from data corrupted by thermal noise and imperfect detection, for both homodyne and heterodyne measurements. A major advantage over other methods is that convex optimization algorithms are guaranteed to converge to the optimal solution.

arXiv:2202.11584•Physical Review Applied•Oct 17, 2022•21 citations

Robust Classification with Adiabatic Quantum Optimization

Vasil S. Denchev, Nan Ding, Vishwanathan, S. V. N. +1 more

We propose a non-convex training objective for robust binary classification of data sets in which label noise is present. The design is guided by the intention of solving the resulting problem by adiabatic quantum optimization. Two requirements are imposed by the engineering constraints of existing quantum hardware: training problems are formulated as quadratic unconstrained binary optimization; and model parameters are represented as binary expansions of low bit-depth. In the present work we validate this approach by using a heuristic classical solver as a stand-in for quantum hardware. Testing on several popular data sets and comparing with a number of existing losses we find substantial advantages in robustness as measured by test error under increasing label noise. Robustness is enabled by the non-convexity of our hardware-compatible loss function, which we name q-loss.

arXiv:1205.1148•International Conference on Machine Learning•May 5, 2012•58 citations

Towards noise-resilient quantum optimization

Madelyn Cain, Leo Zhou, Hannes Pichler +2 more

Bulletin of the American Physical Society•Jun 3, 2021•0 citations

Fast Quantum State Reconstruction via Accelerated Non-Convex Programming

Junhyung Lyle Kim, George A. Kollias, Amir Kalev +2 more

We propose a new quantum state reconstruction method that combines ideas from compressed sensing, non-convex optimization, and acceleration methods. The algorithm, called Momentum-Inspired Factored Gradient Descent (MiFGD), extends the applicability of quantum tomography for larger systems. Despite being a non-convex method, MiFGD converges provably close to the true density matrix at an accelerated linear rate asymptotically in the absence of experimental and statistical noise, under common assumptions. With this manuscript, we present the method, prove its convergence property and provide the Frobenius norm bound guarantees with respect to the true density matrix. From a practical point of view, we benchmark the algorithm performance with respect to other existing methods, in both synthetic and real (noisy) experiments, performed on the IBM’s quantum processing unit. We find that the proposed algorithm performs orders of magnitude faster than the state-of-the-art approaches, with similar or better accuracy. In both synthetic and real experiments, we observed accurate and robust reconstruction, despite the presence of experimental and statistical noise in the tomographic data. Finally, we provide a ready-to-use code for state tomography of multi-qubit systems.

arXiv:2104.07006•Photonics•Jan 22, 2023•17 citations
Precise reconstruction of unknown quantum states from measurement data, a process commonly called quantum state tomography, is a crucial component in the development of quantum information processing technologies. Many different tomography methods have been proposed over the years. Maximum-likelihood estimation is a prominent example, being the most popular method for a long period of time. Recently, more advanced neural-network methods have started to emerge. Here, we go back to basics and present a method for continuous-variable state reconstruction that is both conceptually and practically simple, based on convex optimization. Convex optimization has been used for process tomography and qubit-state tomography, but seems to have been overlooked for continuous-variable quantum-state tomography. We demonstrate high-fidelity reconstruction of an underlying state from data corrupted by thermal noise and imperfect detection, for both homodyne and heterodyne measurements. A major advantage over other methods is that convex optimization algorithms are guaranteed to converge to the optimal solution.
We propose a non-convex training objective for robust binary classification of data sets in which label noise is present. The design is guided by the intention of solving the resulting problem by adiabatic quantum optimization. Two requirements are imposed by the engineering constraints of existing quantum hardware: training problems are formulated as quadratic unconstrained binary optimization; and model parameters are represented as binary expansions of low bit-depth. In the present work we validate this approach by using a heuristic classical solver as a stand-in for quantum hardware. Testing on several popular data sets and comparing with a number of existing losses we find substantial advantages in robustness as measured by test error under increasing label noise. Robustness is enabled by the non-convexity of our hardware-compatible loss function, which we name q-loss.
We propose a new quantum state reconstruction method that combines ideas from compressed sensing, non-convex optimization, and acceleration methods. The algorithm, called Momentum-Inspired Factored Gradient Descent (MiFGD), extends the applicability of quantum tomography for larger systems. Despite being a non-convex method, MiFGD converges provably close to the true density matrix at an accelerated linear rate asymptotically in the absence of experimental and statistical noise, under common assumptions. With this manuscript, we present the method, prove its convergence property and provide the Frobenius norm bound guarantees with respect to the true density matrix. From a practical point of view, we benchmark the algorithm performance with respect to other existing methods, in both synthetic and real (noisy) experiments, performed on the IBM’s quantum processing unit. We find that the proposed algorithm performs orders of magnitude faster than the state-of-the-art approaches, with similar or better accuracy. In both synthetic and real experiments, we observed accurate and robust reconstruction, despite the presence of experimental and statistical noise in the tomographic data. Finally, we provide a ready-to-use code for state tomography of multi-qubit systems.