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

arXiv:math/9711204 · Workshop on Physics and Computation (PhysComp)

Aspects Of Computability In Physics

Joseph Shipman

Published Aug 24, 2005• 4 citations
arXivHTMLPDF

Abstract

This paper reviews connections between physics and computation, and explores their implications. The main topics are computational "hardness" of physical systems, computational status of fundamental theories, quantum computation, and the Universe as a computer.
DOI
10.1109/phycmp.1992.615561

Related papers

QUANTUM COMPUTATION

Dorit Aharonov

In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically powerful computational tool. This review is about to tell the story of theoretical quantum computation. I left out the developing topic of experimental realizations of the model, and neglected other closely related topics which are quantum information and quantum communication. As a result of narrowing the scope of this paper, I hope it has gained the benefit of being an almost self contained introduction to the exciting field of quantum computation. The review begins with background on theoretical computer science, Turing machines and Boolean circuits. In light of these models, I define quantum computers, and discuss the issue of universal quantum gates. Quantum algorithms, including Shor's factorization algorithm and Grover's algorithm for searching databases, are explained. I will devote much attention to understanding what the origins of the quantum computational power are, and what the limits of this power are. Finally, I describe the recent theoretical results which show that quantum computers maintain their complexity power even in the presence of noise, inaccuracies and finite precision. I tried to put all results in their context, asking what the implications to other issues in computer science and physics are. In the end of this review I make these connections explicit, discussing the possible implications of quantum computation on fundamental physical questions, such as the transition from quantum to classical physics.

arXiv:quant-ph/9812037•WORLD SCIENTIFIC eBooks•Mar 1, 1999•103 citations

微观宇宙的弦理论验证算法

Jincheng Zhang

This paper explores the potential of a novel algorithm, dubbed "Quantum Geometry Verification" (QGV), to validate the core principles of string theory through precise geometric analysis. The algorithm leverages the unique properties of quantum computation to evaluate fundamental aspects of string theory's geometry, aiming to identify potential physical interpretations and guide future research directions. This research presents a framework for automated verification, offering a potentially transformative approach to understanding the underlying structure of the universe. The core claim is that this algorithm will provide preliminary validation of string theory's predictions, opening avenues for deeper exploration into its potential physical implications. We detail the algorithm's methodology, highlighting the crucial role of quantum computation in achieving this validation. The significance of this work lies in its potential to accelerate the understanding of string theory and uncover new connections between mathematics and physics.

•Aug 31, 2026•0 citations

Computational complexity for physicists

Stephan Mertens

The theory of computational complexity has some interesting links to physics, in particular to quantum computing and statistical mechanics. The article contains an informal introduction to this theory and its links to physics.

Computing in Science & Engineering•Jan 1, 2002•60 citations

Quantum computers

David Deutsch

Abstract A number of research programs with widely different motivations have, during the last few years been coming to a conclusion that is startling to some, and which others say they have suspected all along: that the theory of computation is connected at many levels, including the most fundamental, to physics. In particular it has connections with our deepest and most powerful physical theory, quantum theory.

ITNOW•Jun 1, 1987•0 citations

Introduction to Quantum Information Processing

Elham Kashefi

The topic of these lectures lies in the new and rapidly growing field of quantum computing,which explores connections between physics and computing in general. Quantum informa-tion processing is a cross-disciplinary field and is of great importance from both a funda-mental, as well as technological perspective [27]. From the fundamental perspective we havedeepened our understanding of the relationship between physics, information and computa-tion in general, and have also gained a deeper understanding of the fundamental aspects ofquantum theory - non-locality and entanglement in particular [31]. From the technologicalperspective we have manipulated larger and larger quantum systems and obtained power-ful practical applications in the domain of communication and cryptography such as theunconditionally secure quantum cryptography (key exchange) and quantum teleportation[7, 14, 5].Historically, the greater potential of the quantum computer was first realised by Feyn-man, who noted that quantum systems appear to be exponentially hard to simulate withclassical computers [15]. He speculated that, therefore, quantum computers could poten-tially be much more powerful than their classical counterparts. This intuition has beenproven to be correct for some tasks, such as factoring large numbers and searching unstruc-tured databases. Every computer is fundamentally a physical system, and any computationis just a physical process undergone by this system. Quantum physics is the most accurateway of describing physical systems and their behaviour in general. Encoding informationinto quantum systems and processing it according to the laws of quantum physics results innew features which do not exist in the classical computation.Large scale quantum computation is still hypothetical. However, Moore’s law

•Jan 1, 2004•0 citations

WHAT IS QUANTUM COMPUTATION?

ARTUR K. EKERT, Patrick M. Hayden, Hitoshi Inamori +1 more

"Information is physical and any processing of information is always performed by physical means," an innocent-sounding statement, but its consequences are profound. When quantum effects become important, for example, at the level of single atoms and photons, the classical theory of computation becomes fundamentally inadequate. Entirely new modes of computation and information processing become possible. In the last few years there has been an explosion of theoretical and experimental research in quantum computation. In this brief review we describe some of these developments.

International Journal of Modern Physics A•Aug 10, 2001•12 citations
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically powerful computational tool. This review is about to tell the story of theoretical quantum computation. I left out the developing topic of experimental realizations of the model, and neglected other closely related topics which are quantum information and quantum communication. As a result of narrowing the scope of this paper, I hope it has gained the benefit of being an almost self contained introduction to the exciting field of quantum computation. The review begins with background on theoretical computer science, Turing machines and Boolean circuits. In light of these models, I define quantum computers, and discuss the issue of universal quantum gates. Quantum algorithms, including Shor's factorization algorithm and Grover's algorithm for searching databases, are explained. I will devote much attention to understanding what the origins of the quantum computational power are, and what the limits of this power are. Finally, I describe the recent theoretical results which show that quantum computers maintain their complexity power even in the presence of noise, inaccuracies and finite precision. I tried to put all results in their context, asking what the implications to other issues in computer science and physics are. In the end of this review I make these connections explicit, discussing the possible implications of quantum computation on fundamental physical questions, such as the transition from quantum to classical physics.
This paper explores the potential of a novel algorithm, dubbed "Quantum Geometry Verification" (QGV), to validate the core principles of string theory through precise geometric analysis. The algorithm leverages the unique properties of quantum computation to evaluate fundamental aspects of string theory's geometry, aiming to identify potential physical interpretations and guide future research directions. This research presents a framework for automated verification, offering a potentially transformative approach to understanding the underlying structure of the universe. The core claim is that this algorithm will provide preliminary validation of string theory's predictions, opening avenues for deeper exploration into its potential physical implications. We detail the algorithm's methodology, highlighting the crucial role of quantum computation in achieving this validation. The significance of this work lies in its potential to accelerate the understanding of string theory and uncover new connections between mathematics and physics.
The topic of these lectures lies in the new and rapidly growing field of quantum computing,which explores connections between physics and computing in general. Quantum informa-tion processing is a cross-disciplinary field and is of great importance from both a funda-mental, as well as technological perspective [27]. From the fundamental perspective we havedeepened our understanding of the relationship between physics, information and computa-tion in general, and have also gained a deeper understanding of the fundamental aspects ofquantum theory - non-locality and entanglement in particular [31]. From the technologicalperspective we have manipulated larger and larger quantum systems and obtained power-ful practical applications in the domain of communication and cryptography such as theunconditionally secure quantum cryptography (key exchange) and quantum teleportation[7, 14, 5].Historically, the greater potential of the quantum computer was first realised by Feyn-man, who noted that quantum systems appear to be exponentially hard to simulate withclassical computers [15]. He speculated that, therefore, quantum computers could poten-tially be much more powerful than their classical counterparts. This intuition has beenproven to be correct for some tasks, such as factoring large numbers and searching unstruc-tured databases. Every computer is fundamentally a physical system, and any computationis just a physical process undergone by this system. Quantum physics is the most accurateway of describing physical systems and their behaviour in general. Encoding informationinto quantum systems and processing it according to the laws of quantum physics results innew features which do not exist in the classical computation.Large scale quantum computation is still hypothetical. However, Moore’s law
"Information is physical and any processing of information is always performed by physical means," an innocent-sounding statement, but its consequences are profound. When quantum effects become important, for example, at the level of single atoms and photons, the classical theory of computation becomes fundamentally inadequate. Entirely new modes of computation and information processing become possible. In the last few years there has been an explosion of theoretical and experimental research in quantum computation. In this brief review we describe some of these developments.