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

arXiv:2007.02537 · Physical Review Letters

Quantum State Learning via Single-Shot Measurements

Sang Min Lee, Hee Su Park, Jinhyoung Lee, Jaewan Kim, Jeongho Bang

Published Apr 30, 2021• 9 citations
arXivHTMLPDF

Abstract

A novel machine-learning algorithm based on single-shot measurements, named single-shot measurement learning, is demonstrated achieving the theoretical optimal accuracy. The method is at least as efficient as existing tomographic schemes and computationally much less demanding. The merits are attributed to the inclusion of weighted randomness in the learning rule governing the exploration of diverse learning routes. These advantages are explored experimentally by a linear-optical setup that is designed to draw the fullest potential of the proposed method. The experimental results show an unprecedented high level of accuracy for qubit-state learning and reproduction exhibiting (nearly) optimal infidelity scaling, O(N^{-0.983}), for the number N of unknown state copies, down to <10^{-5} without any compensation for experimental nonidealities. Extension to high dimensions is discussed with simulation results.

DOI
10.1103/physrevlett.126.170504

Related papers

Learning unknown pure quantum states

Sang Min Lee, Jinhyoung Lee, Jeongho Bang

We propose a learning method for estimating unknown pure quantum states. The basic idea of our method is to learn a unitary operation $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{U}$ that transforms a given unknown state $|{\ensuremath{\psi}}_{\ensuremath{\tau}}\ensuremath{\rangle}$ to a known fiducial state $|f\ensuremath{\rangle}$. Then, after completion of the learning process, we can estimate and reproduce $|{\ensuremath{\psi}}_{\ensuremath{\tau}}\ensuremath{\rangle}$ based on the learned $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{U}$ and $|f\ensuremath{\rangle}$. To realize this idea, we cast a random-based learning algorithm, called ``single-shot measurement learning,'' in which the learning rule is based on an intuitive and reasonable criterion: the greater the number of success (or failure), the less (or more) changes are imposed. Remarkably, the learning process occurs by means of a single-shot measurement outcome. We demonstrate that our method works effectively, i.e., the learning is completed with a finite number, say $N$, of unknown-state copies. Most surprisingly, our method allows the maximum statistical accuracy to be achieved for large $N$, namely $\ensuremath{\simeq}O({N}^{\ensuremath{-}1})$ scales of average infidelity. It highlights a nontrivial message, that is, a random-based strategy can potentially be as accurate as other standard statistical approaches.

arXiv:1805.06580•Physical Review A•Nov 2, 2018•19 citations

Single-shot measurement learning as a self-certifying estimator for quantum-enhanced sensing

Jeongho Bang

Single-shot measurement learning (SSML) learns a compensation unitary from a one-bit success/failure record and halts after a prescribed run of consecutive successes. We recast SSML as an adaptive estimator on a parameterized sensing manifold and ask what role it can play in quantum-enhanced sensing. First, we show that the terminal run itself furnishes an intrinsic certificate of local alignment: longer terminal runs certify smaller infidelity, and near the optimum this becomes a Fisher-calibrated certificate of parameter error. Second, for compensation-type sensing families, the Bernoulli success/failure record is locally matched to the probe quantum Fisher information (QFI), so SSML preserves the probe's metrological content despite using only one classical bit per copy. In this sense, SSML makes the quantum enhancement carried by the probe operationally available in an online self-terminating protocol. Applied to GHZ/NOON probes of depth $m$, SSML retains the familiar square-root entanglement gain over product probes at fixed total resource, while an ideal multiscale architecture remains compatible with Heisenberg scaling. Monte Carlo simulations of photonic NOON-state phase sensing show the expected near-inverse decay of terminal infidelity with entangled shots, SQL-like total-resource scaling at fixed entanglement depth, the corresponding fixed-resource entanglement gain, the global limitation of a single fringe scale, and the recovery of Heisenberg-compatible behavior under ideal multiscale hand-off. These results identify SSML as a Fisher-preserving, self-certifying estimator layer for quantum-enhanced sensing.

quant-pharXiv:2604.01534•Apr 3, 2026•0 citations

Experimental demonstration of real-time adaptive one-qubit quantum-state tomography

Qi Yin, Li Li, Xiao Xiang +3 more

Quantum-state tomography plays a pivotal role in quantum computation and information processing. To improve the accuracy in estimating an unknown state, carefully designed measurement schemes, such as adopting an adaptive strategy, are necessarily needed, which have gained great interest recently. In this work, based on the proposal of Sugiyama et al. [Phys. Rev. A 85, 052107 (2012)], we experimentally realize an adaptive quantum-state tomography for one qubit in an optical system. Since this scheme gives an analytical solution to the optimal measurement basis problem, our experiment is updated in real time and the infidelity between the real state and the estimated state is tracked with the detected photons. We observe an almost $1/N$ scaling rule of averaged infidelity against the overall number of photons, $N$, in our experiment, which outperforms $1/\sqrt{N}$ of nonadaptive schemes.

Physical Review A•Jan 20, 2017•7 citations

Learning the tensor network model of a quantum state using a few single-qubit measurements

Sergei S. Kuzmin, Varvara Mikhailova, I. V. Dyakonov +1 more

The constantly increasing dimensionality of artificial quantum systems demands for highly efficient methods for their characterization and benchmarking. Conventional quantum tomography fails for larger systems due to the exponential growth of the required number of measurements. The conceptual solution for this dimensionality curse relies on a simple idea---a complete description of a quantum state is excessive and can be discarded in favor of experimentally accessible information about the system. The probably approximately correct learning theory has been recently successfully applied to a problem of building accurate predictors for the measurement outcomes using a data set which scales only linearly with the number of qubits. Here, we present a constructive and numerically efficient protocol which learns a tensor network model of an unknown quantum system. We discuss the limitations and the scalability of the proposed method.

arXiv:2309.00397•Physical Review A•May 9, 2024•7 citations

High-accuracy Hamiltonian learning via delocalized quantum state evolutions

Davide Rattacaso, Gianluca Passarelli, Procolo Lucignano

Learning the unknown Hamiltonian governing the dynamics of a quantum many-body system is a challenging task. In this manuscript, we propose a possible strategy based on repeated measurements on a single time-dependent state. We prove that the accuracy of the learning process is maximized for states that are delocalized in the Hamiltonian eigenbasis. This implies that delocalization is a quantum resource for Hamiltonian learning, that can be exploited to select optimal initial states for learning algorithms. We investigate the error scaling of our reconstruction with respect to the number of measurements, and we provide examples of our learning algorithm on simulated quantum systems.

arXiv:2204.03997•Quantum•Jan 26, 2023•8 citations

Quantum-Inspired Optimization for Large-Scale Machine Learning

Jincheng Zhang

The rapid growth of machine learning (ML) has been accompanied by a significant challenge: the scaling of optimization algorithms to handle the immense parameter spaces of modern models, such as deep neural networks. Traditional optimization methods, including gradient descent and its variants, often encounter difficulties in efficiently exploring these spaces, leading to slow training times and potential stagnation. This paper investigates the application of quantum-inspired optimization techniques to address this scaling problem. We explore algorithms inspired by quantum annealing and other quantum phenomena, adapting their core principles to classical computation. Specifically, we propose a novel optimization framework utilizing a stochastic search strategy based on quantum superposition and measurement, designed to navigate high-dimensional parameter spaces more effectively. The efficacy of this approach is evaluated through theoretical analysis and conceptual simulations, demonstrating its potential to accelerate the training of large-scale machine learning models. We demonstrate how these methods can improve convergence speed and potentially escape local minima more effectively than conventional techniques. The core contribution lies in providing a theoretical foundation and a practical framework for applying quantum-inspired concepts to optimization within the context of machine learning.

•Sep 6, 2026•0 citations
A novel machine-learning algorithm based on single-shot measurements, named single-shot measurement learning, is demonstrated achieving the theoretical optimal accuracy. The method is at least as efficient as existing tomographic schemes and computationally much less demanding. The merits are attributed to the inclusion of weighted randomness in the learning rule governing the exploration of diverse learning routes. These advantages are explored experimentally by a linear-optical setup that is designed to draw the fullest potential of the proposed method. The experimental results show an unprecedented high level of accuracy for qubit-state learning and reproduction exhibiting (nearly) optimal infidelity scaling, O(N^{-0.983}), for the number N of unknown state copies, down to <10^{-5} without any compensation for experimental nonidealities. Extension to high dimensions is discussed with simulation results.
We propose a learning method for estimating unknown pure quantum states. The basic idea of our method is to learn a unitary operation $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{U}$ that transforms a given unknown state $|{\ensuremath{\psi}}_{\ensuremath{\tau}}\ensuremath{\rangle}$ to a known fiducial state $|f\ensuremath{\rangle}$. Then, after completion of the learning process, we can estimate and reproduce $|{\ensuremath{\psi}}_{\ensuremath{\tau}}\ensuremath{\rangle}$ based on the learned $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{U}$ and $|f\ensuremath{\rangle}$. To realize this idea, we cast a random-based learning algorithm, called ``single-shot measurement learning,'' in which the learning rule is based on an intuitive and reasonable criterion: the greater the number of success (or failure), the less (or more) changes are imposed. Remarkably, the learning process occurs by means of a single-shot measurement outcome. We demonstrate that our method works effectively, i.e., the learning is completed with a finite number, say NNN, of unknown-state copies. Most surprisingly, our method allows the maximum statistical accuracy to be achieved for large NNN, namely $\ensuremath{\simeq}O({N}^{\ensuremath{-}1})$ scales of average infidelity. It highlights a nontrivial message, that is, a random-based strategy can potentially be as accurate as other standard statistical approaches.
Single-shot measurement learning (SSML) learns a compensation unitary from a one-bit success/failure record and halts after a prescribed run of consecutive successes. We recast SSML as an adaptive estimator on a parameterized sensing manifold and ask what role it can play in quantum-enhanced sensing. First, we show that the terminal run itself furnishes an intrinsic certificate of local alignment: longer terminal runs certify smaller infidelity, and near the optimum this becomes a Fisher-calibrated certificate of parameter error. Second, for compensation-type sensing families, the Bernoulli success/failure record is locally matched to the probe quantum Fisher information (QFI), so SSML preserves the probe's metrological content despite using only one classical bit per copy. In this sense, SSML makes the quantum enhancement carried by the probe operationally available in an online self-terminating protocol. Applied to GHZ/NOON probes of depth mmm, SSML retains the familiar square-root entanglement gain over product probes at fixed total resource, while an ideal multiscale architecture remains compatible with Heisenberg scaling. Monte Carlo simulations of photonic NOON-state phase sensing show the expected near-inverse decay of terminal infidelity with entangled shots, SQL-like total-resource scaling at fixed entanglement depth, the corresponding fixed-resource entanglement gain, the global limitation of a single fringe scale, and the recovery of Heisenberg-compatible behavior under ideal multiscale hand-off. These results identify SSML as a Fisher-preserving, self-certifying estimator layer for quantum-enhanced sensing.
Quantum-state tomography plays a pivotal role in quantum computation and information processing. To improve the accuracy in estimating an unknown state, carefully designed measurement schemes, such as adopting an adaptive strategy, are necessarily needed, which have gained great interest recently. In this work, based on the proposal of Sugiyama et al. [Phys. Rev. A 85, 052107 (2012)], we experimentally realize an adaptive quantum-state tomography for one qubit in an optical system. Since this scheme gives an analytical solution to the optimal measurement basis problem, our experiment is updated in real time and the infidelity between the real state and the estimated state is tracked with the detected photons. We observe an almost 1/N1/N1/N scaling rule of averaged infidelity against the overall number of photons, NNN, in our experiment, which outperforms 1/N1/\sqrt{N}1/N​ of nonadaptive schemes.
The constantly increasing dimensionality of artificial quantum systems demands for highly efficient methods for their characterization and benchmarking. Conventional quantum tomography fails for larger systems due to the exponential growth of the required number of measurements. The conceptual solution for this dimensionality curse relies on a simple idea---a complete description of a quantum state is excessive and can be discarded in favor of experimentally accessible information about the system. The probably approximately correct learning theory has been recently successfully applied to a problem of building accurate predictors for the measurement outcomes using a data set which scales only linearly with the number of qubits. Here, we present a constructive and numerically efficient protocol which learns a tensor network model of an unknown quantum system. We discuss the limitations and the scalability of the proposed method.
Learning the unknown Hamiltonian governing the dynamics of a quantum many-body system is a challenging task. In this manuscript, we propose a possible strategy based on repeated measurements on a single time-dependent state. We prove that the accuracy of the learning process is maximized for states that are delocalized in the Hamiltonian eigenbasis. This implies that delocalization is a quantum resource for Hamiltonian learning, that can be exploited to select optimal initial states for learning algorithms. We investigate the error scaling of our reconstruction with respect to the number of measurements, and we provide examples of our learning algorithm on simulated quantum systems.
The rapid growth of machine learning (ML) has been accompanied by a significant challenge: the scaling of optimization algorithms to handle the immense parameter spaces of modern models, such as deep neural networks. Traditional optimization methods, including gradient descent and its variants, often encounter difficulties in efficiently exploring these spaces, leading to slow training times and potential stagnation. This paper investigates the application of quantum-inspired optimization techniques to address this scaling problem. We explore algorithms inspired by quantum annealing and other quantum phenomena, adapting their core principles to classical computation. Specifically, we propose a novel optimization framework utilizing a stochastic search strategy based on quantum superposition and measurement, designed to navigate high-dimensional parameter spaces more effectively. The efficacy of this approach is evaluated through theoretical analysis and conceptual simulations, demonstrating its potential to accelerate the training of large-scale machine learning models. We demonstrate how these methods can improve convergence speed and potentially escape local minima more effectively than conventional techniques. The core contribution lies in providing a theoretical foundation and a practical framework for applying quantum-inspired concepts to optimization within the context of machine learning.