Skip to content
DraconiticResearch
Search Sources API
181,713 studies31 sourcesUpdated 23 min ago
PreprintarXiv licencearXiv

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
Open at sourcePDFDOICite

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 ± 3.4) % and (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.

Related

  1. Ancilla-mediated fixed-point quantum search using Grover iterations
    Yash Prabhat, Snigdha Thakur, Ankur Raina
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  2. Implementation of Grover’s Search Algorithm for Tectonic Activity Detection in an Unsorted Seismic Database
    Shofina Mumtaz Mahardhika, Listiyanto Listiyanto, Agus Yulianto +1
    Physics CommunicationPeer-reviewedCC BYFull textGeneral physicsDOAJ
  3. Grover Search for a Threshold-Fraction Variant of the Travelling Salesman Problem: A Circuit-Level Construction
    Aayra Dhindsa Sawkmie
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Reservoir- and Measurement-free Microwave Initialization of Semiconductor Spin Qubits
    Leon C. Camenzind, Ik Kyeong Jin, Akito Noiri +4
    arXivPreprintCC BY 4.0Full textCondensed matterQuantum physics & quantum informationarXiv
  5. Resource-Aware Grover Search for Minimum Vertex Cover
    Beilei Jiang, Harry Fu, Pavan Krishna Yarlagadda +3
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv

Cite

BibTeXRIS
BibTeX
@misc{gemsheim2026grover,
  title = {{Grover Search with Semiconductor Spin Qubits at Ambient Conditions}},
  author = {Sebastian Gemsheim and Fabian Klüpfel and Max Kneiß and Nicole Raatz and Tobias Herzig and Matthias Mendt and Evgeny Kreissig and Ulrike Rückert and Albrecht Hänel and Jan Meijer and Marius Grundmann},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.13022},
  eprint = {2609.13022},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.13022},
}
RIS
TY  - UNPB
TI  - Grover Search with Semiconductor Spin Qubits at Ambient Conditions
AU  - Sebastian Gemsheim
AU  - Fabian Klüpfel
AU  - Max Kneiß
AU  - Nicole Raatz
AU  - Tobias Herzig
AU  - Matthias Mendt
AU  - Evgeny Kreissig
AU  - Ulrike Rückert
AU  - Albrecht Hänel
AU  - Jan Meijer
AU  - Marius Grundmann
PY  - 2026
DA  - 2026/09/18
PB  - arXiv
DO  - 10.48550/arxiv.2609.13022
UR  - https://arxiv.org/abs/2609.13022
AB  - 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 ± 3.4) % and (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.
ER  -