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

Measuring geometric quantum discord using one bit of quantum information

Gina Passante, Osama Moussa, Raymond Laflamme

Published Mar 19, 2012• 40 citations
arXivHTMLPDF

Abstract

We describe an efficient DQC1 (deterministic quantum computation with one quantum qubit) algorithm to quantify the amount of geometric quantum discord present in the output state of a DQC1 computation. DQC1 is a model of computation that utilizes separable states to solve a problem with no known efficient classical algorithm and is known to contain quantum correlations as measured by the discord. For the general case of a $(1+n)$-qubit DQC1 state we provide an analytical expression for the geometric quantum discord and find that its typical (and maximum) value decreases exponentially with $n$. This is in contrast to the standard quantum discord whose value for typical DQC1 states is known to be independent of $n$. We experimentally demonstrate the proposed algorithm on a four-qubit liquid-state nuclear magnetic resonance quantum information processor. In the special case of a two-qubit DQC1 model, we also provide an expression for the quantum discord that only requires the outcome of the DQC1 algorithm.

DOI
10.1103/physreva.85.032325

Related papers

Experimental detection of nonclassical correlations in mixed-state quantum computation

Gina Passante, Osama Moussa, Denis‐Alexandre Trottier +1 more

We report on an experiment to detect nonclassical correlations in a highly mixed state. The correlations are characterized by the quantum discord and are observed using four qubits in a liquid-state nuclear magnetic resonance quantum information processor. The state analyzed is the output of a DQC1 computation, whose input is a single quantum bit accompanied by $n$ maximally mixed qubits. This model of computation outperforms the best known classical algorithms and, although it contains vanishing entanglement, it is known to have quantum correlations characterized by the quantum discord. This experiment detects nonvanishing quantum discord, ensuring the existence of nonclassical correlations as measured by the quantum discord.

arXiv:1105.2262•Physical Review A•Oct 10, 2011•106 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 investigation of quantum discord in DQC1

Tingwei Li, Yang Wu, Fangzhou Jin +1 more

Quantum discord has been proposed as a resource responsible for the exponential speedup in deterministic quantum computation with one pure qubit (DQC1). Investigation of the quantum discord generated in DQC1 is of significant importance from a fundamental perspective. However, in practical applications of DQC1, qubits generally interact with the environment. Thus, it is also important to investigate the discord when DQC1 is implemented in a noisy environment. We implement DQC1 on an electron spin resonance (ESR) architecture in such an environment and nonzero quantum discord is observed. Furthermore, we find that the values of discord correspond to the values of purity α and quantum Fisher information, which reflect the power of the algorithm. Our results provide further evidence for the role of discord as a resource in DQC1 and are beneficial for understanding the origin of the power of quantum algorithms.

JUSTC•Jan 1, 2022•1 citation

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

Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm

Manuél Ávila, G. H. Sun, A. L. Salas‐Brito

The power of one qubit deterministic quantum processor (DQC1) (Knill and Laflamme (1998)) generates a nonclassical correlation known as quantum discord. The DQC1 algorithm executes in an efficient way with a characteristic time given by τ=Tr[Un]/2n , where Un is an n qubit unitary gate. For pure states, quantum discord means entanglement while for mixed states such a quantity is more than entanglement. Quantum discord can be thought of as the mutual information between two systems. Within the quantum discord approach the role of time in an efficient evaluation of τ is discussed. It is found that the smaller the value of t/T is, where t is the time of execution of the DQC1 algorithm and T is the scale of time where the nonclassical correlations prevail, the more efficient the calculation of τ is. A Mösbauer nucleus might be a good processor of the DQC1 algorithm while a nuclear spin chain would not be efficient for the calculation of τ .

Advances in Mathematical Physics•Jan 1, 2014•3 citations

Geometric quantum discord with Bures distance: the qubit case

Dominique Spehner, M Orszag

The minimal Bures distance of a quantum state of a bipartite system AB to the set of classical states for subsystem A defines a geometric measure of quantum discord. When A is a qubit, we show that this geometric quantum discord is given in terms of the eigenvalues of a (2 n B ) × (2 n B ) Hermitian matrix, n B being the Hilbert space dimension of the other subsystem B . As a first application, we calculate the geometric discord for the output state of the DQC1 algorithm. We find that it takes its highest value when the unitary matrix from which the algorithm computes the trace has its eigenvalues uniformly distributed on the unit circle modulo a symmetry with respect to the origin. As a second application, we derive an explicit formula for the geometric discord of a two-qubit state ρ with maximally mixed marginals and compare it with other measures of quantum correlations. We also determine the closest classical states to ρ.

arXiv:1308.5005•Journal of Physics A Mathematical and Theoretical•Dec 20, 2013•53 citations
We describe an efficient DQC1 (deterministic quantum computation with one quantum qubit) algorithm to quantify the amount of geometric quantum discord present in the output state of a DQC1 computation. DQC1 is a model of computation that utilizes separable states to solve a problem with no known efficient classical algorithm and is known to contain quantum correlations as measured by the discord. For the general case of a (1+n)(1+n)(1+n)-qubit DQC1 state we provide an analytical expression for the geometric quantum discord and find that its typical (and maximum) value decreases exponentially with nnn. This is in contrast to the standard quantum discord whose value for typical DQC1 states is known to be independent of nnn. We experimentally demonstrate the proposed algorithm on a four-qubit liquid-state nuclear magnetic resonance quantum information processor. In the special case of a two-qubit DQC1 model, we also provide an expression for the quantum discord that only requires the outcome of the DQC1 algorithm.
We report on an experiment to detect nonclassical correlations in a highly mixed state. The correlations are characterized by the quantum discord and are observed using four qubits in a liquid-state nuclear magnetic resonance quantum information processor. The state analyzed is the output of a DQC1 computation, whose input is a single quantum bit accompanied by nnn maximally mixed qubits. This model of computation outperforms the best known classical algorithms and, although it contains vanishing entanglement, it is known to have quantum correlations characterized by the quantum discord. This experiment detects nonvanishing quantum discord, ensuring the existence of nonclassical correlations as measured by the quantum discord.
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.
Quantum discord has been proposed as a resource responsible for the exponential speedup in deterministic quantum computation with one pure qubit (DQC1). Investigation of the quantum discord generated in DQC1 is of significant importance from a fundamental perspective. However, in practical applications of DQC1, qubits generally interact with the environment. Thus, it is also important to investigate the discord when DQC1 is implemented in a noisy environment. We implement DQC1 on an electron spin resonance (ESR) architecture in such an environment and nonzero quantum discord is observed. Furthermore, we find that the values of discord correspond to the values of purity α and quantum Fisher information, which reflect the power of the algorithm. Our results provide further evidence for the role of discord as a resource in DQC1 and are beneficial for understanding the origin of the power of quantum algorithms.
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.
The power of one qubit deterministic quantum processor (DQC1) (Knill and Laflamme (1998)) generates a nonclassical correlation known as quantum discord. The DQC1 algorithm executes in an efficient way with a characteristic time given by τ=Tr[Un]/2n , where Un is an n qubit unitary gate. For pure states, quantum discord means entanglement while for mixed states such a quantity is more than entanglement. Quantum discord can be thought of as the mutual information between two systems. Within the quantum discord approach the role of time in an efficient evaluation of τ is discussed. It is found that the smaller the value of t/T is, where t is the time of execution of the DQC1 algorithm and T is the scale of time where the nonclassical correlations prevail, the more efficient the calculation of τ is. A Mösbauer nucleus might be a good processor of the DQC1 algorithm while a nuclear spin chain would not be efficient for the calculation of τ .
The minimal Bures distance of a quantum state of a bipartite system AB to the set of classical states for subsystem A defines a geometric measure of quantum discord. When A is a qubit, we show that this geometric quantum discord is given in terms of the eigenvalues of a (2 n B ) × (2 n B ) Hermitian matrix, n B being the Hilbert space dimension of the other subsystem B . As a first application, we calculate the geometric discord for the output state of the DQC1 algorithm. We find that it takes its highest value when the unitary matrix from which the algorithm computes the trace has its eigenvalues uniformly distributed on the unit circle modulo a symmetry with respect to the origin. As a second application, we derive an explicit formula for the geometric discord of a two-qubit state ρ with maximally mixed marginals and compare it with other measures of quantum correlations. We also determine the closest classical states to ρ.