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

Physical Realizations of Quantum Computing Are the DiVincenzo Criteria Fulfilled in 2004

Mikio Nakahara, Shigeru Kanemitsu, Martti M. Salomaa, Shin Takagi

Published Mar 1, 2006• 7 citations
OpenAlex

Related papers

Physical Realizations of Quantum Computing: Are the Divincenzo Criteria Fulfilled in 2004?, Osaka, Japan, 7-8 May 2004

Mikio Nakahara, Shigeru Kanemitsu, Martti M. Salomaa +1 more

WORLD SCIENTIFIC eBooks•Apr 1, 2006•2 citations

Quantum Circuits and DiVincenzo Criteria

Venkateswaran Kasirajan

Springer eBooks•Jan 1, 2021•1 citation

DiVincenzo Criteria and Beyond

Martti M. Salomaa, Mikio Nakahara

Five DiVincenzo criteria and two additional networkability criteria are introduced. Then current status and prospects of the research on physical realization of quantum computing are reviewed following the ARDA QIST roadmap. Finally some proposals for "beyond the DiVincenzo criteria" are outlined.

•Mar 1, 2006•3 citations

Physical Realization of Quantum Computations

WORLD SCIENTIFIC eBooks•Jul 1, 1998•0 citations

Ion Trap Quantum Computing

Christos Tsampardoukas

Richard Feynman first proposed the idea of quantum computers thirty years ago. Since then, efforts have been undertaken to realize large-scale, fault-tolerant quantum computers that can factor large numbers much more quickly than classical computers, which would have significant implications for computer security. While there is no universally agreed upon technology for experimentally realizing quantum computers, many researchers look to ion traps as a promising technology. This thesis focuses on ion traps, how they fulfill the Divincenzo criteria, what obstacles must be overcome, and recent achievements in this field. We examine the physical principles of a linear Paul trap, including the confining potential and its quantum dynamics. In addition, we built a mechanical analogue of an ion trap for pedagogical purposes, and we provide an analysis of its trapping potential and compare it to a real ion trap, the Paul trap. Furthermore, we provide guidance for building a course module on ion trap based quantum computing; our guidance is based on course materials from several institutions.

•Dec 1, 2011•1 citation

Near-Term Stepping Stones on the Path to Useful Quantum Computing

Abigail McClain Gomez

In 2000, David P. DiVincenzo proposed seven necessary criteria to construct a physical quantum computer. His requirements included device scalability, having well-defined qubits with long coherence times, and the ability to implement a universal gate set. Since then, research has propelled several experimental platforms to the forefront as contenders for quantum computing. The near-term implementations of these various architectures often face technical challenges -- such as limited scalability, short coherence times, or sub-universal computation -- leading to only a partial fulfillment of DiVincenzo's criteria. Despite device shortcomings, progress marches forward with increasingly useful demonstrations of quantum computation and simulation. Towards this end, the research compiled in this thesis presents novel quantum computing methods and applications that can be leveraged in the current era of constrained hardware capabilities. This thesis examines a diverse array of near-term topics, including the use of machine learning to aid in sample-efficient quantum state reconstruction via Born machines, methods to link distributed quantum simulators with incomplete information transfer for approximate fragmented simulation, universal computation with globally controlled analog simulators, and fast scrambling achieved with measurement-only quantum circuits.

•Jan 1, 2025•0 citations
Richard Feynman first proposed the idea of quantum computers thirty years ago. Since then, efforts have been undertaken to realize large-scale, fault-tolerant quantum computers that can factor large numbers much more quickly than classical computers, which would have significant implications for computer security. While there is no universally agreed upon technology for experimentally realizing quantum computers, many researchers look to ion traps as a promising technology. This thesis focuses on ion traps, how they fulfill the Divincenzo criteria, what obstacles must be overcome, and recent achievements in this field. We examine the physical principles of a linear Paul trap, including the confining potential and its quantum dynamics. In addition, we built a mechanical analogue of an ion trap for pedagogical purposes, and we provide an analysis of its trapping potential and compare it to a real ion trap, the Paul trap. Furthermore, we provide guidance for building a course module on ion trap based quantum computing; our guidance is based on course materials from several institutions.
In 2000, David P. DiVincenzo proposed seven necessary criteria to construct a physical quantum computer. His requirements included device scalability, having well-defined qubits with long coherence times, and the ability to implement a universal gate set. Since then, research has propelled several experimental platforms to the forefront as contenders for quantum computing. The near-term implementations of these various architectures often face technical challenges -- such as limited scalability, short coherence times, or sub-universal computation -- leading to only a partial fulfillment of DiVincenzo's criteria. Despite device shortcomings, progress marches forward with increasingly useful demonstrations of quantum computation and simulation. Towards this end, the research compiled in this thesis presents novel quantum computing methods and applications that can be leveraged in the current era of constrained hardware capabilities. This thesis examines a diverse array of near-term topics, including the use of machine learning to aid in sample-efficient quantum state reconstruction via Born machines, methods to link distributed quantum simulators with incomplete information transfer for approximate fragmented simulation, universal computation with globally controlled analog simulators, and fast scrambling achieved with measurement-only quantum circuits.