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:quant-ph/0605117 · Laser Physics

The one-way CNOT simulation

P. Campanale, DOMENICO PICCA

Published Oct 30, 2006• 0 citations
arXivHTMLPDF

Abstract

In this paper, we present the complete simulation of the quantum logic CNOT gate in the one-way model, which consists entirely of one-qubit measurements on a particular class of entangled states.
DOI
10.1134/s1054660x06110107

Related papers

A One-Way Quantum Computer

Robert Raussendorf, Hans J. Briegel

We present a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. The measurements are used to imprint a quantum logic circuit on the state, thereby destroying its entanglement at the same time. Cluster states are thus one-way quantum computers and the measurements form the program.

Physical Review Letters•May 28, 2001•4,576 citations

Realization of a General Three-Qubit Quantum Gate

Farrokh Vatan, Colin P. Williams

We prove that a generic three-qubit quantum logic gate can be implemented using at most 98 one-qubit rotations about the $y$- and $z$-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.

arXiv:quant-ph/0401178•Jan 29, 2004•49 citations

Experimental characterization of universal one-way quantum computing

B A Bell, Mark Tame, A S Clark +3 more

We report the characterization of a universal set of logic gates for one-way quantum computing using a four-photon ‘star’ cluster state generated by fusing photons from two independent photonic crystal fibre sources. We obtain a fidelity for the cluster state of 0.66 ± 0.01 with respect to the ideal case. We perform quantum process tomography to completely characterize a controlled-NOT, Hadamard and T gate all on the same compact entangled resource. Together, these operations make up a universal set of gates such that arbitrary quantum logic can be efficiently constructed from combinations of them. We find process fidelities with respect to the ideal cases of 0.64 ± 0.01 for the CNOT, 0.67 ± 0.03 for the Hadamard and 0.76 ± 0.04 for the T gate. The characterization of these gates enables the simulation of larger protocols and algorithms. As a basic example, we simulate a Swap gate consisting of three concatenated CNOT gates. Our work provides some pragmatic insights into the prospects for building up to a fully scalable and fault-tolerant one-way quantum computer with photons in realistic conditions.

arXiv:1305.0212•New Journal of Physics•May 20, 2013•29 citations

The non—local implementation of a CNOT gate and single—qubit rotation

陈立冻

We show how a CNOT gate and single-qubit rotation can be implemented non-locally,We also report on the quantitative relations between these quantum actions,entanglement and classical communication resources required in the implementation.

中国物理B:英文版•Jan 1, 2002•0 citations

Quantum circuits of CNOT gates

Marc Bataille

We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give algorithms to optimize this type of circuits in some particular cases. Finally we show how to create some usefull entangled states when a CNOT circuit acts on a fully factorized state.

arXiv:2009.13247•Sep 24, 2020•26 citations

Franson-type experiment realizes two-qubit quantum logic gate

Kaoru Sanaka, Karin Kawahara, Takahiro Kuga

Quantum computers promise great improvements in solving problems such as factoring large integers, simulating quantum systems, and database searching. Using a photon as a quantum bit (qubit) is one of the most promising ways to realize a universal quantum computer because the coherent superposition state of a photon is very robust against various sources of decoherence. However, it is too difficult to realize two-qubit (photon) gates because it requires huge nonlinearity between photons. Here we show the realization of a controlled-NOT (CNOT) gate, the most important and elemental two-qubit gate for quantum computation, by extending our previous research. The heart of our experiment is the conditional measurement of two-photon coincidences in the Franson-type experiment[7]. The photon counting measurement plays the same role as the nonlinearity required for the two-qubit gate, and our system reproduces the truth table of the CNOT gate. Furthermore, we create an entangled state from the superposition state by our gate, which is clear evidence that our gate works as a quantum logic gate. Our results make it possible to manipulate the quantum state of photons including entanglement and represent significant progress in the operation of various algorithms in quantum computation.

arXiv:quant-ph/0108001•Aug 1, 2001•3 citations
We prove that a generic three-qubit quantum logic gate can be implemented using at most 98 one-qubit rotations about the yyy- and zzz-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.
We report the characterization of a universal set of logic gates for one-way quantum computing using a four-photon ‘star’ cluster state generated by fusing photons from two independent photonic crystal fibre sources. We obtain a fidelity for the cluster state of 0.66 ± 0.01 with respect to the ideal case. We perform quantum process tomography to completely characterize a controlled-NOT, Hadamard and T gate all on the same compact entangled resource. Together, these operations make up a universal set of gates such that arbitrary quantum logic can be efficiently constructed from combinations of them. We find process fidelities with respect to the ideal cases of 0.64 ± 0.01 for the CNOT, 0.67 ± 0.03 for the Hadamard and 0.76 ± 0.04 for the T gate. The characterization of these gates enables the simulation of larger protocols and algorithms. As a basic example, we simulate a Swap gate consisting of three concatenated CNOT gates. Our work provides some pragmatic insights into the prospects for building up to a fully scalable and fault-tolerant one-way quantum computer with photons in realistic conditions.
Quantum computers promise great improvements in solving problems such as factoring large integers, simulating quantum systems, and database searching. Using a photon as a quantum bit (qubit) is one of the most promising ways to realize a universal quantum computer because the coherent superposition state of a photon is very robust against various sources of decoherence. However, it is too difficult to realize two-qubit (photon) gates because it requires huge nonlinearity between photons. Here we show the realization of a controlled-NOT (CNOT) gate, the most important and elemental two-qubit gate for quantum computation, by extending our previous research. The heart of our experiment is the conditional measurement of two-photon coincidences in the Franson-type experiment[7]. The photon counting measurement plays the same role as the nonlinearity required for the two-qubit gate, and our system reproduces the truth table of the CNOT gate. Furthermore, we create an entangled state from the superposition state by our gate, which is clear evidence that our gate works as a quantum logic gate. Our results make it possible to manipulate the quantum state of photons including entanglement and represent significant progress in the operation of various algorithms in quantum computation.