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:1808.05733 · npj Quantum Information

A programmable two-qubit solid-state quantum processor under ambient conditions

Yang Wu, Ya Wang, Xi Qin, Xing Rong, Jiangfeng Du

Published Jan 25, 2019• 68 citations
arXivHTMLPDF

Abstract

Abstract Quantum computers, which take advantage of the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized state of qubits, which coherently evolves into a final state containing the result of the computation. Although quantum processors with a few qubits have been demonstrated on multiple quantum computing platforms, realization of solid-state programmable quantum processor under ambient conditions remains elusive. Here we report a programable quantum processor that can be programmed with fifteen parameters to realize arbitrary unitary transformations on two spin qubits in a nitrogen-vacancy (NV) center in diamond. We implemented the Deutsch-Jozsa and Grover search algorithms with average success rates above 80%. The results pave the way to implement the programmable method in a large-scale quantum processor.

DOI
10.1038/s41534-019-0129-z

Related papers

Two-Qutrit Quantum Algorithms on a Programmable Superconducting Processor

Tanay Roy, Ziqian Li, Eliot Kapit +1 more

Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We demonstrate a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We develop a parametric coupler to achieve excellent connectivity in the nine-dimensional Hilbert space enabling efficient implementations of two-qutrit gates. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Bernstein-Vazirani, and Grover's search. Our hardware-efficient protocols allow us to show that two stages of Grover's amplification can improve the success rates of an unstructured search with quantum advantage. Our results pave the way for building fully programmable ternary quantum processors using transmons as building blocks for a universal quantum computer.

arXiv:2211.06523•Physical Review Applied•Jun 7, 2023•77 citations

Programmable Networks for Quantum Algorithms

Norbert Schuch, Jens Siewert

The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there have been no standard ways to uniformly generate whole classes of N-qubit gates. We develop a method to generate arbitrary controlled phase-shift operations with a single network of one-qubit and two-qubit operations. This kind of network can be adapted to various physical implementations of quantum computing and is suitable to realize the Deutsch-Jozsa algorithm as well as Grover's search algorithm.

arXiv:quant-ph/0303063•Physical Review Letters•Jul 7, 2003•44 citations

Grover Search with Semiconductor Spin Qubits at Ambient Conditions

Sebastian Gemsheim, Fabian Klüpfel, Max Kneiß +8 more

Grover's algorithm is executed on a commercial quantum computer based on nitrogen-vacancy centers in diamond operating under ambient conditions, achieving fidelities up to $99.98\,\%$. Within a $N=8$ search space of three solid-state nuclear spin qubits, the measured success probabilities of finding a single or two marked states are $(77.3 \pm 3.4)\,\%$ and $(87.0 \pm 4.2)\,\%$, respectively. These values surpass published results for superconducting qubits or any quantum computer operating at room temperature. In addition, the paper also details the calibrated fidelities of the implemented universal gate set.

quant-pharXiv:2609.13022•Sep 14, 2026•0 citations

Demonstration of Two-Qubit Quantum Algorithms with a Solid-State Electronic Processor

L. DiCarlo, Jerry M. Chow, Jay Gambetta +6 more

We present the experimental implementation of two-qubit quantum algorithms in a superconducting circuit. Our processor incorporates local and fast flux biasing of two transmon qubits within a circuit QED architecture. An off-resonant cavity bus shields the qubits from the external environment and couples them to each other via virtual photon exchange. Meanwhile, integrated short-circuited coplanar waveguides proximal to each qubit allow nanosecond control of their frequencies. We demonstrate flux-controlled single-qubit z rotations and a qubit-qubit conditional phase (c-phase) interaction with a coupling strength tunable by two orders of magnitude. These operations are combined with frequency-multiplexed x and y rotations to form a set of gates universal for quantum computation. Dispersive frequency shifts of the cavity bus allow tomography of the two-qubit state, and accurate determination of state purity, fidelity and entanglement. The processor is first programmed to generate and detect entanglement on demand using sequences of five single-qubit operations and one c-phase. The four Bell states are generated with fidelities better than 90%, corresponding to a concurrence of 0.85 or an entanglement of formation of 0.8. Next, the Grover search algorithm is implemented by concatenating eight single-qubit and two c-phases operations. The fidelity of the algorithm output states to the theoretical ideal is ~ 80%, consistent with the observed T1 times ~ 1 us and the total duration ~ 130 ns of the algorithm sequence. We also program and execute the Deutsch-Jozsa algorithm, finding similar performance. Prospects for scaling the processor beyond two qubits will be discussed. Research supported by NSF, NSA and ARO.

Conference on Lasers and Electro-Optics•Jan 1, 2009•1 citation

A programmable qudit-based quantum processor

Yulin Chi, Jieshan Huang, Zhanchuan Zhang +19 more

Controlling and programming quantum devices to process quantum information by the unit of quantum dit, i.e., qudit, provides the possibilities for noise-resilient quantum communications, delicate quantum molecular simulations, and efficient quantum computations, showing great potential to enhance the capabilities of qubit-based quantum technologies. Here, we report a programmable qudit-based quantum processor in silicon-photonic integrated circuits and demonstrate its enhancement of quantum computational parallelism. The processor monolithically integrates all the key functionalities and capabilities of initialisation, manipulation, and measurement of the two quantum quart (ququart) states and multi-value quantum-controlled logic gates with high-level fidelities. By reprogramming the configuration of the processor, we implemented the most basic quantum Fourier transform algorithms, all in quaternary, to benchmark the enhancement of quantum parallelism using qudits, which include generalised Deutsch-Jozsa and Bernstein-Vazirani algorithms, quaternary phase estimation and fast factorization algorithms. The monolithic integration and high programmability have allowed the implementations of more than one million high-fidelity preparations, operations and projections of qudit states in the processor. Our work shows an integrated photonic quantum technology for qudit-based quantum computing with enhanced capacity, accuracy, and efficiency, which could lead to the acceleration of building a large-scale quantum computer.

Nature Communications•Mar 4, 2022•306 citations

Demonstration of a programmable quantum computer module

Shantanu Debnath, Norbert M. Linke, Caroline Figgatt +3 more

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here, we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully-connected set of gate operations that are native to the hardware and have a mean fidelity of 98 %. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa (DJ) and Bernstein-Vazirani (BV) algorithms with average success rates of 95 % and 90 %, respectively. We also perform a coherent quantum Fourier transform (QFT) on five trappedion qubits for phase estimation and period finding with average fidelities of 62 % and 84 %, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

•Mar 15, 2016•10 citations
Abstract Quantum computers, which take advantage of the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized state of qubits, which coherently evolves into a final state containing the result of the computation. Although quantum processors with a few qubits have been demonstrated on multiple quantum computing platforms, realization of solid-state programmable quantum processor under ambient conditions remains elusive. Here we report a programable quantum processor that can be programmed with fifteen parameters to realize arbitrary unitary transformations on two spin qubits in a nitrogen-vacancy (NV) center in diamond. We implemented the Deutsch-Jozsa and Grover search algorithms with average success rates above 80%. The results pave the way to implement the programmable method in a large-scale quantum processor.
Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We demonstrate a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We develop a parametric coupler to achieve excellent connectivity in the nine-dimensional Hilbert space enabling efficient implementations of two-qutrit gates. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Bernstein-Vazirani, and Grover's search. Our hardware-efficient protocols allow us to show that two stages of Grover's amplification can improve the success rates of an unstructured search with quantum advantage. Our results pave the way for building fully programmable ternary quantum processors using transmons as building blocks for a universal quantum computer.
The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there have been no standard ways to uniformly generate whole classes of N-qubit gates. We develop a method to generate arbitrary controlled phase-shift operations with a single network of one-qubit and two-qubit operations. This kind of network can be adapted to various physical implementations of quantum computing and is suitable to realize the Deutsch-Jozsa algorithm as well as Grover's search algorithm.
Grover's algorithm is executed on a commercial quantum computer based on nitrogen-vacancy centers in diamond operating under ambient conditions, achieving fidelities up to 99.98 %99.98\,\%99.98%. Within a N=8N=8N=8 search space of three solid-state nuclear spin qubits, the measured success probabilities of finding a single or two marked states are (77.3±3.4) %(77.3 \pm 3.4)\,\%(77.3±3.4)% and (87.0±4.2) %(87.0 \pm 4.2)\,\%(87.0±4.2)%, respectively. These values surpass published results for superconducting qubits or any quantum computer operating at room temperature. In addition, the paper also details the calibrated fidelities of the implemented universal gate set.
We present the experimental implementation of two-qubit quantum algorithms in a superconducting circuit. Our processor incorporates local and fast flux biasing of two transmon qubits within a circuit QED architecture. An off-resonant cavity bus shields the qubits from the external environment and couples them to each other via virtual photon exchange. Meanwhile, integrated short-circuited coplanar waveguides proximal to each qubit allow nanosecond control of their frequencies. We demonstrate flux-controlled single-qubit z rotations and a qubit-qubit conditional phase (c-phase) interaction with a coupling strength tunable by two orders of magnitude. These operations are combined with frequency-multiplexed x and y rotations to form a set of gates universal for quantum computation. Dispersive frequency shifts of the cavity bus allow tomography of the two-qubit state, and accurate determination of state purity, fidelity and entanglement. The processor is first programmed to generate and detect entanglement on demand using sequences of five single-qubit operations and one c-phase. The four Bell states are generated with fidelities better than 90%, corresponding to a concurrence of 0.85 or an entanglement of formation of 0.8. Next, the Grover search algorithm is implemented by concatenating eight single-qubit and two c-phases operations. The fidelity of the algorithm output states to the theoretical ideal is ~ 80%, consistent with the observed T1 times ~ 1 us and the total duration ~ 130 ns of the algorithm sequence. We also program and execute the Deutsch-Jozsa algorithm, finding similar performance. Prospects for scaling the processor beyond two qubits will be discussed. Research supported by NSF, NSA and ARO.
Controlling and programming quantum devices to process quantum information by the unit of quantum dit, i.e., qudit, provides the possibilities for noise-resilient quantum communications, delicate quantum molecular simulations, and efficient quantum computations, showing great potential to enhance the capabilities of qubit-based quantum technologies. Here, we report a programmable qudit-based quantum processor in silicon-photonic integrated circuits and demonstrate its enhancement of quantum computational parallelism. The processor monolithically integrates all the key functionalities and capabilities of initialisation, manipulation, and measurement of the two quantum quart (ququart) states and multi-value quantum-controlled logic gates with high-level fidelities. By reprogramming the configuration of the processor, we implemented the most basic quantum Fourier transform algorithms, all in quaternary, to benchmark the enhancement of quantum parallelism using qudits, which include generalised Deutsch-Jozsa and Bernstein-Vazirani algorithms, quaternary phase estimation and fast factorization algorithms. The monolithic integration and high programmability have allowed the implementations of more than one million high-fidelity preparations, operations and projections of qudit states in the processor. Our work shows an integrated photonic quantum technology for qudit-based quantum computing with enhanced capacity, accuracy, and efficiency, which could lead to the acceleration of building a large-scale quantum computer.
Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here, we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully-connected set of gate operations that are native to the hardware and have a mean fidelity of 98 %. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa (DJ) and Bernstein-Vazirani (BV) algorithms with average success rates of 95 % and 90 %, respectively. We also perform a coherent quantum Fourier transform (QFT) on five trappedion qubits for phase estimation and period finding with average fidelities of 62 % and 84 %, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.