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

Verhandlungen der Deutschen Physikalischen Gesellschaft

From quantum computation to quantum simulation: becoming more realistic

Dirk-Michael Schlingemann, Michael Keyl, Zoltán Zimborás

Published Jan 1, 2010• 0 citations
OpenAlex

Related papers

Simulation of quantum systems on a realistic quantum computer

LEVI, Benjamin, Bertrand Georgeot

•Jan 1, 2004•0 citations

Quantum Computers and Their Simulation.

Thomas Lippert

Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.

ARCS Workshops•Jan 1, 2004•0 citations

Quantum Simulation: Beyond Classical Computing

Dharmesh Mistry, Louis R. Carlozo

Springer eBooks•Jan 1, 2026•0 citations

The End of the Impossible: How Quantum Computing Rewrites the Limits of the Possible

Chris Meniw

I argue here major civilizational thesis: quantum computing - when reaching full maturity 2035-2045 - will close entire eras of problems humanity considered impossible. Climate change solvable by complete atmospheric simulation, complex diseases curable by total molecular simulation, interstellar travel viable through multi-body trajectory optimization, understanding of universe origin via exact cosmological simulations. The paper articulates seven domains where impossible becomes possible, realistic timeline, philosophical and political implications, specific risks of a world without computational limits, and governance proposal via Meniw Doctrine.

•May 31, 2026•0 citations

Simulation of Quantum Computation

Tzvetan S. Metodi, Arvin I. Faruque, Frederic T. Chong

Synthesis lectures on computer architecture•Jan 1, 2011•1 citation

Gaining confidence on the correct realization of arbitrary quantum computations

José A. Carrasco, Marc Langer, Antoine Neven +1 more

We present verification protocols to gain confidence in the correct performance of a device implementing an arbitrary quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized compiling, and statistics to derive verification circuits that (i) strongly resemble the original circuit and (ii) can be classically efficiently simulated not only in the ideal, i.e., error free scenario, but also in the realistic situation where errors are present. In fact, in one of the protocols we apply exactly the same circuit as in the original computation, however, to a slightly modified input state. Published by the American Physical Society 2024

Physical Review Research•Sep 30, 2024•2 citations
Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.
I argue here major civilizational thesis: quantum computing - when reaching full maturity 2035-2045 - will close entire eras of problems humanity considered impossible. Climate change solvable by complete atmospheric simulation, complex diseases curable by total molecular simulation, interstellar travel viable through multi-body trajectory optimization, understanding of universe origin via exact cosmological simulations. The paper articulates seven domains where impossible becomes possible, realistic timeline, philosophical and political implications, specific risks of a world without computational limits, and governance proposal via Meniw Doctrine.
We present verification protocols to gain confidence in the correct performance of a device implementing an arbitrary quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized compiling, and statistics to derive verification circuits that (i) strongly resemble the original circuit and (ii) can be classically efficiently simulated not only in the ideal, i.e., error free scenario, but also in the realistic situation where errors are present. In fact, in one of the protocols we apply exactly the same circuit as in the original computation, however, to a slightly modified input state. Published by the American Physical Society 2024