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

WORLD SCIENTIFIC eBooks

Theory of Quantum Computation: Mathematical Fundamentals

Stephen Fenner

Published Aug 6, 2025• 0 citations
Publisher
DOI
10.1142/14541

Related papers

A Fundamental Energy-Complexity Uncertainty Relation

Logan Nye

We establish quantum circuit complexity as a fundamental physical observable and prove that it satisfies an uncertainty relation with energy, analogous to Heisenberg’s canonical uncertainty principle. Through rigorous operator theory, we demonstrate that the complexity operator meets all mathematical requirements for a legitimate quantum observable, including self-adjointness, gauge invariance, and proper spectral decomposition. This enables us to derive a fundamental bound that constrains how quickly complexity can increase in physical systems given available energy resources. We provide complete mathematical proofs of these results and demonstrate their far-reaching implications across quantum computation, black hole physics, and computational complexity theory. In particular, we show that this uncertainty relation imposes fundamental speed limits on quantum circuits, explains maximal complexity growth in black holes, and suggests that physical constraints may enforce an effective separation between complexity classes independent of their mathematical relationships. We outline explicit experimental protocols for testing these predictions using current quantum computing platforms and discuss the profound implications for our understanding of the relationship between computational complexity and fundamental physics. Our results indicate that computational requirements may be as basic to physics as energy conservation, suggesting a deep connection between the structure of physical law and fundamental limits on computation.

Journal of Quantum Information Science•Jan 1, 2025•2 citations

The Theory of Quantum Computation: An Introduction

Tino Gramß

Wiley eBooks•May 14, 1998•2 citations

Fundamentals of Quantum Computing: Theory and Practice

Venkateswaran Kasirajan

Springer eBooks•Jan 1, 2021•34 citations

The unitary dynamical state-locking process, the HSSS quantum search process, and the quantum-computing speedup theory

Xijia Miao

A unitary dynamical state-locking (UNIDYSLOCK) process is a unitary process that can transform two orthogonal states to two non-orthogonal states. Its inverse process, i.e., the QUANSDAM process could realize an exponential QC speedup in solving an unstructured search problem in the quantum-computing (QC) speedup theory (X. Miao, arXiv:1105.3573 [quant-ph] (2011)). In this paper the principle of how a UNIDYSLOCK process works is described on the basis of the QC speedup theory. A UNIDYSLOCK process does not exist at all in pure quantum mechanics. That it can change the quantum-state difference is original from the fundamental interaction between the quantum physical laws (i.e., the unitary quantum dynamics and the Hilbert-space symmetric structure) and the mathematical-logical principle of the search problem. It is characteristic for the QC speedup theory. Even if a usual quantum computational (Qc) process that is reversible or unitary contained a UNIDYSLOCK (or QUANSDAM) process, the contribution of the UNIDYSLOCK (or QUANSDAM) process to the QC speedup of the usual Qc process would be secondary or negligible. Whether or not a UNIDYSLOCK (or QUANSDAM) process can make an essential contribution to a QC speedup can distinguish the QC speedup theory from any usual Qc theory. In the paper the QC speedup mechanism of the HSSS quantum search process is also studied. The search process is essentially different from a usual quantum search algorithm. It works in both the usual Hilbert space and the math Hilbert space. Due to the math Hilbert space a mathematical-parallel operation is characteristic for the QC speedup theory, while a quantum-parallel operation is characteristic for the usual Qc theory. The fundamental interaction mentioned above and the fundamental quantum-computing resource play the main role in speeding up the search process.

arXiv:1612.05969•Dec 18, 2016•0 citations

Mathematics of Quantum Computing: An Introduction

Wolfgang Scherer

Springer eBooks•Jan 1, 2019•56 citations

Quantum Entanglement States: A Novel Non-Standard Model for Fundamental Physics and Information Processing

Jincheng Zhang

Quantum entanglement, a cornerstone of quantum mechanics, presents a unique and potentially transformative paradigm for computation. This paper explores the development of a novel non-standard model, rooted in the mathematical description of quantum entanglement, designed to provide a deeper understanding of the fundamental physical mechanisms underlying quantum computation and information processing. The model proposes a framework wherein quantum entanglement serves as the fundamental carrier of information, allowing for the implementation of self-adaptive quantum algorithms. The core claim is that this model offers a robust and mathematically grounded approach to exploring and manipulating entangled states, paving the way for new advancements in quantum information theory and computation. We investigate the mathematical foundations, algorithmic implications, and potential for future research within this framework.

•Sep 4, 2026•0 citations
We establish quantum circuit complexity as a fundamental physical observable and prove that it satisfies an uncertainty relation with energy, analogous to Heisenberg’s canonical uncertainty principle. Through rigorous operator theory, we demonstrate that the complexity operator meets all mathematical requirements for a legitimate quantum observable, including self-adjointness, gauge invariance, and proper spectral decomposition. This enables us to derive a fundamental bound that constrains how quickly complexity can increase in physical systems given available energy resources. We provide complete mathematical proofs of these results and demonstrate their far-reaching implications across quantum computation, black hole physics, and computational complexity theory. In particular, we show that this uncertainty relation imposes fundamental speed limits on quantum circuits, explains maximal complexity growth in black holes, and suggests that physical constraints may enforce an effective separation between complexity classes independent of their mathematical relationships. We outline explicit experimental protocols for testing these predictions using current quantum computing platforms and discuss the profound implications for our understanding of the relationship between computational complexity and fundamental physics. Our results indicate that computational requirements may be as basic to physics as energy conservation, suggesting a deep connection between the structure of physical law and fundamental limits on computation.
A unitary dynamical state-locking (UNIDYSLOCK) process is a unitary process that can transform two orthogonal states to two non-orthogonal states. Its inverse process, i.e., the QUANSDAM process could realize an exponential QC speedup in solving an unstructured search problem in the quantum-computing (QC) speedup theory (X. Miao, arXiv:1105.3573 [quant-ph] (2011)). In this paper the principle of how a UNIDYSLOCK process works is described on the basis of the QC speedup theory. A UNIDYSLOCK process does not exist at all in pure quantum mechanics. That it can change the quantum-state difference is original from the fundamental interaction between the quantum physical laws (i.e., the unitary quantum dynamics and the Hilbert-space symmetric structure) and the mathematical-logical principle of the search problem. It is characteristic for the QC speedup theory. Even if a usual quantum computational (Qc) process that is reversible or unitary contained a UNIDYSLOCK (or QUANSDAM) process, the contribution of the UNIDYSLOCK (or QUANSDAM) process to the QC speedup of the usual Qc process would be secondary or negligible. Whether or not a UNIDYSLOCK (or QUANSDAM) process can make an essential contribution to a QC speedup can distinguish the QC speedup theory from any usual Qc theory. In the paper the QC speedup mechanism of the HSSS quantum search process is also studied. The search process is essentially different from a usual quantum search algorithm. It works in both the usual Hilbert space and the math Hilbert space. Due to the math Hilbert space a mathematical-parallel operation is characteristic for the QC speedup theory, while a quantum-parallel operation is characteristic for the usual Qc theory. The fundamental interaction mentioned above and the fundamental quantum-computing resource play the main role in speeding up the search process.
Quantum entanglement, a cornerstone of quantum mechanics, presents a unique and potentially transformative paradigm for computation. This paper explores the development of a novel non-standard model, rooted in the mathematical description of quantum entanglement, designed to provide a deeper understanding of the fundamental physical mechanisms underlying quantum computation and information processing. The model proposes a framework wherein quantum entanglement serves as the fundamental carrier of information, allowing for the implementation of self-adaptive quantum algorithms. The core claim is that this model offers a robust and mathematically grounded approach to exploring and manipulating entangled states, paving the way for new advancements in quantum information theory and computation. We investigate the mathematical foundations, algorithmic implications, and potential for future research within this framework.