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

Entanglement and correlations in mixed-state quantum computation

Animesh Datta, Steven T. Flammia, Carlton M. Caves, Guifré Vidal

Published Mar 5, 2007• 0 citations
OpenAlex

Related papers

Entanglement and correlation for identical particles in quantum computing

Angbo Fang, Y. C. Chang

Physics Letters A•May 1, 2003•7 citations

Role of entanglement and correlations in mixed-state quantum computation

Animesh Datta, Guifré Vidal

In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known, such as the deterministic computation with one quantum qubit (DQC1) model [Knill and Laflamme, Phys. Rev. Lett. 81, 5672 (1998)], in which entanglement is at most marginally present, and yet a computational speedup is believed to occur. Correlations, and not entanglement, have been identified as a necessary ingredient for mixed-state quantum computation speedups. Here we show that correlations, as measured through the operator Schmidt rank, are indeed present in large amounts in the DQC1 circuit. This provides evidence for the preclusion of efficient classical simulation of DQC1 by means of a whole class of classical simulation algorithms, thereby reinforcing the conjecture that DQC1 leads to a genuine quantum computational speedup.

arXiv:quant-ph/0611157•Physical Review A•Apr 11, 2007•259 citations

Geometric Measure of Entanglement of Rank-2 Mixed Multiqubit States and its Estimation on a Quantum Processor

N. A. Susulovska, Kh. P. Gnatenko

The geometric measure of entanglement of mixed states is investigated based on its relation to spin correlations. We derive an analytical expression for the entanglement of rank-2 mixed states composed of arbitrary multiqubit pure states within a two-dimensional Hilbert subspace. The dependence of the entanglement of rank-2 mixed multiqubit states on the parameters characterizing arbitrary pure states in the mixture is studied both analytically and using quantum computing. For a particular class of mixed states, namely, equal-probability mixtures of an arbitrary multiqubit state and the Schrödinger cat state, we construct quantum protocols for detecting the geometric measure of entanglement based on its relation to spin correlations. We quantify the entanglement using both the AerSimulator and the ibm_marrakesh quantum computer. The effects of quantum-computing errors are also analyzed. The simulation results reproduce the analytical dependencies, while measurements on the quantum device demonstrate good agreement with theoretical predictions within estimated error bounds.

quant-pharXiv:2610.06127•Oct 6, 2026•0 citations

Quantum correlation and decoherence in quantum computation

Hyungjun Lim

•Jan 1, 2014•0 citations

Quantum entanglement and quantum computing

F. J. Duarte

Institute of Physics eBooks•Sep 1, 2022•0 citations

Quantum dissonance and deterministic quantum computation with a single qubit

Mazhar Ali

Mixed state quantum computation can perform certain tasks which are believed to be efficiently intractable on a classical computer. For a specific model of mixed state quantum computation, namely, deterministic quantum computation with a single qubit (DQC1), recent investigations suggest that quantum correlations other than entanglement might be responsible for the power of DQC1 model. However, strictly speaking, the role of entanglement in this model of computation was not entirely clear. We provide conclusive evidence that there are instances where quantum entanglement is not present in any part of this model, nevertheless we have advantage over classical computation. This establishes the fact that quantum dissonance (a kind of quantum correlations) present in fully separable (FS) states provide power to DQC1 model.

arXiv:1312.1572•International Journal of Quantum Information•Sep 1, 2014•7 citations
In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known, such as the deterministic computation with one quantum qubit (DQC1) model [Knill and Laflamme, Phys. Rev. Lett. 81, 5672 (1998)], in which entanglement is at most marginally present, and yet a computational speedup is believed to occur. Correlations, and not entanglement, have been identified as a necessary ingredient for mixed-state quantum computation speedups. Here we show that correlations, as measured through the operator Schmidt rank, are indeed present in large amounts in the DQC1 circuit. This provides evidence for the preclusion of efficient classical simulation of DQC1 by means of a whole class of classical simulation algorithms, thereby reinforcing the conjecture that DQC1 leads to a genuine quantum computational speedup.
The geometric measure of entanglement of mixed states is investigated based on its relation to spin correlations. We derive an analytical expression for the entanglement of rank-2 mixed states composed of arbitrary multiqubit pure states within a two-dimensional Hilbert subspace. The dependence of the entanglement of rank-2 mixed multiqubit states on the parameters characterizing arbitrary pure states in the mixture is studied both analytically and using quantum computing. For a particular class of mixed states, namely, equal-probability mixtures of an arbitrary multiqubit state and the Schrödinger cat state, we construct quantum protocols for detecting the geometric measure of entanglement based on its relation to spin correlations. We quantify the entanglement using both the AerSimulator and the ibm_marrakesh quantum computer. The effects of quantum-computing errors are also analyzed. The simulation results reproduce the analytical dependencies, while measurements on the quantum device demonstrate good agreement with theoretical predictions within estimated error bounds.
Mixed state quantum computation can perform certain tasks which are believed to be efficiently intractable on a classical computer. For a specific model of mixed state quantum computation, namely, deterministic quantum computation with a single qubit (DQC1), recent investigations suggest that quantum correlations other than entanglement might be responsible for the power of DQC1 model. However, strictly speaking, the role of entanglement in this model of computation was not entirely clear. We provide conclusive evidence that there are instances where quantum entanglement is not present in any part of this model, nevertheless we have advantage over classical computation. This establishes the fact that quantum dissonance (a kind of quantum correlations) present in fully separable (FS) states provide power to DQC1 model.