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 theses

Entanglement-Based Computation

Daniele Cuomo

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-3-031-73808-1_3

Related papers

Computing Entanglement Polytopes

Konstantin Wernli

In arXiv:1208.0365 entanglement polytopes where introduced as a coarsening of the SLOCC classification of multipartite entanglement. The advantages of classifying entanglement by entanglement polytopes are a finite hierarchy for all dimensions and a number of parameters linear in system size. In arXiv:1208.0365 a method to compute entanglement polytopes using geometric invariant theory is presented. In this thesis we consider alternative methods to compute them. Some geometrical and algebraical tools are presented that can be used to compute inequalities giving an outer approximation of the entanglement polytopes. Furthermore we present a numerical method which, in theory, can compute the entanglement polytope of any given SLOCC class given a representative. Using it we classify the entanglement polytopes of $2 \times 3 \times N$ systems.

arXiv:1808.03382•Aug 9, 2018•0 citations

Entanglement-based Quantum Computing

Marcel Patulacci, Mona Lisa

•Apr 16, 2020•0 citations

Chaos, Entanglement and Computation

Giuliano Benenti

Springer eBooks•Jan 1, 2024•0 citations

Quantum Entanglement-Based Distributed Computation (QEB)

Jincheng Zhang

This paper proposes a novel distributed computation architecture, Quantum Entanglement-Based Distributed Computation (QEB), leveraging quantum entanglement as the foundational mechanism for information transfer and computation. Traditional distributed computing systems are constrained by the limitations of classical communication, resulting in bottlenecks and reduced scalability. QEB overcomes these challenges by directly utilizing the inherent parallelism and resilience of quantum entanglement. The architecture decomposes computational tasks into a series of entangled sub-tasks, orchestrated across a network of quantum nodes. Synchronization and execution of these sub-tasks occur through controlled manipulation of the entangled states, eliminating the need for classical data transmission. Furthermore, the architecture incorporates fault tolerance through the dynamic reconstruction of entangled states, providing robustness against node failures. This approach promises significant advancements in computational performance and reliability, representing a paradigm shift in the field of distributed computing. The core claim of QEB is to build a highly parallel and fault-tolerant architecture by exploiting quantum entanglement as the primary communication channel. ---

•Aug 31, 2026•0 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 disentanglement and computation

Asher Peres

arXiv:quant-ph/9707047•Superlattices and Microstructures•Mar 1, 1998•10 citations
In arXiv:1208.0365 entanglement polytopes where introduced as a coarsening of the SLOCC classification of multipartite entanglement. The advantages of classifying entanglement by entanglement polytopes are a finite hierarchy for all dimensions and a number of parameters linear in system size. In arXiv:1208.0365 a method to compute entanglement polytopes using geometric invariant theory is presented. In this thesis we consider alternative methods to compute them. Some geometrical and algebraical tools are presented that can be used to compute inequalities giving an outer approximation of the entanglement polytopes. Furthermore we present a numerical method which, in theory, can compute the entanglement polytope of any given SLOCC class given a representative. Using it we classify the entanglement polytopes of 2×3×N2 \times 3 \times N2×3×N systems.
This paper proposes a novel distributed computation architecture, Quantum Entanglement-Based Distributed Computation (QEB), leveraging quantum entanglement as the foundational mechanism for information transfer and computation. Traditional distributed computing systems are constrained by the limitations of classical communication, resulting in bottlenecks and reduced scalability. QEB overcomes these challenges by directly utilizing the inherent parallelism and resilience of quantum entanglement. The architecture decomposes computational tasks into a series of entangled sub-tasks, orchestrated across a network of quantum nodes. Synchronization and execution of these sub-tasks occur through controlled manipulation of the entangled states, eliminating the need for classical data transmission. Furthermore, the architecture incorporates fault tolerance through the dynamic reconstruction of entangled states, providing robustness against node failures. This approach promises significant advancements in computational performance and reliability, representing a paradigm shift in the field of distributed computing. The core claim of QEB is to build a highly parallel and fault-tolerant architecture by exploiting quantum entanglement as the primary communication channel. ---
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