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

Scientific American

Strange and Stringy

Subir Sachdev A

Published Dec 18, 2012• 21 citations
Publisher
DOI
10.1038/scientificamerican0113-44

Related papers

Strange positions

Gordon N. Fleming, Jeremy Butterfield

Cambridge University Press eBooks•Dec 28, 1999•29 citations

Strange sounds

Dmitri V. Khveshchenko

arXiv:2404.01534•Physics Letters A•Oct 23, 2024•7 citations

Probing Stringy Horizons with Pole-Skipping in Non-Maximal Chaotic Systems

Ping Gao, Hong Liu

In this paper, we study pole-skipping in non-maximally quantum chaotic systems. Using Rindler conformal field theories and the large-$q$ SYK chain as illustrative examples, we argue that the pole-skipping points of few-body operators organize into trajectories in the complex frequency-momentum plane, with the leading trajectory encoding the quantum Lyapunov exponent. We further propose that these trajectories admit a natural interpretation as Regge trajectories of stringy excitations in a dual stringy black hole geometry. From this perspective, pole-skipping for an individual operator can be viewed as tracking the stringy horizon through the response of a single excitation. Our results suggest that pole-skipping reflects intrinsic properties of quantum chaotic systems and may be deeply connected to the structure of horizons in the stringy regime.

hep-thCross-listedarXiv:2512.20700•Physical Review Letters•Dec 25, 2025•2 citations

Hermann Grid's Dark Diagonals Disprove QM's ``Beliefs,'' Reveal Stringy Electron, Nucleons, Stick Figure Constellations

Roger D. McLeod, David Matthew McLeod

Collimated laser replicating vision’s focal field shows it, QM, electrons, stringy nucleons, encode and spatially Fourier transform as field amplitudes, not “probabilities.

Bulletin of the American Physical Society•Nov 19, 2011•0 citations

Weirdest of the weird

Michael Brooks

The New Scientist•May 1, 2010•3 citations

Topological and geometrical quantum computation in cohesive Khovanov homotopy type theory

Juan Ospina

The recently proposed Cohesive Homotopy Type Theory is exploited as a formal foundation for central concepts in Topological and Geometrical Quantum Computation. Specifically the Cohesive Homotopy Type Theory provides a formal, logical approach to concepts like smoothness, cohomology and Khovanov homology; and such approach permits to clarify the quantum algorithms in the context of Topological and Geometrical Quantum Computation. In particular we consider the so-called “open-closed stringy topological quantum computer” which is a theoretical topological quantum computer that employs a system of open-closed strings whose worldsheets are open-closed cobordisms. The open-closed stringy topological computer is able to compute the Khovanov homology for tangles and for hence it is a universal quantum computer given than any quantum computation is reduced to an instance of computation of the Khovanov homology for tangles. The universal algebra in this case is the Frobenius Algebra and the possible open-closed stringy topological quantum computers are forming a symmetric monoidal category which is equivalent to the category of knowledgeable Frobenius algebras. Then the mathematical design of an open-closed stringy topological quantum computer is involved with computations and theorem proving for generalized Frobenius algebras. Such computations and theorem proving can be performed automatically using the Automated Theorem Provers with the TPTP language and the SMT-solver Z3 with the SMT-LIB language. Some examples of application of ATPs and SMT-solvers in the mathematical setup of an open-closed stringy topological quantum computer will be provided.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 21, 2015•0 citations
In this paper, we study pole-skipping in non-maximally quantum chaotic systems. Using Rindler conformal field theories and the large-qqq SYK chain as illustrative examples, we argue that the pole-skipping points of few-body operators organize into trajectories in the complex frequency-momentum plane, with the leading trajectory encoding the quantum Lyapunov exponent. We further propose that these trajectories admit a natural interpretation as Regge trajectories of stringy excitations in a dual stringy black hole geometry. From this perspective, pole-skipping for an individual operator can be viewed as tracking the stringy horizon through the response of a single excitation. Our results suggest that pole-skipping reflects intrinsic properties of quantum chaotic systems and may be deeply connected to the structure of horizons in the stringy regime.
The recently proposed Cohesive Homotopy Type Theory is exploited as a formal foundation for central concepts in Topological and Geometrical Quantum Computation. Specifically the Cohesive Homotopy Type Theory provides a formal, logical approach to concepts like smoothness, cohomology and Khovanov homology; and such approach permits to clarify the quantum algorithms in the context of Topological and Geometrical Quantum Computation. In particular we consider the so-called “open-closed stringy topological quantum computer” which is a theoretical topological quantum computer that employs a system of open-closed strings whose worldsheets are open-closed cobordisms. The open-closed stringy topological computer is able to compute the Khovanov homology for tangles and for hence it is a universal quantum computer given than any quantum computation is reduced to an instance of computation of the Khovanov homology for tangles. The universal algebra in this case is the Frobenius Algebra and the possible open-closed stringy topological quantum computers are forming a symmetric monoidal category which is equivalent to the category of knowledgeable Frobenius algebras. Then the mathematical design of an open-closed stringy topological quantum computer is involved with computations and theorem proving for generalized Frobenius algebras. Such computations and theorem proving can be performed automatically using the Automated Theorem Provers with the TPTP language and the SMT-solver Z3 with the SMT-LIB language. Some examples of application of ATPs and SMT-solvers in the mathematical setup of an open-closed stringy topological quantum computer will be provided.