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

Bulletin of the American Physical Society

Entanglement and quantum computational speed-up

Guifré Vidal

Published Mar 23, 2005• 0 citations
OpenAlex

Related papers

Quantum Entanglement-Accelerated Distributed Computing

Jincheng Zhang

This paper proposes a novel approach to distributed computing leveraging the phenomenon of quantum entanglement. The core claim is that by directly connecting distributed computing nodes through entangled quantum states, we can drastically reduce data transmission latency and significantly accelerate computational processes. The proposed mechanism involves constructing a carefully designed quantum entanglement network, enabling instantaneous information exchange between nodes – effectively bypassing the limitations imposed by the speed of light. This approach shifts the paradigm from relying solely on quantum computers for classical computation to utilizing the fundamental properties of quantum mechanics as an intrinsic acceleration mechanism. We explore the theoretical underpinnings of this method, focusing on the potential for parallel computation and collaborative processing facilitated by entanglement. This research aims to establish a foundational understanding of entanglement-accelerated distributed computing, paving the way for future exploration and development in this nascent field. The central equation demonstrating the potential speed-up is: Δt = (Δs/c) + t_c, where Δt is the total computation time, Δs is the size of the data set, c is the speed of light, and t_c is the classical computation time. We demonstrate that, with perfect entanglement, Δt can be reduced substantially, approaching a speed increase of approximately 1/c, which is significantly faster than the conventional speed of data transfer.

•Sep 2, 2026•0 citations

Review on the study of entanglement in quantum computation speedup

Shengchao Ding, Zhi Hao Jin

Chinese Science Bulletin•Aug 1, 2007•56 citations

Quantum entanglement and quantum computational algorithms

Arvind

arXiv:quant-ph/0012116•Pramana•Feb 1, 2001•20 citations

Role of entanglement in quantum computation

Arun Kumar Pati, Samuel L. Braunstein

Abstract | Quantum computers are believed to surpass their classical counterparts in speed-up and efficiency. However, the origin of this speed-up in quantum algorithms is not yet fully understood. There are indications that entanglement plays an important role in quantum computation. Quantum algorithms that do not involve entanglement appear to require an exponential amount of resources and may be efficiently simulated on a classical computer. Here we discuss the role of entanglement in quantum computation. As an illustration, we consider Grover’s algorithm and how entanglement arises in this case. We will show that even though entanglement is present throughout the computation, the change of entanglement per iteration is exponentially small for large databases. 1

Journal of the Indian Institute of Science•Jan 1, 2009•6 citations

Quantum entanglement and quantum computing

F.J. Duarte

Institute of Physics eBooks•Oct 1, 2019•4 citations

On the role of entanglement in quantum-computational speed-up

Richard Jozsa, Noah Linden

For any quantum algorithm operating on pure states, we prove that the presence of multi‐partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speed‐up over classical computation. Furthermore, we prove that the algorithm can be efficiently simulated classically to within a prescribed tolerance η even if a suitably small amount of global entanglement is present. We explicitly identify the occurrence of increasing multi‐partite entanglement in Shor's algorithm. Our results do not apply to quantum algorithms operating on mixed states in general and we discuss the suggestion that an exponential computational speed‐up might be possible with mixed states in the total absence of entanglement. Finally, despite the essential role of entanglement for pure‐state algorithms, we argue that it is nevertheless misleading to view entanglement as a key resource for quantum‐computational power.

arXiv:quant-ph/0201143•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Aug 8, 2003•919 citations
This paper proposes a novel approach to distributed computing leveraging the phenomenon of quantum entanglement. The core claim is that by directly connecting distributed computing nodes through entangled quantum states, we can drastically reduce data transmission latency and significantly accelerate computational processes. The proposed mechanism involves constructing a carefully designed quantum entanglement network, enabling instantaneous information exchange between nodes – effectively bypassing the limitations imposed by the speed of light. This approach shifts the paradigm from relying solely on quantum computers for classical computation to utilizing the fundamental properties of quantum mechanics as an intrinsic acceleration mechanism. We explore the theoretical underpinnings of this method, focusing on the potential for parallel computation and collaborative processing facilitated by entanglement. This research aims to establish a foundational understanding of entanglement-accelerated distributed computing, paving the way for future exploration and development in this nascent field. The central equation demonstrating the potential speed-up is: Δt = (Δs/c) + t_c, where Δt is the total computation time, Δs is the size of the data set, c is the speed of light, and t_c is the classical computation time. We demonstrate that, with perfect entanglement, Δt can be reduced substantially, approaching a speed increase of approximately 1/c, which is significantly faster than the conventional speed of data transfer.
Abstract | Quantum computers are believed to surpass their classical counterparts in speed-up and efficiency. However, the origin of this speed-up in quantum algorithms is not yet fully understood. There are indications that entanglement plays an important role in quantum computation. Quantum algorithms that do not involve entanglement appear to require an exponential amount of resources and may be efficiently simulated on a classical computer. Here we discuss the role of entanglement in quantum computation. As an illustration, we consider Grover’s algorithm and how entanglement arises in this case. We will show that even though entanglement is present throughout the computation, the change of entanglement per iteration is exponentially small for large databases. 1
For any quantum algorithm operating on pure states, we prove that the presence of multi‐partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speed‐up over classical computation. Furthermore, we prove that the algorithm can be efficiently simulated classically to within a prescribed tolerance η even if a suitably small amount of global entanglement is present. We explicitly identify the occurrence of increasing multi‐partite entanglement in Shor's algorithm. Our results do not apply to quantum algorithms operating on mixed states in general and we discuss the suggestion that an exponential computational speed‐up might be possible with mixed states in the total absence of entanglement. Finally, despite the essential role of entanglement for pure‐state algorithms, we argue that it is nevertheless misleading to view entanglement as a key resource for quantum‐computational power.