dorsal/arxiv
View SchemaFranson-type experiment realizes two-qubit quantum logic gate
| Authors | Kaoru Sanaka, Karin Kawahara, Takahiro Kuga |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0108001 |
| URL | https://arxiv.org/abs/quant-ph/0108001 |
Abstract
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.
{
"annotation_id": "609284c2-e3eb-4251-8a63-742c1c0260f5",
"date_created": "2026-03-02T18:01:46.167000Z",
"date_modified": "2026-03-02T18:01:46.167000Z",
"file_hash": "e06e52772921eaca079b8ae274006c37afe33eab6720f9f3c038e52090eb9b6a",
"private": false,
"record": {
"abstract": "Quantum computers promise great improvements in solving problems such as\nfactoring large integers, simulating quantum systems, and database searching.\nUsing a photon as a quantum bit (qubit) is one of the most promising ways to\nrealize a universal quantum computer because the coherent superposition state\nof a photon is very robust against various sources of decoherence. However, it\nis too difficult to realize two-qubit (photon) gates because it requires huge\nnonlinearity between photons. Here we show the realization of a controlled-NOT\n(CNOT) gate, the most important and elemental two-qubit gate for quantum\ncomputation, by extending our previous research. The heart of our experiment is\nthe conditional measurement of two-photon coincidences in the Franson-type\nexperiment[7]. The photon counting measurement plays the same role as the\nnonlinearity required for the two-qubit gate, and our system reproduces the\ntruth table of the CNOT gate. Furthermore, we create an entangled state from\nthe superposition state by our gate, which is clear evidence that our gate\nworks as a quantum logic gate. Our results make it possible to manipulate the\nquantum state of photons including entanglement and represent significant\nprogress in the operation of various algorithms in quantum computation.",
"arxiv_id": "quant-ph/0108001",
"authors": [
"Kaoru Sanaka",
"Karin Kawahara",
"Takahiro Kuga"
],
"categories": [
"quant-ph"
],
"title": "Franson-type experiment realizes two-qubit quantum logic gate",
"url": "https://arxiv.org/abs/quant-ph/0108001"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7dda124e-760d-4220-809b-677cbd14e90d",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}