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

Springer eBooks

Interactive Quantum Mechanics: Quantum Experiments on the Computer

S. Brandt, Tilo Stroh, Hans Dieter Dahmen

Published Jan 1, 2011• 3 citations
Publisher
DOI
10.1007/978-1-4419-7424-2

Related papers

Is Quantum Mechanics Falsifiable? A Computational Perspective on the Foundations of Quantum Mechanics

Dorit Aharonov, Umesh V. Vazirani

Quantum computation teaches us that quantum mechanics exhibits exponential complexity. We argue that the standard scientific paradigm of "predict and verify" cannot be applied to testing quantum mechanics in this limit of high complexity. We describe how QM can be tested in this regime by extending the usual scientific paradigm to include {\it interactive experiments}.

arXiv:1206.3686•The MIT Press eBooks•Jun 7, 2013•56 citations

Interactive Quantum Mechanics

S. Brandt, Hans Dieter Dahmen, Tilo Stroh

Springer eBooks•Jan 1, 2003•6 citations

Quantum Robots and Quantum Computers

Paul A. Benioff

Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.

arXiv:quant-ph/9706012•Jun 4, 1997•11 citations

Web Site: Interactive Quantum Mechanics

Robert Berger

Angewandte Chemie International Edition•Jun 3, 2002•0 citations

COMPUTER SIMULATION OF QUANTUM PHYSICS EXPERIMENTS

GANIYA ORMANOVA

National Center for Higher Education Development•Jan 1, 2022•0 citations

On the Completeness of Quantum Mechanics

Marian Kupczyński

Quantum cryptography, quantum computer project, space-time quantization program and recent computer experiments reported by Accardi and his collaborators show the importance and actuality of the discussion of the completeness of quantum mechanics (QM) started by Einstein more than 70 years ago. Many years ago we pointed out that the violation of Bell's inequalities is neither a proof of completeness of QM nor an indication of the violation of Einsteinian causality. We also indicated how and in what sense a completeness of QM might be tested with the help of statistical nonparametric purity tests. In this paper we review and refine our arguments. We also point out that the statistical predictions of QM for two-particle correlation experiments do not give any deterministic prediction for a single pair. After beam is separated we obtain two beams moving in opposite directions. If the coincidence is reported it is only after the beams had interacted with corresponding measuring devices and two particles had been detected. This fact has implications for quantum cryptography. Namely a series of the measurements performed on the beam by Bob and converted into a string of bits (secret key) will in general differ, due to lack of strict anti-correlations, from a secret key found by Alice using the same procedure.

arXiv:quant-ph/0208061•Aug 9, 2002•18 citations
Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.
Quantum cryptography, quantum computer project, space-time quantization program and recent computer experiments reported by Accardi and his collaborators show the importance and actuality of the discussion of the completeness of quantum mechanics (QM) started by Einstein more than 70 years ago. Many years ago we pointed out that the violation of Bell's inequalities is neither a proof of completeness of QM nor an indication of the violation of Einsteinian causality. We also indicated how and in what sense a completeness of QM might be tested with the help of statistical nonparametric purity tests. In this paper we review and refine our arguments. We also point out that the statistical predictions of QM for two-particle correlation experiments do not give any deterministic prediction for a single pair. After beam is separated we obtain two beams moving in opposite directions. If the coincidence is reported it is only after the beams had interacted with corresponding measuring devices and two particles had been detected. This fact has implications for quantum cryptography. Namely a series of the measurements performed on the beam by Bob and converted into a string of bits (secret key) will in general differ, due to lack of strict anti-correlations, from a secret key found by Alice using the same procedure.