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

Microelectronic Engineering

Quantum computing and the theorem of Bell

K. Hess, Walter Philipp

Published Aug 1, 2002• 1 citation
Publisher
DOI
10.1016/s0167-9317(02)00645-7

Related papers

Quantum Computation and Its Perspective

Craig S. Lent

FEDジャ-ナル•Mar 1, 1997•2 citations

The New Quantum Age: From Bell’s Theorem to Quantum Computation and Teleportation

Daniel Gottesman

The New Quantum Age: From Bell’s Theorem to Quantum Computation and Teleportation, Andrew Whitaker, Oxford U. Press, New York, 2012. $45.00 (394 pp.). ISBN 978-0-19-958913-5 Buy at Amazon

Physics Today•Feb 28, 2013•0 citations

Certifying the Building Blocks of Quantum Computers from Bell’s Theorem

Pavel Sekatski, Jean-Daniel Bancal, Sebastian Wagner +1 more

Bell's theorem has been proposed to certify, in a device-independent and robust way, blocks either producing or measuring quantum states. In this Letter, we provide a method based on Bell's theorem to certify coherent operations for the storage, processing, and transfer of quantum information. This completes the set of tools needed to certify all building blocks of a quantum computer. Our method distinguishes itself by its robustness to experimental imperfections, and so could be used to certify that today's quantum devices are qualified for usage in future quantum computers.

arXiv:1802.02170•Physical Review Letters•Nov 2, 2018•79 citations

On the Study of Quantum Computing

Myo Myo Aung

•Oct 30, 2019•0 citations

On Quantum Computing

Davor Pavuna

International Conference on Smart Systems and Technologies (SST)•Oct 1, 2018•0 citations

Quantum Computation and Arrows of Time

Nathan Argaman

Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell's Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In both cases, the surprise may be due to taking for granted a strict arrow-of-time assumption whose applicability may be limited to the classical domain. This possibility has been noted repeatedly in the context of Bell's Theorem. The argument concerning quantum computation is described here. Further development of models which violate this strong arrow-of-time assumption, replacing it by a weaker arrow which is yet to be identified, is called for.

arXiv:2001.10517•Entropy•Dec 30, 2020•3 citations
Bell's theorem has been proposed to certify, in a device-independent and robust way, blocks either producing or measuring quantum states. In this Letter, we provide a method based on Bell's theorem to certify coherent operations for the storage, processing, and transfer of quantum information. This completes the set of tools needed to certify all building blocks of a quantum computer. Our method distinguishes itself by its robustness to experimental imperfections, and so could be used to certify that today's quantum devices are qualified for usage in future quantum computers.
Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell's Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In both cases, the surprise may be due to taking for granted a strict arrow-of-time assumption whose applicability may be limited to the classical domain. This possibility has been noted repeatedly in the context of Bell's Theorem. The argument concerning quantum computation is described here. Further development of models which violate this strong arrow-of-time assumption, replacing it by a weaker arrow which is yet to be identified, is called for.