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:1504.02460 · Physical Review A

Power of one bit of quantum information in quantum metrology

Hugo V. Cable, Mile Gu, Kavan Kishore Modi

Published Apr 20, 2016• 17 citations
arXivHTMLPDF

Abstract

We present a model of quantum metrology inspired by the computational model known as deterministic quantum computation with one quantum bit (DQC1). Using only one pure qubit together with $l$ fully mixed qubits we obtain measurement precision (defined as root-mean-square error for the parameter being estimated) at the standard quantum limit, which is typically obtained using the same number of uncorrelated qubits in fully pure states. In principle, the standard quantum limit can be exceeded using an additional qubit which adds only a small amount of purity. We show that the discord in the final state vanishes only in the limit of attaining infinite precision for the parameter being estimated.

DOI
10.1103/physreva.93.040304

Related papers

Digital Quantum Estimation

Majid Hassani, Chiara Macchiavello, Lorenzo Maccone

Quantum metrology calculates the ultimate precision of all estimation strategies, measuring what is their root-mean-square error (RMSE) and their Fisher information. Here, instead, we ask how many bits of the parameter we can recover; namely, we derive an information-theoretic quantum metrology. In this setting, we redefine "Heisenberg bound" and "standard quantum limit" (the usual benchmarks in the quantum estimation theory) and show that the former can be attained only by sequential strategies or parallel strategies that employ entanglement among probes, whereas parallel-separable strategies are limited by the latter. We highlight the differences between this setting and the RMSE-based one.

arXiv:1705.06666•Physical Review Letters•Nov 16, 2017•19 citations

Quantum Discord and the Power of One Qubit

Animesh Datta, Anil Shaji, Carlton M. Caves

We use quantum discord to characterize the correlations present in the model called deterministic quantum computation with one quantum bit (DQC1), introduced by Knill and Laflamme [Phys. Rev. Lett. 81, 5672 (1998)10.1103/PhysRevLett.81.5672]. The model involves a collection of qubits in the completely mixed state coupled to a single control qubit that has nonzero purity. The initial state, operations, and measurements in the model all point to a natural bipartite split between the control qubit and the mixed ones. Although there is no entanglement between these two parts, we show that the quantum discord across this split is nonzero for typical instances of the DQC1 ciruit. Nonzero values of discord indicate the presence of nonclassical correlations. We propose quantum discord as figure of merit for characterizing the resources present in this computational model.

arXiv:0709.0548•Physical Review Letters•Feb 5, 2008•1,257 citations

Experimental Quantum Computing without Entanglement

B. P. Lanyon, Marco Barbieri, Marcelo Pereira de Almeida +1 more

Deterministic quantum computation with one pure qubit (DQC1) is an efficient model of computation that uses highly mixed states. Unlike pure-state models, its power is not derived from the generation of a large amount of entanglement. Instead it has been proposed that other nonclassical correlations are responsible for the computational speedup, and that these can be captured by the quantum discord. In this Letter we implement DQC1 in an all-optical architecture, and experimentally observe the generated correlations. We find no entanglement, but large amounts of quantum discord-except in three cases where an efficient classical simulation is always possible. Our results show that even fully separable, highly mixed, states can contain intrinsically quantum mechanical correlations and that these could offer a valuable resource for quantum information technologies.

arXiv:0807.0668•Physical Review Letters•Nov 13, 2008•872 citations

Hardness of Classically Simulating the One-Clean-Qubit Model

Tomoyuki Morimae, Keisuke Fujii, Joseph F. Fitzsimons

Deterministic quantum computation with one quantum bit (DQC1) [E. Knill and R. Laflamme, Phys. Rev. Lett. 81, 5672 (1998)] is a model of quantum computing where the input is restricted to containing a single qubit in a pure state and has all other qubits in a completely mixed state. Only the single pure qubit is measured at the end of the computation. While it is known that DQC1 can efficiently solve several problems for which no known classical efficient algorithms exist, the question of whether DQC1 is really more powerful than classical computation remains open. In this Letter, we introduce a slightly modified version of DQC1, which we call DQC1(k), where k output qubits are measured, and show that DQC1(k) cannot be classically efficiently simulated for any k≥3 unless the polynomial hierarchy collapses at the third level.

arXiv:1312.2496•Physical Review Letters•Apr 2, 2014•99 citations

Classical simulatability of the one clean qubit model

Tomoyuki Morimae, Takeshi Koshiba

Deterministic quantum computation with one quantum bit (DQC1), or the one clean qubit model, [E. Knill and R. Laflamme, Phys. Rev. Lett. {\bf81}, 5672 (1998)] is a model of quantum computing where the input is the tensor product of a single pure qubit and many completely-mixed states, and only the single qubit is measured at the end of the computation. In spite of its naive appearance, the DQC1 model can efficiently solve some problems for which no classical efficient algorithms are known, and therefore it has been conjectured that the DQC1 model is more powerful than classical computing (under the assumption of $\mbox{BPP}\subsetneq\mbox{BQP}$). Here we show that the output probability distribution of the DQC1 model cannot be classically efficiently approximated (exactly within a polynomial bit length or in the fully polynomial randomized approximation scheme (FPRAS) with at most a constant error) unless $\mbox{BQP}\subseteq\mbox{BPP}$.

arXiv:1405.6840•May 27, 2014•2 citations

Near-optimal quantum metrology with few-qubit measurements

Liang Mao, Senrui Chen, Hsin-Yuan Huang +2 more

Quantum metrology, which addresses parameter estimation in quantum systems, has broad applications across science and technology. Conventional metrology protocols for multi-qubit states in the multi-parameter regime typically require highly complex quantum measurements, leading to substantial quantum-resource costs. In this work, we introduce a family of metrology protocols that use only few-qubit measurements, thereby significantly reducing the required resources. For arbitrary pure states, one of our protocols approaches the quantum Cramér-Rao bound up to an overhead in sample complexity that scales linearly with the number of qubits, irrespective of the number of parameters to be estimated. For typical Haar-random states, this overhead can be reduced to a constant. Our results build on recent advances in quantum state certification protocols with few-qubit measurements: we establish a universal connection between certification and metrology in which the precision of the certification protocol determines the metrological overhead. We also illustrate our approach through an example of Hamiltonian estimation from ground states.

quant-pharXiv:2608.01617•Aug 4, 2026•0 citations
We present a model of quantum metrology inspired by the computational model known as deterministic quantum computation with one quantum bit (DQC1). Using only one pure qubit together with lll fully mixed qubits we obtain measurement precision (defined as root-mean-square error for the parameter being estimated) at the standard quantum limit, which is typically obtained using the same number of uncorrelated qubits in fully pure states. In principle, the standard quantum limit can be exceeded using an additional qubit which adds only a small amount of purity. We show that the discord in the final state vanishes only in the limit of attaining infinite precision for the parameter being estimated.
Quantum metrology calculates the ultimate precision of all estimation strategies, measuring what is their root-mean-square error (RMSE) and their Fisher information. Here, instead, we ask how many bits of the parameter we can recover; namely, we derive an information-theoretic quantum metrology. In this setting, we redefine "Heisenberg bound" and "standard quantum limit" (the usual benchmarks in the quantum estimation theory) and show that the former can be attained only by sequential strategies or parallel strategies that employ entanglement among probes, whereas parallel-separable strategies are limited by the latter. We highlight the differences between this setting and the RMSE-based one.
We use quantum discord to characterize the correlations present in the model called deterministic quantum computation with one quantum bit (DQC1), introduced by Knill and Laflamme [Phys. Rev. Lett. 81, 5672 (1998)10.1103/PhysRevLett.81.5672]. The model involves a collection of qubits in the completely mixed state coupled to a single control qubit that has nonzero purity. The initial state, operations, and measurements in the model all point to a natural bipartite split between the control qubit and the mixed ones. Although there is no entanglement between these two parts, we show that the quantum discord across this split is nonzero for typical instances of the DQC1 ciruit. Nonzero values of discord indicate the presence of nonclassical correlations. We propose quantum discord as figure of merit for characterizing the resources present in this computational model.
Deterministic quantum computation with one pure qubit (DQC1) is an efficient model of computation that uses highly mixed states. Unlike pure-state models, its power is not derived from the generation of a large amount of entanglement. Instead it has been proposed that other nonclassical correlations are responsible for the computational speedup, and that these can be captured by the quantum discord. In this Letter we implement DQC1 in an all-optical architecture, and experimentally observe the generated correlations. We find no entanglement, but large amounts of quantum discord-except in three cases where an efficient classical simulation is always possible. Our results show that even fully separable, highly mixed, states can contain intrinsically quantum mechanical correlations and that these could offer a valuable resource for quantum information technologies.
Deterministic quantum computation with one quantum bit (DQC1) [E. Knill and R. Laflamme, Phys. Rev. Lett. 81, 5672 (1998)] is a model of quantum computing where the input is restricted to containing a single qubit in a pure state and has all other qubits in a completely mixed state. Only the single pure qubit is measured at the end of the computation. While it is known that DQC1 can efficiently solve several problems for which no known classical efficient algorithms exist, the question of whether DQC1 is really more powerful than classical computation remains open. In this Letter, we introduce a slightly modified version of DQC1, which we call DQC1(k), where k output qubits are measured, and show that DQC1(k) cannot be classically efficiently simulated for any k≥3 unless the polynomial hierarchy collapses at the third level.
Deterministic quantum computation with one quantum bit (DQC1), or the one clean qubit model, [E. Knill and R. Laflamme, Phys. Rev. Lett. {\bf81}, 5672 (1998)] is a model of quantum computing where the input is the tensor product of a single pure qubit and many completely-mixed states, and only the single qubit is measured at the end of the computation. In spite of its naive appearance, the DQC1 model can efficiently solve some problems for which no classical efficient algorithms are known, and therefore it has been conjectured that the DQC1 model is more powerful than classical computing (under the assumption of $\mbox{BPP}\subsetneq\mbox{BQP}$). Here we show that the output probability distribution of the DQC1 model cannot be classically efficiently approximated (exactly within a polynomial bit length or in the fully polynomial randomized approximation scheme (FPRAS) with at most a constant error) unless $\mbox{BQP}\subseteq\mbox{BPP}$.
Quantum metrology, which addresses parameter estimation in quantum systems, has broad applications across science and technology. Conventional metrology protocols for multi-qubit states in the multi-parameter regime typically require highly complex quantum measurements, leading to substantial quantum-resource costs. In this work, we introduce a family of metrology protocols that use only few-qubit measurements, thereby significantly reducing the required resources. For arbitrary pure states, one of our protocols approaches the quantum Cramér-Rao bound up to an overhead in sample complexity that scales linearly with the number of qubits, irrespective of the number of parameters to be estimated. For typical Haar-random states, this overhead can be reduced to a constant. Our results build on recent advances in quantum state certification protocols with few-qubit measurements: we establish a universal connection between certification and metrology in which the precision of the certification protocol determines the metrological overhead. We also illustrate our approach through an example of Hamiltonian estimation from ground states.