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 proceedings in physics

Topological View on Entanglement and Complexity

Dmitry Melnikov

Published Jan 1, 2020• 0 citations
Publisher
DOI
10.1007/978-3-030-35473-2_11

Related papers

Disappearance of entanglement: a topological point of view

Dong Zhou, Robert Joynt

arXiv:1006.5474•Quantum Information Processing•Aug 1, 2011•7 citations

Topological entanglement far and wide

Elisa De Ranieri

Newton•Oct 1, 2025•0 citations

Quantum entanglement and topological entanglement

Louis Hirsch Kauffman, Samuel J. Lomonaco

This paper discusses relationships between topological entanglement and quantum entanglement. Specifically, we propose that it is more fundamental to view topological entanglements such as braids as entanglement operators and to associate with them unitary operators that are capable of creating quantum entanglement.

arXiv:quant-ph/0205137•New Journal of Physics•Oct 16, 2002•135 citations

Topological order and entanglement

Alioscia Hamma

Contemporary mathematics - American Mathematical Society•Jan 1, 2009•0 citations

Entanglement criteria: quantum and topological

Louis Hirsch Kauffman, Samuel J. Lomonaco

This paper gives a criterion for detecting the entanglement of a quantum state, and uses it to study the relationship between topological and quantum entanglement. It is fundamental to view topological entanglements such as braids as entanglement operators and to associate to them unitary operators that are capable of creating quantum entanglement. The entanglement criterion is used to explore this connection.

arXiv:quant-ph/0304091•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 5, 2003•38 citations

The Geometry of Clifford Algorithms: Bernstein-Vazirani as Classical Computation in a Rotated Basis

Bartosz Chmura

The Bernstein-Vazirani (BV) algorithm is frequently taught as a canonical example of quantum parallelism, yet the standard interference-based explanation often obscures its underlying simplicity. We present a geometric reframing in which the Hadamard gate "wrapping" acts as a global basis rotation rather than a generator of computational complexity. This perspective reveals that the algorithm is effectively a classical linear computation over GF(2) performed in the conjugate Fourier basis, with the apparent parallelism arising from coordinate transformation. Building on Mermin's earlier pedagogical shortcut, which presented a 'classical' circuit equivalent but stopped short of explicitly labeling it as such, we elevate this to a formal geometric framework. In the extension, we distinguish between globally rotated circuits -- which we reveal as classical linear computations -- and topologically twisted circuits that generate quantum entanglement. We introduce a pedagogical taxonomy distinguishing (1) pure computational-basis circuits, (2) globally rotated circuits (exemplified by Bernstein-Vazirani), and (3) topologically twisted circuits involving non-aligned subsystem bases. This framework allows viewing the Gottesman-Knill theorem from a new angle, extends students' understanding of phase kickback and the 'Ricochet Property'. Furthermore, it provides a more intuitive starting point for explaining Bell-pair extensions through concrete circuit derivations and Qiskit simulations suitable for undergraduate quantum information courses. The outlook explores how this geometric view paves the way for understanding entanglement as topological twists.

quant-pharXiv:2603.12127•Mar 13, 2026•0 citations
The Bernstein-Vazirani (BV) algorithm is frequently taught as a canonical example of quantum parallelism, yet the standard interference-based explanation often obscures its underlying simplicity. We present a geometric reframing in which the Hadamard gate "wrapping" acts as a global basis rotation rather than a generator of computational complexity. This perspective reveals that the algorithm is effectively a classical linear computation over GF(2) performed in the conjugate Fourier basis, with the apparent parallelism arising from coordinate transformation. Building on Mermin's earlier pedagogical shortcut, which presented a 'classical' circuit equivalent but stopped short of explicitly labeling it as such, we elevate this to a formal geometric framework. In the extension, we distinguish between globally rotated circuits -- which we reveal as classical linear computations -- and topologically twisted circuits that generate quantum entanglement. We introduce a pedagogical taxonomy distinguishing (1) pure computational-basis circuits, (2) globally rotated circuits (exemplified by Bernstein-Vazirani), and (3) topologically twisted circuits involving non-aligned subsystem bases. This framework allows viewing the Gottesman-Knill theorem from a new angle, extends students' understanding of phase kickback and the 'Ricochet Property'. Furthermore, it provides a more intuitive starting point for explaining Bell-pair extensions through concrete circuit derivations and Qiskit simulations suitable for undergraduate quantum information courses. The outlook explores how this geometric view paves the way for understanding entanglement as topological twists.