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

On Experimental Deterministic Quantum Computation with One Quantum Bit (DQC1)

Gina Passante

Published Mar 27, 2012• 2 citations
OpenAlex

Abstract

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. G. Passante ii Quantum information processors have the ability to drastically change our world. By manipulating bits of information ruled by the laws of quantum mechanics, computational devices can perform some computations that are classically intractable. Most quantum algorithms rely on pure qubits as inputs and require entanglement throughout the compu-tation. In this thesis, we explore a model of computation that uses mixed qubits without en-tanglement known as DQC1 (deterministic quantum computation with one quantum bit), using the physical system of liquid-state Nuclear Magnetic Resonance (NMR). Throughout our research, we experimentally implement an algorithm that completely encapsulates the DQC1 model, and take a close look at the quantum nature of DQC1-states as given by the

Related papers

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•108 citations

Entanglement and deterministic quantum computing with one qubit

Michel Boyer, Aharon Brodutch, Tal Mor

The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present tools for learning about entanglement and quantum correlations in dynamical systems where the quantum states are mixed and the eigenvalue spectrum is highly degenerate. We apply these results to the deterministic quantum computing with one qubit (DQC1) computation model and show that the states generated in a DQC1 circuit have an eigenvalue structure that makes them difficult to entangle, even when they are relatively far from the completely mixed state. Our results strengthen the conjecture that it may be possible to find quantum algorithms that do not generate entanglement and yet still have an exponential advantage over their classical counterparts.

arXiv:1606.05283•Physical Review A•Feb 21, 2017•21 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

Studies on the Role of Entanglement in Mixed-state Quantum Computation

Animesh Datta

In this thesis, I look at the role of quantum entanglement in mixed-state quantum computation. The model we consider is the DQC1 or `power of one qubit' model. I show that there is minimal bipartite entanglement in a typical instance of the DQC1 circuit and even put an upper bound on the possible amount of entanglement. This limited amount of entanglement, however, does not imply that the system is classically simulatable. A matrix product state (MPS) algorithm for a typical instance of the DQC1 system requires exponential classical resources. This exposes a gap between the amount of entanglement and the amount of purely nonclassical correlations in a quantum system. This gap, I suggest, can be filled by quantum discord. I calculate it in a typical instance of the DQC1 circuit and find that the amount of discord is a constant fraction of the maximum possible discord for a system of that size. This allows an interpretation of quantum discord as the resource that drives mixed-state quantum computation. I also study quantum discord as a quantity of independent interest. Its role in the phenomenon of entanglement distribution is studied through an easily comprehensible example. This thesis also contains discussions on the relation between the complexity classes P, BQP and DQC1. Additional material is presented on the connections between the DQC1 model, Jones polynomials and statistical mechanics. The thesis concludes with a discussion of a few open problems related to the DQC1 model, the quantum discord and their scope in quantum information science.

arXiv:0807.4490•Jul 28, 2008•83 citations

Cold atoms for deterministic quantum computation with one qubit

Christopher Mansell

In this thesis, I describe a proposal for experiments with dense ensembles of ultracold Rubidium atoms optically excited to highlying electronic states known as Rydberg states. The proposed experiment is designed to implement a model of quantum computation known as deterministic quantum computation with one qubit (DQC1). My proposal is novel among other proposals for Rydberg atoms because it employs mixed states and could provide insights into the source of the enhancements of quantum technology over classical technology. I demonstrate that ultracold atoms and Rydberg interactions offer new perspectives for exploring the DQC1 model. This is mainly due to the large strength, long range and controllability of Rydberg interactions. My specific contributions include: a proposal that solves one of the main issues with implementing quantum logic gates between ensembles of atoms; numerical simulations of the proposed cold atom implementation of a DQC1 protocol; and the design and laboratory implementation of a high-performance optical system for imaging ultracold atoms. These contributions bring the experimental exploration of the DQC1 model closer to realisation.

•Jan 1, 2014•0 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•863 citations
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. G. Passante ii Quantum information processors have the ability to drastically change our world. By manipulating bits of information ruled by the laws of quantum mechanics, computational devices can perform some computations that are classically intractable. Most quantum algorithms rely on pure qubits as inputs and require entanglement throughout the compu-tation. In this thesis, we explore a model of computation that uses mixed qubits without en-tanglement known as DQC1 (deterministic quantum computation with one quantum bit), using the physical system of liquid-state Nuclear Magnetic Resonance (NMR). Throughout our research, we experimentally implement an algorithm that completely encapsulates the DQC1 model, and take a close look at the quantum nature of DQC1-states as given by the
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.
The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present tools for learning about entanglement and quantum correlations in dynamical systems where the quantum states are mixed and the eigenvalue spectrum is highly degenerate. We apply these results to the deterministic quantum computing with one qubit (DQC1) computation model and show that the states generated in a DQC1 circuit have an eigenvalue structure that makes them difficult to entangle, even when they are relatively far from the completely mixed state. Our results strengthen the conjecture that it may be possible to find quantum algorithms that do not generate entanglement and yet still have an exponential advantage over their classical counterparts.
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}$.
In this thesis, I look at the role of quantum entanglement in mixed-state quantum computation. The model we consider is the DQC1 or `power of one qubit' model. I show that there is minimal bipartite entanglement in a typical instance of the DQC1 circuit and even put an upper bound on the possible amount of entanglement. This limited amount of entanglement, however, does not imply that the system is classically simulatable. A matrix product state (MPS) algorithm for a typical instance of the DQC1 system requires exponential classical resources. This exposes a gap between the amount of entanglement and the amount of purely nonclassical correlations in a quantum system. This gap, I suggest, can be filled by quantum discord. I calculate it in a typical instance of the DQC1 circuit and find that the amount of discord is a constant fraction of the maximum possible discord for a system of that size. This allows an interpretation of quantum discord as the resource that drives mixed-state quantum computation. I also study quantum discord as a quantity of independent interest. Its role in the phenomenon of entanglement distribution is studied through an easily comprehensible example. This thesis also contains discussions on the relation between the complexity classes P, BQP and DQC1. Additional material is presented on the connections between the DQC1 model, Jones polynomials and statistical mechanics. The thesis concludes with a discussion of a few open problems related to the DQC1 model, the quantum discord and their scope in quantum information science.
In this thesis, I describe a proposal for experiments with dense ensembles of ultracold Rubidium atoms optically excited to highlying electronic states known as Rydberg states. The proposed experiment is designed to implement a model of quantum computation known as deterministic quantum computation with one qubit (DQC1). My proposal is novel among other proposals for Rydberg atoms because it employs mixed states and could provide insights into the source of the enhancements of quantum technology over classical technology. I demonstrate that ultracold atoms and Rydberg interactions offer new perspectives for exploring the DQC1 model. This is mainly due to the large strength, long range and controllability of Rydberg interactions. My specific contributions include: a proposal that solves one of the main issues with implementing quantum logic gates between ensembles of atoms; numerical simulations of the proposed cold atom implementation of a DQC1 protocol; and the design and laboratory implementation of a high-performance optical system for imaging ultracold atoms. These contributions bring the experimental exploration of the DQC1 model closer to realisation.
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.