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

Series on the foundations of natural science and technology

The EPR Paper

Published Nov 1, 2025• 0 citations
Publisher
DOI
10.1142/9789819820139_0006

Related papers

EPR (1935) and EPR-B

Alan A. Grometstein

Springer eBooks•Jan 1, 1999•1 citation

EPR and its Aftermath

Springer eBooks•Nov 13, 2007•0 citations

EPR Count for Runtime Prediction in Distributed Quantum Computing

Fatih E. Bilgen, Ozgur B. Akan

EPR-pair consumption is commonly used as a communication-cost objective in distributed quantum computing, but minimizing EPR cost does not necessarily minimize distributed execution time. Despite its widespread use, the reliability of EPR count as a runtime surrogate has received limited direct characterization across different workloads and communication conditions. This work addresses this gap by systematically evaluating the relationship between EPR cost and runtime over all balanced two-QPU mappings of QFT, QAOA, and CDKM circuits. The results show that mappings with identical EPR cost can have substantially different execution times, lower-EPR mappings can be slower, and minimum-EPR mappings can be runtime-suboptimal. The reliability of EPR count is strongly workload dependent and also changes with the communication operating regime: increasing EPR-generation latency amplifies runtime differences hidden by equal EPR cost, while increased communication concurrency can reduce the ability of EPR count to preserve runtime ordering. These results show that EPR count and execution time are related but distinct optimization objectives, and identify regimes in which explicit communication-aware runtime modeling is necessary.

cs.DCCross-listedarXiv:2609.39851•Oct 1, 2026•0 citations

EPR and Bell Locality

Travis Norsen

A new formulation of the EPR argument is presented, one which uses John Bell’s mathematically precise local causality condition in place of the looser locality assumption which was used in the original EPR paper and on which Niels Bohr seems to have based his objection to the EPR argument. The new formulation of EPR helps clarify the relation between this argument and Bell’s Theorem. The relation between these two arguments — in particular, the role of EPR as part one of Bell’s two‐part argument for nonlocality — is also discussed in detail.

arXiv:quant-ph/0408105•AIP conference proceedings•Jan 1, 2006•13 citations

The EPR Paradox

The MIT Press eBooks•May 28, 2019•0 citations

One-way EPR steering and genuine multipartite EPR steering

Qiongyi He, M. D. Reid

We propose criteria and experimental strategies to realise the Einstein-Podolsky-Rosen (EPR) steering nonlocality. One-way steering can be obtained where there is asymmetry of thermal noise on each system. We also present EPR steering inequalities that act as signatures and suggest how to optimise EPR correlations in specific schemes so that the genuine multipartite EPR steering nonlocality (EPR paradox) can also possibly be realised. The results presented here also apply to the spatially separated macroscopic atomic ensembles.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 29, 2012•0 citations
EPR-pair consumption is commonly used as a communication-cost objective in distributed quantum computing, but minimizing EPR cost does not necessarily minimize distributed execution time. Despite its widespread use, the reliability of EPR count as a runtime surrogate has received limited direct characterization across different workloads and communication conditions. This work addresses this gap by systematically evaluating the relationship between EPR cost and runtime over all balanced two-QPU mappings of QFT, QAOA, and CDKM circuits. The results show that mappings with identical EPR cost can have substantially different execution times, lower-EPR mappings can be slower, and minimum-EPR mappings can be runtime-suboptimal. The reliability of EPR count is strongly workload dependent and also changes with the communication operating regime: increasing EPR-generation latency amplifies runtime differences hidden by equal EPR cost, while increased communication concurrency can reduce the ability of EPR count to preserve runtime ordering. These results show that EPR count and execution time are related but distinct optimization objectives, and identify regimes in which explicit communication-aware runtime modeling is necessary.
A new formulation of the EPR argument is presented, one which uses John Bell’s mathematically precise local causality condition in place of the looser locality assumption which was used in the original EPR paper and on which Niels Bohr seems to have based his objection to the EPR argument. The new formulation of EPR helps clarify the relation between this argument and Bell’s Theorem. The relation between these two arguments — in particular, the role of EPR as part one of Bell’s two‐part argument for nonlocality — is also discussed in detail.
We propose criteria and experimental strategies to realise the Einstein-Podolsky-Rosen (EPR) steering nonlocality. One-way steering can be obtained where there is asymmetry of thermal noise on each system. We also present EPR steering inequalities that act as signatures and suggest how to optimise EPR correlations in specific schemes so that the genuine multipartite EPR steering nonlocality (EPR paradox) can also possibly be realised. The results presented here also apply to the spatially separated macroscopic atomic ensembles.