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

Beyond Quantum Computers

Giulio Chiribella, Giacomo Mauro D’Ariano, Paolo Perinotti, Benoît Valiron

Published Dec 1, 2009• 17 citations
OpenAlex

Abstract

The manuscript poses and addresses a new very fundamental issue in Quantum Computer Science, which is going to have a radical impact on the way we currently conceive quantum computation. We show that there exists a new kind of higher-order quantum computation, potentially much more powerful than the usual quantum processing, which is feasible, but cannot be realized by a usual quantum circuit. In order to implement this new kind of computations one needs to change the rules of quantum circuits, also considering circuits with the geometry of the connections that can be itself in a quantum superposition. The new kind of computation poses also fundamental problems for unexplored aspects of quantum mechanics in a non-fixed causal framework, which go far beyond computer-science problems, and may be of relevance in quantum gravity.

Related papers

Quantum Computing

Dr. R. N. Ravikumar Dr. M. Earnest Stephen Gnanadoss Mr. L. Madhi Madhan Mr.Shiv Gulam

Quantum Computing represents a transformative shift in the way we process information. Rooted in the principles of quantum mechanics—superposition, entanglement, and interference—it promises computational capabilities far beyond the reach of classical machines. Problems once considered intractable, such as large-scale optimization, cryptographic analysis, and complex system simulations, now appear within conceivable reach. This book is designed to provide a clear and structured introduction to the foundations and frontiers of quantum computing. It bridges the gap between theory and practice, guiding readers from the fundamental concepts of qubits and quantum gates to advanced topics such as quantum algorithms, error correction, and emerging quantum architectures. Mathematical rigor is balanced with intuitive explanations, ensuring accessibility for students, researchers, and professionals from diverse backgrounds in science, engineering, and computing.

•Jan 20, 2026•0 citations

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

What Quantum Computers Can Do A Structural Clarification Beyond Qubit Count and Cooling

Sungsil Chung

This document does not propose a new quantum computer,nor does it critique existing implementations. Instead, it clarifies what quantum computers can and cannot dounder their current structural assumptions,and introduces an alternative computational framingdeveloped outside dominant narratives. The work is shared as a stable reference point for researchersinterested in structural distinctions between time-dominantand phase-structured computation.

•Feb 5, 2026•0 citations

Quantum Computing :Circuits, Algorithms and Application

Mr. Pradeep Nayak, Sudeep Rathod, Surabhi +1 more

With its potential to completely change computation, quantum computing—a groundbreaking discipline that sprung from computer science and quantum mechanics—has attracted a lot of interest. This essay attempts to cover the foundations of quantum computing and offer a thorough manual for readers who are not specialists in the subject. We start by going over the basic ideas of quantum computing and then take readers through the concepts of qubits, superposition, entanglement, interference, and noise. We study quantum gates, quantum hardware, and fundamental quantum circuits. This paper provides an overview of the present state of quantum computing, focusing on the noisy intermediate-scale quantum (NISQ) era and its possible applications to practical issues. delve into the creation of quantum algorithms and their uses, emphasizing well-known algorithms like as Grover's and Shor's. We also discuss how several fields, like material science, machine learning, encryption, and optimization, are affected by quantum computing. Upon finishing this paper, readers will possess a firm grasp of the fundamentals, practical uses, and procedures of quantum circuit development. Our objective is to offer an invaluable resource for scholars hoping to keep current on this quickly developing topic as well as for those ready to start their adventure with quantum computing

International Journal of Advanced Research in Science Communication and Technology•Aug 8, 2024•2 citations

Quantum Computation

David Peter Divincenzo

If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation.

Science•Oct 13, 1995•1,655 citations

Cryo-CMOS for Quantum System On-Chip Integration: Quantum Computing as the Development Driver

Robert Bogdan Staszewski, Imran Bashir, Elena Blokhina +1 more

Quantum computing (QC) is a new paradigm that exploits fundamental principles of quantum mechanics, such as superposition and entanglement, to tackle problems in mathematics, chemistry, and material science that are well beyond the reach of supercomputers [1]. Its power is derived from a quantum bit (qubit) that can simultaneously exist in a superposition of both zero and one states and become entangled with other qubits. It has been shown that quantum computers can speed up algorithms and, potentially, model any physical process [2]. QC is now the main driver behind the phenomenal development of cryogenic CMOS, or cryo-CMOS [3]. The starting point was the sudden emergence of rudimentary quantum computers from obscure physics labs [4]. In the past, there was simply no sufficient motivation to go through the pain of designing IC circuits at deep cryogenic temperatures, where the silicon substrate is known to freeze out electrically and where no Spice models exist. Hence, we cannot find any remarkable literature related to cryo-CMOS from back then. Now that cryo-CMOS work has seriously begun, the designed circuits are being deployed for other applications, such as astronomy and physics experiments [5]-[12].

IEEE Solid-State Circuits Magazine•Jan 1, 2021•34 citations
The manuscript poses and addresses a new very fundamental issue in Quantum
Computer Science, which is going to have a radical impact on the way we
currently conceive quantum computation. We show that there exists a new kind of
higher-order quantum computation, potentially much more powerful than the
usual quantum processing, which is feasible, but cannot be realized by a usual
quantum circuit. In order to implement this new kind of computations one needs
to change the rules of quantum circuits, also considering circuits with the
geometry of the connections that can be itself in a quantum superposition. The
new kind of computation poses also fundamental problems for unexplored aspects
of quantum mechanics in a non-fixed causal framework, which go far beyond
computer-science problems, and may be of relevance in quantum gravity.
Quantum Computing represents a transformative shift in the way we process information. Rooted in the principles of quantum mechanics—superposition, entanglement, and interference—it promises computational capabilities far beyond the reach of classical machines. Problems once considered intractable, such as large-scale optimization, cryptographic analysis, and complex system simulations, now appear within conceivable reach. This book is designed to provide a clear and structured introduction to the foundations and frontiers of quantum computing. It bridges the gap between theory and practice, guiding readers from the fundamental concepts of qubits and quantum gates to advanced topics such as quantum algorithms, error correction, and emerging quantum architectures. Mathematical rigor is balanced with intuitive explanations, ensuring accessibility for students, researchers, and professionals from diverse backgrounds in science, engineering, and computing.
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.
With its potential to completely change computation, quantum computing—a groundbreaking discipline that sprung from computer science and quantum mechanics—has attracted a lot of interest. This essay attempts to cover the foundations of quantum computing and offer a thorough manual for readers who are not specialists in the subject. We start by going over the basic ideas of quantum computing and then take readers through the concepts of qubits, superposition, entanglement, interference, and noise. We study quantum gates, quantum hardware, and fundamental quantum circuits. This paper provides an overview of the present state of quantum computing, focusing on the noisy intermediate-scale quantum (NISQ) era and its possible applications to practical issues. delve into the creation of quantum algorithms and their uses, emphasizing well-known algorithms like as Grover's and Shor's. We also discuss how several fields, like material science, machine learning, encryption, and optimization, are affected by quantum computing. Upon finishing this paper, readers will possess a firm grasp of the fundamentals, practical uses, and procedures of quantum circuit development. Our objective is to offer an invaluable resource for scholars hoping to keep current on this quickly developing topic as well as for those ready to start their adventure with quantum computing
If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation.
Quantum computing (QC) is a new paradigm that exploits fundamental principles of quantum mechanics, such as superposition and entanglement, to tackle problems in mathematics, chemistry, and material science that are well beyond the reach of supercomputers [1]. Its power is derived from a quantum bit (qubit) that can simultaneously exist in a superposition of both zero and one states and become entangled with other qubits. It has been shown that quantum computers can speed up algorithms and, potentially, model any physical process [2]. QC is now the main driver behind the phenomenal development of cryogenic CMOS, or cryo-CMOS [3]. The starting point was the sudden emergence of rudimentary quantum computers from obscure physics labs [4]. In the past, there was simply no sufficient motivation to go through the pain of designing IC circuits at deep cryogenic temperatures, where the silicon substrate is known to freeze out electrically and where no Spice models exist. Hence, we cannot find any remarkable literature related to cryo-CMOS from back then. Now that cryo-CMOS work has seriously begun, the designed circuits are being deployed for other applications, such as astronomy and physics experiments [5]-[12].