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:2609.13022

Grover Search with Semiconductor Spin Qubits at Ambient Conditions

Sebastian Gemsheim, Fabian Klüpfel, Max Kneiß, Nicole Raatz, Tobias Herzig, Matthias Mendt, Evgeny Kreissig, Ulrike Rückert, Albrecht Hänel, Jan Meijer, Marius Grundmann

quant-phSubmitted Sep 11, 2026• Announced Sep 14, 2026• 0 citations• Revised Sep 18, 2026 (v2)
v1 · Sep 11, 2026v2 · Sep 18, 2026
arXivHTMLPDF

Abstract

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.

Comments
6 pages, 3 figures; v2: corrected typos, added supplemental material

Related papers

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

Yang Wu, Ya Wang, Xi Qin +2 more

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.

arXiv:1808.05733•npj Quantum Information•Jan 25, 2019•61 citations

Efficient Implementation of a Quantum Algorithm in a Single Nitrogen-Vacancy Center of Diamond

Jingfu Zhang, Swathi S. Hegde, Dieter Suter

Quantum computers have the potential to speed up certain problems that are hard for classical computers. Hybrid systems, such as the nitrogen-vacancy (NV) center in diamond, are among the most promising systems to implement quantum computing, provided the control of the different types of qubits can be efficiently implemented. In the case of the NV center, the anisotropic hyperfine interaction allows one to control the nuclear spins indirectly, through gate operations targeting the electron spin, combined with free precession. Here, we demonstrate that this approach allows one to implement a full quantum algorithm, using the example of Grover's quantum search in a single NV center, whose electron is coupled to a carbon nuclear spin.

arXiv:1911.06371•Physical Review Letters•Jul 14, 2020•64 citations

Grover’s algorithm in a four-qubit silicon processor above the fault-tolerant threshold

Ian Thorvaldson, D. Poulos, Christian M. Moehle +15 more

Spin qubits in silicon are strong contenders for the realization of a practical quantum computer, having demonstrated single- and two-qubit gates with fidelities above the fault-tolerant threshold, and entanglement of three qubits. However, maintaining high-fidelity operations while increasing the qubit count remains challenging and therefore only two-qubit algorithms have been executed. Here we utilize a four-qubit silicon processor with all control fidelities above the fault-tolerant threshold and demonstrate a three-qubit Grover's search algorithm with a ~95% probability of finding the marked state. Our processor is made of three phosphorus atoms precision-patterned into isotopically pure silicon, which localise one electron. The long coherence times of the qubits enable single-qubit fidelities above 99.9% for all qubits. Moreover, the efficient single-pulse multi-qubit operations enabled by the electron-nuclear hyperfine interaction facilitate controlled-Z gates between all pairs of nuclear spins with fidelities above 99% when using the electron as an ancilla. These control fidelities, combined with high-fidelity non-demolition readout of all nuclear spins, allow the creation of a three-qubit Greenberger-Horne-Zeilinger state with 96.2% fidelity. Looking ahead, coupling neighbouring nuclear spin registers, as the one shown here, via electron-electron exchange may enable larger, fault-tolerant quantum processors.

arXiv:2404.08741•Nature Nanotechnology•Feb 20, 2025•35 citations

Towards a room temperature solid state quantum processor - the nitrogen-vacancy center in diamond

Philipp Neumann

This work investigates the applicability of the nitrogen-vacancy (NV) defect center in diamond for quantum computation and metrology purposes. The NV center is a molecule like defect in the diamond lattice which is optically active and possesses an electron spin in its ground state. The spin can be used as a quantum bit and as a field sensor. The NV center has three major properties enabling individual control of single defects. Its optical properties depend on the spin state, the spin can be polarized optically and the spin state has an exceptionally long lifetime. Single NV centers can be controlled by optical and microwave radiation. Generally, the research on individually controllable quantum systems is not only motivated by quantum computation and communication. With the ongoing miniaturization nowadays electronic and electro-optic devices will soon reach the limit of single quantum building blocks. While in these applications the full complexity of single quantum systems might not be needed, small sensors based on single atoms or molecules might very well take advantage of the susceptibility of quantum coherences to environmental conditions. Major challenges for all approaches towards single quantum system control are the individual addressing, the measurement of the quantum state and the protection of quantum coherence from environmental noise. Today, there is a variety of systems (including the NV center) that allow control on the single quantum level. These are for example single photons, single ions and atoms in traps, single spins in semiconductors or single molecules in solid state systems. Rather mesoscopic examples are superconducting devices, nanomechanical oscillators or surface plasmon polaritons. Regarding the NV center it has been shown that the magnetic moment of its electron spin allows individual sensing and coupling to other surrounding electron and nuclear spins. Especially single nuclear spins were shown to be exceptional quantum memories. In this work small quantum registers of up to 5 spins have been used to test major requirements for a feasible quantum processor. Therefore, mainly artificially created high purity diamond samples with controlled spin and impurity concentration were used. The NV centers were either grown in or created via ion implantation techniques in a controlled fashion. As a first requirement for quantum computation entanglement among up to three spins has been generated and was verified by quantum state tomography. This proves the access of the full Hilbert space. Especially, entanglement among nuclear spins was very long-living. In further experiments this processor was used for first quantum algorithms like super-dense coding and the Deutsch algorithm. In addition, this work demonstrates new methods to initialize nuclear spin qubits into a desired quantum state. This is particularly important as improper initialization inhibits quantum computation. One of these methods is related to dynamic nuclear spin polarization and the other to measurement based state preparation. Nuclear spins in the diamond lattice originate mainly from the C-13 isotope. By artificially altering its content the influence on the NV center spin was investigated. The coherence times of the NV center were increasing inversely with the nuclear spin density. Even increasing nuclear spin density to offer more nuclear spin qubits to an operational quantum register was possible. As an alternative route of scaling up the quantum register pairs of closely spaced NV centers were investigated. For the first time two qubit gates among two NV centers mediated by magnetic dipolar coupling have been realized. Furthermore the sensing ability was demonstrated by measuring the relative distance of the two centers (10 nm) with sub-nm precision. Eventually, this work contains new insight into the electronically excited state of the NV center which allowed a more advanced control of the electron and nuclear spins. A comparably high magnetic field was used to decouple electron and nuclear spins. Finally, this allowed quantum nondemolition measurements on single nuclear spins which manifests in the observation of quantum jumps. The new insight was used to drastically improve the performance of quantum state readout. Summarizing, it was shown that single NV centers and proximal nuclear spins form versatile small quantum registers which can be interconnected with neighboring such NV quantum registers. Although the number of qubits used in this work is still small the experimental results propose a way of how to proceed when building a quantum computer. Regarding quantum metrology, however, the use of such a small register which can sense fields and store and process the results would already outperform a single NV electron spin by orders of magnitude.

•Jan 1, 2012•8 citations

Complete 3-Qubit Grover search on a programmable quantum computer

Caroline Figgatt, Dmitri A Maslov, K. A. Landsman +3 more

The Grover quantum search algorithm is a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.

arXiv:1703.10535•Nature Communications•Nov 28, 2017•235 citations

Modelling of Grover’s quantum search algorithms: implementations of Simple quantum simulators on classical computers

Sergey Victorovich Ulyanov, Andrey G. Reshetnikov, Olga Tyatyushkina

Models of Grover’s search algorithm is reviewed to build the foundation for the other algorithms. Thereafter, some preliminary modifications of the original algorithms by others are stated, that increases the applicability of the search procedure. A general quantum computation on an isolated system can be represented by a unitary matrix. In order to execute such a computation on a quantum computer, it is common to decompose the unitary into a quantum circuit, i.e., a sequence of quantum gates that can be physically implemented on a given architecture. There are different universal gate sets for quantum computation. Here we choose the universal gate set consisting of CNOT and single-qubit gates. We measure the cost of a circuit by the number of CNOT gates as they are usually more difficult to implement than single qubit gates and since the number of single-qubit gates is bounded by about twice the number of CNOT’s.

System Analysis in Science and Education•Sep 30, 2020•4 citations
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.
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.
Quantum computers have the potential to speed up certain problems that are hard for classical computers. Hybrid systems, such as the nitrogen-vacancy (NV) center in diamond, are among the most promising systems to implement quantum computing, provided the control of the different types of qubits can be efficiently implemented. In the case of the NV center, the anisotropic hyperfine interaction allows one to control the nuclear spins indirectly, through gate operations targeting the electron spin, combined with free precession. Here, we demonstrate that this approach allows one to implement a full quantum algorithm, using the example of Grover's quantum search in a single NV center, whose electron is coupled to a carbon nuclear spin.
Spin qubits in silicon are strong contenders for the realization of a practical quantum computer, having demonstrated single- and two-qubit gates with fidelities above the fault-tolerant threshold, and entanglement of three qubits. However, maintaining high-fidelity operations while increasing the qubit count remains challenging and therefore only two-qubit algorithms have been executed. Here we utilize a four-qubit silicon processor with all control fidelities above the fault-tolerant threshold and demonstrate a three-qubit Grover's search algorithm with a ~95% probability of finding the marked state. Our processor is made of three phosphorus atoms precision-patterned into isotopically pure silicon, which localise one electron. The long coherence times of the qubits enable single-qubit fidelities above 99.9% for all qubits. Moreover, the efficient single-pulse multi-qubit operations enabled by the electron-nuclear hyperfine interaction facilitate controlled-Z gates between all pairs of nuclear spins with fidelities above 99% when using the electron as an ancilla. These control fidelities, combined with high-fidelity non-demolition readout of all nuclear spins, allow the creation of a three-qubit Greenberger-Horne-Zeilinger state with 96.2% fidelity. Looking ahead, coupling neighbouring nuclear spin registers, as the one shown here, via electron-electron exchange may enable larger, fault-tolerant quantum processors.
This work investigates the applicability of the nitrogen-vacancy (NV) defect center in diamond for quantum computation and metrology purposes. The NV center is a molecule like defect in the diamond lattice which is optically active and possesses an electron spin in its ground state. The spin can be used as a quantum bit and as a field sensor. The NV center has three major properties enabling individual control of single defects. Its optical properties depend on the spin state, the spin can be polarized optically and the spin state has an exceptionally long lifetime. Single NV centers can be controlled by optical and microwave radiation. Generally, the research on individually controllable quantum systems is not only motivated by quantum computation and communication. With the ongoing miniaturization nowadays electronic and electro-optic devices will soon reach the limit of single quantum building blocks. While in these applications the full complexity of single quantum systems might not be needed, small sensors based on single atoms or molecules might very well take advantage of the susceptibility of quantum coherences to environmental conditions. Major challenges for all approaches towards single quantum system control are the individual addressing, the measurement of the quantum state and the protection of quantum coherence from environmental noise. Today, there is a variety of systems (including the NV center) that allow control on the single quantum level. These are for example single photons, single ions and atoms in traps, single spins in semiconductors or single molecules in solid state systems. Rather mesoscopic examples are superconducting devices, nanomechanical oscillators or surface plasmon polaritons. Regarding the NV center it has been shown that the magnetic moment of its electron spin allows individual sensing and coupling to other surrounding electron and nuclear spins. Especially single nuclear spins were shown to be exceptional quantum memories. In this work small quantum registers of up to 5 spins have been used to test major requirements for a feasible quantum processor. Therefore, mainly artificially created high purity diamond samples with controlled spin and impurity concentration were used. The NV centers were either grown in or created via ion implantation techniques in a controlled fashion. As a first requirement for quantum computation entanglement among up to three spins has been generated and was verified by quantum state tomography. This proves the access of the full Hilbert space. Especially, entanglement among nuclear spins was very long-living. In further experiments this processor was used for first quantum algorithms like super-dense coding and the Deutsch algorithm. In addition, this work demonstrates new methods to initialize nuclear spin qubits into a desired quantum state. This is particularly important as improper initialization inhibits quantum computation. One of these methods is related to dynamic nuclear spin polarization and the other to measurement based state preparation. Nuclear spins in the diamond lattice originate mainly from the C-13 isotope. By artificially altering its content the influence on the NV center spin was investigated. The coherence times of the NV center were increasing inversely with the nuclear spin density. Even increasing nuclear spin density to offer more nuclear spin qubits to an operational quantum register was possible. As an alternative route of scaling up the quantum register pairs of closely spaced NV centers were investigated. For the first time two qubit gates among two NV centers mediated by magnetic dipolar coupling have been realized. Furthermore the sensing ability was demonstrated by measuring the relative distance of the two centers (10 nm) with sub-nm precision. Eventually, this work contains new insight into the electronically excited state of the NV center which allowed a more advanced control of the electron and nuclear spins. A comparably high magnetic field was used to decouple electron and nuclear spins. Finally, this allowed quantum nondemolition measurements on single nuclear spins which manifests in the observation of quantum jumps. The new insight was used to drastically improve the performance of quantum state readout. Summarizing, it was shown that single NV centers and proximal nuclear spins form versatile small quantum registers which can be interconnected with neighboring such NV quantum registers. Although the number of qubits used in this work is still small the experimental results propose a way of how to proceed when building a quantum computer. Regarding quantum metrology, however, the use of such a small register which can sense fields and store and process the results would already outperform a single NV electron spin by orders of magnitude.
The Grover quantum search algorithm is a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.
Models of Grover’s search algorithm is reviewed to build the foundation for the other algorithms. Thereafter, some preliminary modifications of the original algorithms by others are stated, that increases the applicability of the search procedure. A general quantum computation on an isolated system can be represented by a unitary matrix. In order to execute such a computation on a quantum computer, it is common to decompose the unitary into a quantum circuit, i.e., a sequence of quantum gates that can be physically implemented on a given architecture. There are different universal gate sets for quantum computation. Here we choose the universal gate set consisting of CNOT and single-qubit gates. We measure the cost of a circuit by the number of CNOT gates as they are usually more difficult to implement than single qubit gates and since the number of single-qubit gates is bounded by about twice the number of CNOT’s.