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

Journal of Uncertain Systems

Computation in quantum space-time could lead to a super-polynomial speedup

Michael Zakharevich, Владик Крейнович

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

In theoretical computer science, researchers usually distinguish between feasible problems (that can be solved in polynomial time) and problems that require more computation time. A natural question is: can we use new physical processes, processes that have not been used in modern computers, to make computations drastically faster – e.g., to make intractable problems feasible? Such a possibility would occur if a physical process provides a super-polynomial ( = faster than polynomial) speed-up. In this direction, the most active research is undertaken in quantum computing. It is well known that quantum processes can drastically speed up computations; however, there are proven super-polynomial quantum speedups of the overall computation time. Parallelization is another potential source of speedup. In Euclidean space, parallelization only leads to a polynomial speedup. We show that in quantum space-time, parallelization could potentially lead to (provably) super-polynomial speedup of computations. c⃝2012 World Academic Press, UK. All rights reserved.

Related papers

Quantum Algorithms in a Superposition of Spacetimes

Omri Shmueli

Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the universe grows, so does our ability to use it for computation. A natural question that arises is, what will physics allow in the future? Can more advanced theories of physics increase our computational power, beyond quantum computing? An active field of research in physics studies theoretical phenomena outside the scope of explainable quantum mechanics, that form when attempting to combine Quantum Mechanics (QM) with General Relativity (GR) into a unified theory of Quantum Gravity (QG). QG is known to present the possibility of a quantum superposition of causal structure and event orderings. In the literature of quantum information theory, this translates to a superposition of unitary evolution orders. In this work we show a first example of a natural computational model based on QG, that provides an exponential speedup over standard quantum computation (under standard hardness assumptions). We define a model and complexity measure for a quantum computer that has the ability to generate a superposition of unitary evolution orders, and show that such computer is able to solve in polynomial time two of the fundamental problems in computer science: The Graph Isomorphism Problem ($\mathsf{GI}$) and the Gap Closest Vector Problem ($\mathsf{GapCVP}$), with gap $O\left( n \sqrt{n} \right)$. These problems are believed by experts to be hard to solve for a regular quantum computer. Interestingly, our model does not seem overpowered, and we found no obvious way to solve entire complexity classes that are considered hard in computer science, like the classes $\mathbf{NP}$ and $\mathbf{SZK}$.

arXiv:2403.02937•Mar 5, 2024•1 citation

Quantum Algorithms and Hard Problems

C. Vidya Raj, H. D. Phaneendra, M. S. Shivakumar

Any computation is necessarily a physical process. The current drive towards increasing speed and miniaturization of computers lead modern technology towards the subatomic domain - quantum computing, where strange quantum behavior takes over from familiar classical notions. The quantum computers have the ability to solve problems with varied computational complexities and more importantly hard problems. A problem is said to be hard, if the best possible algorithm requires exponential resources. This exponential quantum parallelism is the basis for the quantum speedup of many algorithms, and has made the construction of fast algorithms for quantum computers possible. Various proposals exist for modeling and devising procedures on computational problems related to factoring, searching, quantum counting, generalization of quantum algorithms etc. (Shor, 1994). In this paper, we have discussed the importance of algorithms such as order-finding, factoring and quantum searching which require exorbitant resources for their solution which otherwise is impossible on a classical computer

IEEE International Conference on Cognitive Informatics•Jul 1, 2006•5 citations

Do we need quantum for quantum computing?

David K. Ferry, Richard Akis, Matthew J. Gilbert +1 more

The concept of quantum computing has arisen as a methodology by which very rapid computations can be achieved. There also has been considerable discussion about physical implementations of the qubit. This has led, in recent years, to a situation in which quantum computing and quantum information theory are being rapidly developed. In general, the specific advantages offered by quantum computing have been somewhat nebulous. On the one hand, faster computing was promised, but we now know that no speedup of most algorithms exists relative the speed that can be obtained with massive parallel processing. Then, we are promised that the use of entanglement will make quantum computing possible with a much smaller use of resources. Yet, entanglement must be viewed as a hidden variable, which is not accessible in experiment. How does this provide the speedup? We have suggested that analog processing may provide a suitable alternative, and may be the basis which provides the speedup in quantum computing, but this is a controversial assertion. In this talk, we will discuss these particular viewpoints, along with several approaches to a wave basis for (quantum) computing.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 9, 2003•6 citations

The future of quantum computing with superconducting qubits

Sergey B. Bravyi, Oliver Dial, Jay Gambetta +2 more

For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs). Extracting the full potential of computation and realizing quantum algorithms with a super-polynomial speedup will most likely require major advances in quantum error correction technology. Meanwhile, achieving a computational advantage in the near term may be possible by combining multiple QPUs through circuit knitting techniques, improving the quality of solutions through error suppression and mitigation, and focusing on heuristic versions of quantum algorithms with asymptotic speedups. For this to happen, the performance of quantum computing hardware needs to improve and software needs to seamlessly integrate quantum and classical processors together to form a new architecture that we are calling quantum-centric supercomputing. In the long term, we see hardware that exploits qubit connectivity in higher than 2D topologies to realize more efficient quantum error correcting codes, modular architectures for scaling QPUs and parallelizing workloads, and software that evolves to make the intricacies of the technology invisible to the users and realize the goal of ubiquitous, frictionless quantum computing.

arXiv:2209.06841•Journal of Applied Physics•Oct 26, 2022•406 citations

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality

Kazuki Sakamoto, Keisuke Fujii

The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in simulating classical dynamics with long-range interactions. However, many real-world classical systems, such as those arising from partial differential equations, exhibit only local interactions. The question remains whether quantum algorithms can still provide exponential speedup under this condition. In this work, we thoroughly characterize the computational complexity of simulating such geometrically local systems on quantum computers. First, we dequantize the quantum algorithm for simulating short-time (polynomial-time) dynamics of such systems. This implies that the problem of simulating this dynamics does not yield any exponential quantum advantage. Second, we show that simulating short-time dynamics is at least as hard as polynomial-time and linear-space probabilistic classical computation. Third, we show that the computational complexity of simulating long-time (exponential-time) dynamics is captured by exponential-time and polynomial-space quantum computation. This suggests a super-polynomial time advantage when restricting the computation to polynomial-space, or an exponential space advantage otherwise. This work offers new insights into the complexity of classical dynamics governed by partial differential equations, providing a pathway for achieving quantum advantage in practical problems.

arXiv:2505.10445•Quantum•Aug 3, 2026•4 citations

A Resource for Quantum Computation

Niklas Johansson

In this thesis we address the question, what is the resource, or property, that enables the advantage of quantum computers?The theory of quantum computers dates back to the eighties, so one would think there already is an answer to this question.There are several proposed solutions, but to this date, there is no consensus on an answer.Primarily, the advantage of quantum computers is characterized by a speedup for certain computational problems.This speedup is measured by comparing quantum algorithms with the bestknown classical algorithms.For some algorithms we assume access to an object called oracle.The oracle computes a function, and the complexity of the oracle is of no concern.Instead, we count the number of queries to the oracle needed to solve the problem.Informally, the question we ask using an oracle is: if we can compute this function efficiently, what else could we then compute.However, using oracles while measuring a quantum speedup, we assume access to vastly different oracles residing in different models of computation.For our investigation of the speedup, we introduce a classical simulation framework that imitates quantum algorithms.The simulation suggests that the property enabling the potential quantum speedup is the ability to store, process, and retrieve information in an additional degree of freedom.We then theoretically verified that this is true for all problems that can be efficiently solved with a quantum computer.In parallel to this, we also see that quantum oracles sharply specify the information we can retrieve from the additional degree of freedom, while regular oracles do not.A regular oracle does not even allow for an extra degree of freedom.We conclude that comparing quantum with classical oracle query complexity bounds does not provide conclusive evidence for a quantum advantage.I want to thank Jan-Åke Larsson, without whom this research would not have been possible.If there is any magic in the world, it shows through Jan-Åke's ability to simultaneously be a good supervisor, colleague, and friend.I would also like to thank my co-supervisor Peter Jonsson, for many valuable discussions -not only restricted to theoretical computer science.To my friends and collogues that have challenged me to become better, especially Jonathan Jogenfors

Linköping studies in science and technology. Dissertations•Dec 3, 2021•0 citations
In theoretical computer science, researchers usually distinguish between feasible problems (that can be solved in polynomial time) and problems that require more computation time. A natural question is: can we use new physical processes, processes that have not been used in modern computers, to make computations drastically faster – e.g., to make intractable problems feasible? Such a possibility would occur if a physical process provides a super-polynomial ( = faster than polynomial) speed-up. In this direction, the most active research is undertaken in quantum computing. It is well known that quantum processes can drastically speed up computations; however, there are proven super-polynomial quantum speedups of the overall computation time. Parallelization is another potential source of speedup. In Euclidean space, parallelization only leads to a polynomial speedup. We show that in quantum space-time, parallelization could potentially lead to (provably) super-polynomial speedup of computations. c⃝2012 World Academic Press, UK. All rights reserved.
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the universe grows, so does our ability to use it for computation. A natural question that arises is, what will physics allow in the future? Can more advanced theories of physics increase our computational power, beyond quantum computing? An active field of research in physics studies theoretical phenomena outside the scope of explainable quantum mechanics, that form when attempting to combine Quantum Mechanics (QM) with General Relativity (GR) into a unified theory of Quantum Gravity (QG). QG is known to present the possibility of a quantum superposition of causal structure and event orderings. In the literature of quantum information theory, this translates to a superposition of unitary evolution orders. In this work we show a first example of a natural computational model based on QG, that provides an exponential speedup over standard quantum computation (under standard hardness assumptions). We define a model and complexity measure for a quantum computer that has the ability to generate a superposition of unitary evolution orders, and show that such computer is able to solve in polynomial time two of the fundamental problems in computer science: The Graph Isomorphism Problem (GI\mathsf{GI}GI) and the Gap Closest Vector Problem (GapCVP\mathsf{GapCVP}GapCVP), with gap O(nn)O\left( n \sqrt{n} \right)O(nn​). These problems are believed by experts to be hard to solve for a regular quantum computer. Interestingly, our model does not seem overpowered, and we found no obvious way to solve entire complexity classes that are considered hard in computer science, like the classes NP\mathbf{NP}NP and SZK\mathbf{SZK}SZK.
Any computation is necessarily a physical process. The current drive towards increasing speed and miniaturization of computers lead modern technology towards the subatomic domain - quantum computing, where strange quantum behavior takes over from familiar classical notions. The quantum computers have the ability to solve problems with varied computational complexities and more importantly hard problems. A problem is said to be hard, if the best possible algorithm requires exponential resources. This exponential quantum parallelism is the basis for the quantum speedup of many algorithms, and has made the construction of fast algorithms for quantum computers possible. Various proposals exist for modeling and devising procedures on computational problems related to factoring, searching, quantum counting, generalization of quantum algorithms etc. (Shor, 1994). In this paper, we have discussed the importance of algorithms such as order-finding, factoring and quantum searching which require exorbitant resources for their solution which otherwise is impossible on a classical computer
The concept of quantum computing has arisen as a methodology by which very rapid computations can be achieved. There also has been considerable discussion about physical implementations of the qubit. This has led, in recent years, to a situation in which quantum computing and quantum information theory are being rapidly developed. In general, the specific advantages offered by quantum computing have been somewhat nebulous. On the one hand, faster computing was promised, but we now know that no speedup of most algorithms exists relative the speed that can be obtained with massive parallel processing. Then, we are promised that the use of entanglement will make quantum computing possible with a much smaller use of resources. Yet, entanglement must be viewed as a hidden variable, which is not accessible in experiment. How does this provide the speedup? We have suggested that analog processing may provide a suitable alternative, and may be the basis which provides the speedup in quantum computing, but this is a controversial assertion. In this talk, we will discuss these particular viewpoints, along with several approaches to a wave basis for (quantum) computing.
For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs). Extracting the full potential of computation and realizing quantum algorithms with a super-polynomial speedup will most likely require major advances in quantum error correction technology. Meanwhile, achieving a computational advantage in the near term may be possible by combining multiple QPUs through circuit knitting techniques, improving the quality of solutions through error suppression and mitigation, and focusing on heuristic versions of quantum algorithms with asymptotic speedups. For this to happen, the performance of quantum computing hardware needs to improve and software needs to seamlessly integrate quantum and classical processors together to form a new architecture that we are calling quantum-centric supercomputing. In the long term, we see hardware that exploits qubit connectivity in higher than 2D topologies to realize more efficient quantum error correcting codes, modular architectures for scaling QPUs and parallelizing workloads, and software that evolves to make the intricacies of the technology invisible to the users and realize the goal of ubiquitous, frictionless quantum computing.
The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in simulating classical dynamics with long-range interactions. However, many real-world classical systems, such as those arising from partial differential equations, exhibit only local interactions. The question remains whether quantum algorithms can still provide exponential speedup under this condition. In this work, we thoroughly characterize the computational complexity of simulating such geometrically local systems on quantum computers. First, we dequantize the quantum algorithm for simulating short-time (polynomial-time) dynamics of such systems. This implies that the problem of simulating this dynamics does not yield any exponential quantum advantage. Second, we show that simulating short-time dynamics is at least as hard as polynomial-time and linear-space probabilistic classical computation. Third, we show that the computational complexity of simulating long-time (exponential-time) dynamics is captured by exponential-time and polynomial-space quantum computation. This suggests a super-polynomial time advantage when restricting the computation to polynomial-space, or an exponential space advantage otherwise. This work offers new insights into the complexity of classical dynamics governed by partial differential equations, providing a pathway for achieving quantum advantage in practical problems.
In this thesis we address the question, what is the resource, or property, that enables the advantage of quantum computers?The theory of quantum computers dates back to the eighties, so one would think there already is an answer to this question.There are several proposed solutions, but to this date, there is no consensus on an answer.Primarily, the advantage of quantum computers is characterized by a speedup for certain computational problems.This speedup is measured by comparing quantum algorithms with the bestknown classical algorithms.For some algorithms we assume access to an object called oracle.The oracle computes a function, and the complexity of the oracle is of no concern.Instead, we count the number of queries to the oracle needed to solve the problem.Informally, the question we ask using an oracle is: if we can compute this function efficiently, what else could we then compute.However, using oracles while measuring a quantum speedup, we assume access to vastly different oracles residing in different models of computation.For our investigation of the speedup, we introduce a classical simulation framework that imitates quantum algorithms.The simulation suggests that the property enabling the potential quantum speedup is the ability to store, process, and retrieve information in an additional degree of freedom.We then theoretically verified that this is true for all problems that can be efficiently solved with a quantum computer.In parallel to this, we also see that quantum oracles sharply specify the information we can retrieve from the additional degree of freedom, while regular oracles do not.A regular oracle does not even allow for an extra degree of freedom.We conclude that comparing quantum with classical oracle query complexity bounds does not provide conclusive evidence for a quantum advantage.I want to thank Jan-Åke Larsson, without whom this research would not have been possible.If there is any magic in the world, it shows through Jan-Åke's ability to simultaneously be a good supervisor, colleague, and friend.I would also like to thank my co-supervisor Peter Jonsson, for many valuable discussions -not only restricted to theoretical computer science.To my friends and collogues that have challenged me to become better, especially Jonathan Jogenfors