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:1708.03117 · Journal of Physics B Atomic Molecular and Optical Physics

A universal quantum processor already exists and just waits for the proper programming

V. M. Akulin

Published Nov 21, 2017• 0 citations
arXivHTMLPDF

Abstract

Abstract The possibility of performing the C-NOT gate operation at the ground and the first excited states of two harmonic oscillators interacting via a two-level system subject to complete control is demonstrated. The system resembles Turing machine, where the result of interaction between oscillators and the two-level system is restricted to a certain fixed unitary transformation matrix, while all the control required for the implementation of the gate is provided via manipulations with the two-level system, which remains the only fully-controllable part of the entire system. Each gate operation requires a ‘Turing programming’, which can be realized as a series of ≳ 63 elementary unitary operations. The result shows a way how one can construct a quantum processor in a multimode microwave cavity equipped with a fully controlled two-level system, such as a Josephson-junction chip. Parameters of already existing experimental devises could allow one to perform up to 15 gate operations in an ensemble of about 10 qubits.

DOI
10.1088/1361-6455/aa9c39

Related papers

Universal Jaynes-Cummings Control of an Oscillator

Jordan Huang, Ethan Kasaba, Thomas J. DiNapoli +2 more

The Jaynes-Cummings (JC) interaction-the coherent exchange of excitations between a two-level system and a harmonic oscillator-is one of the fundamental interactions of quantum optics, realized across platforms such as cavity quantum electrodynamics, trapped ions, mechanical resonators, and superconducting circuits. Although JC interactions and qubit rotations form a universal gate set for oscillator control, practical implementations have not been demonstrated. Here we develop and experimentally demonstrate universal JC-based oscillator control by compiling arbitrary unitary gates into sequences of JC interactions and qubit rotations. In our experiment, the oscillator is realized using a mode of a high quality factor microwave cavity and the ancilla qubit using a superconducting transmon circuit, with the JC interaction implemented by a sideband interaction enabled by the Josephson nonlinearity. The native gates are constructed to be closed below a chosen cutoff photon number, encoding a qudit with suppressed leakage errors, while ancilla relaxation errors are detectable. We further find that the dispersive shift serves as a compilation resource that reduces circuit depths. We demonstrate universal qudit control and implement a single-qutrit gate set with a mean post-selected process fidelity of 96.3%, as well as ququart and ququint shift gates. These results establish Jaynes-Cummings control as a practical route to universal oscillator control, enabling programmable bosonic processors across a variety of quantum platforms.

quant-pharXiv:2605.18658•May 19, 2026•4 citations

Construction of a universal quantum computer

Antonio A. Lagana, Max A. Lohe, Lorenz von Smekal

We construct a universal quantum computer following Deutsch's original proposal of a universal quantum Turing machine (UQTM). Like Deutsch's UQTM, our machine can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is universal. We present the architecture of the machine, which consists of a memory tape and a processor and describe the observables that comprise the registers of the processor and the instruction set, which includes a set of operations that can approximate any unitary operation to any desired accuracy and hence is quantum computationally universal. We present the unitary evolution operators that act on the machine to achieve universal computation and discuss each of them in detail and specify and discuss explicit program halting and concatenation schemes. We define and describe a set of primitive programs in order to demonstrate the universal nature of the machine. These primitive programs facilitate the implementation of more complex algorithms and we demonstrate their use by presenting a program that computes the NAND function, thereby also showing that the machine can compute any classically computable function.

Physical Review A•May 18, 2009•8 citations

Universal and Deterministic Manipulation of the Quantum State of Harmonic Oscillators: A Route to Unitary Gates for Fock State Qubits

Marcelo França Santos

We present a simple quantum circuit that allows for the universal and deterministic manipulation of the quantum state of confined harmonic oscillators. The scheme is based on the selective interactions of the referred oscillator with an auxiliary three-level system and a classical external driving source, and enables any unitary operations on Fock states, two by two. One circuit is equivalent to a single qubit unitary logical gate on Fock states qubits. Sequences of similar protocols allow for complete, deterministic, and state-independent manipulation of the harmonic oscillator quantum state.

arXiv:quant-ph/0411078•Physical Review Letters•Jun 27, 2005•39 citations

Efficient implementation of arbitrary two-qubit gates using unified control

Zhen Chen, Weiyang Liu, Yanjun Ma +16 more

The set of quantum logic gates that can be easily implemented is fundamental to the performance of quantum computers, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets often require operating devices outside the ideal parameter regimes used to realize qubits, leading to increased control complexity while offering only a limited set of gates. Here we experimentally demonstrate a unified and versatile gate scheme capable of generating arbitrary two-qubit gates using only an exchange interaction and qubit driving on a superconducting quantum processor. We achieve high fidelities averaging 99.38% across a wide range of commonly used two-qubit unitaries, enabling precise multipartite entangled state preparation. Furthermore, we successfully produce a B gate, which efficiently synthesizes the entire family of two-qubit gates. Our results establish that fully exploiting the capabilities of the exchange interaction can yield a comprehensive and highly accurate gate set. With maximum expressivity, optimal gate time, demonstrated high fidelity and easy adaption to other quantum platforms, our unified control scheme offers the prospect of improved performance in quantum hardware and algorithm development. The efficiency of a quantum computer depends on which basic operations it can implement. Now a scheme that can implement any two-qubit logic gate has been demonstrated on a superconducting architecture.

arXiv:2502.03612•Nature Physics•Aug 15, 2025•31 citations

Non-local quantum gates: A cavity-quantum-electrodynamics implementation

Mauro Paternostro, M. S. Kim, G. Massimo Palma

The problems related to the management of large quantum registers could be handled in the context of distributed quantum computation: unitary non-local transformations among spatially separated local processors are realized performing local unitary transformations and exchanging classical communication. In this paper, a scheme is proposed for the implementation of universal non-local quantum gates such as a controlled NOT (CNOT) and a controlled quantum phase gate (CQPG). The system chosen for their physical implementation is a cavity-quantum-electrodynamics (CQED) system formed by two spatially separated microwave cavities and two trapped Rydberg atoms. The procedures to follow for the realization of each step necessary to perform a specific non-local operation are described.

arXiv:quant-ph/0207043•Journal of Modern Optics•Jan 1, 2003•39 citations

Coupled Josephson quantum bits

Jaw-Shen Tsai, Tsuyoshi Yamamoto, Yu. A. Pashkin +2 more

The technologies of Josephson-junction-based qubits have been progressing rapidly, ever since its first demonstration by a superconducting charge qubit1. A variety of systems have been implemented with remarkable progress in coherence time and read-out schemes. Although the current level of this solid-state device is still not as advanced as that of the most advanced microscopic-system-based qubits, these developments, together with the potential scalability, have renewed its position as a strong candidate as a building block for the quantum computer. Recently, coherent oscillation and microwave spectroscopy in capacitively-coupled superconducting qubits have been reported. The next challenging step toward quantum computation is a realization of logic gates. Here we demonstrate a conditional gate operation using a pair of coupled superconducting charge qubits. Using a pulse technique, we prepare different input states and show that they can be transformed by controlled-NOT (C-NOT) gate operation in the amplitude of the states. Although the phase evolution during the gate operation is still to be clarified, the present results are a major step toward the realization of a universal solid-state quantum gate.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 25, 2004•0 citations
Abstract The possibility of performing the C-NOT gate operation at the ground and the first excited states of two harmonic oscillators interacting via a two-level system subject to complete control is demonstrated. The system resembles Turing machine, where the result of interaction between oscillators and the two-level system is restricted to a certain fixed unitary transformation matrix, while all the control required for the implementation of the gate is provided via manipulations with the two-level system, which remains the only fully-controllable part of the entire system. Each gate operation requires a ‘Turing programming’, which can be realized as a series of ≳ 63 elementary unitary operations. The result shows a way how one can construct a quantum processor in a multimode microwave cavity equipped with a fully controlled two-level system, such as a Josephson-junction chip. Parameters of already existing experimental devises could allow one to perform up to 15 gate operations in an ensemble of about 10 qubits.
The Jaynes-Cummings (JC) interaction-the coherent exchange of excitations between a two-level system and a harmonic oscillator-is one of the fundamental interactions of quantum optics, realized across platforms such as cavity quantum electrodynamics, trapped ions, mechanical resonators, and superconducting circuits. Although JC interactions and qubit rotations form a universal gate set for oscillator control, practical implementations have not been demonstrated. Here we develop and experimentally demonstrate universal JC-based oscillator control by compiling arbitrary unitary gates into sequences of JC interactions and qubit rotations. In our experiment, the oscillator is realized using a mode of a high quality factor microwave cavity and the ancilla qubit using a superconducting transmon circuit, with the JC interaction implemented by a sideband interaction enabled by the Josephson nonlinearity. The native gates are constructed to be closed below a chosen cutoff photon number, encoding a qudit with suppressed leakage errors, while ancilla relaxation errors are detectable. We further find that the dispersive shift serves as a compilation resource that reduces circuit depths. We demonstrate universal qudit control and implement a single-qutrit gate set with a mean post-selected process fidelity of 96.3%, as well as ququart and ququint shift gates. These results establish Jaynes-Cummings control as a practical route to universal oscillator control, enabling programmable bosonic processors across a variety of quantum platforms.
We construct a universal quantum computer following Deutsch's original proposal of a universal quantum Turing machine (UQTM). Like Deutsch's UQTM, our machine can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is universal. We present the architecture of the machine, which consists of a memory tape and a processor and describe the observables that comprise the registers of the processor and the instruction set, which includes a set of operations that can approximate any unitary operation to any desired accuracy and hence is quantum computationally universal. We present the unitary evolution operators that act on the machine to achieve universal computation and discuss each of them in detail and specify and discuss explicit program halting and concatenation schemes. We define and describe a set of primitive programs in order to demonstrate the universal nature of the machine. These primitive programs facilitate the implementation of more complex algorithms and we demonstrate their use by presenting a program that computes the NAND function, thereby also showing that the machine can compute any classically computable function.
We present a simple quantum circuit that allows for the universal and deterministic manipulation of the quantum state of confined harmonic oscillators. The scheme is based on the selective interactions of the referred oscillator with an auxiliary three-level system and a classical external driving source, and enables any unitary operations on Fock states, two by two. One circuit is equivalent to a single qubit unitary logical gate on Fock states qubits. Sequences of similar protocols allow for complete, deterministic, and state-independent manipulation of the harmonic oscillator quantum state.
The set of quantum logic gates that can be easily implemented is fundamental to the performance of quantum computers, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets often require operating devices outside the ideal parameter regimes used to realize qubits, leading to increased control complexity while offering only a limited set of gates. Here we experimentally demonstrate a unified and versatile gate scheme capable of generating arbitrary two-qubit gates using only an exchange interaction and qubit driving on a superconducting quantum processor. We achieve high fidelities averaging 99.38% across a wide range of commonly used two-qubit unitaries, enabling precise multipartite entangled state preparation. Furthermore, we successfully produce a B gate, which efficiently synthesizes the entire family of two-qubit gates. Our results establish that fully exploiting the capabilities of the exchange interaction can yield a comprehensive and highly accurate gate set. With maximum expressivity, optimal gate time, demonstrated high fidelity and easy adaption to other quantum platforms, our unified control scheme offers the prospect of improved performance in quantum hardware and algorithm development. The efficiency of a quantum computer depends on which basic operations it can implement. Now a scheme that can implement any two-qubit logic gate has been demonstrated on a superconducting architecture.
The problems related to the management of large quantum registers could be handled in the context of distributed quantum computation: unitary non-local transformations among spatially separated local processors are realized performing local unitary transformations and exchanging classical communication. In this paper, a scheme is proposed for the implementation of universal non-local quantum gates such as a controlled NOT (CNOT) and a controlled quantum phase gate (CQPG). The system chosen for their physical implementation is a cavity-quantum-electrodynamics (CQED) system formed by two spatially separated microwave cavities and two trapped Rydberg atoms. The procedures to follow for the realization of each step necessary to perform a specific non-local operation are described.
The technologies of Josephson-junction-based qubits have been progressing rapidly, ever since its first demonstration by a superconducting charge qubit1. A variety of systems have been implemented with remarkable progress in coherence time and read-out schemes. Although the current level of this solid-state device is still not as advanced as that of the most advanced microscopic-system-based qubits, these developments, together with the potential scalability, have renewed its position as a strong candidate as a building block for the quantum computer. Recently, coherent oscillation and microwave spectroscopy in capacitively-coupled superconducting qubits have been reported. The next challenging step toward quantum computation is a realization of logic gates. Here we demonstrate a conditional gate operation using a pair of coupled superconducting charge qubits. Using a pulse technique, we prepare different input states and show that they can be transformed by controlled-NOT (C-NOT) gate operation in the amplitude of the states. Although the phase evolution during the gate operation is still to be clarified, the present results are a major step toward the realization of a universal solid-state quantum gate.