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:quant-ph/0205093 · International Journal of Theoretical Physics

Quantum Principles and Mathematical Computability

Tien D. Kieu

Published Jul 1, 2005• 6 citations
arXivHTMLPDF
DOI
10.1007/s10773-005-7070-y

Related papers

Quantum Computing: The Intersection of Physics and Advanced Mathematics

Shahid Mehmood

Quantum computing represents a revolutionary convergence of physics and advanced mathematics, promising to transform computational paradigms by leveraging quantum mechanical principles. Unlike classical computers, which process information in binary bits, quantum computers utilize quantum bits or qubits that can exist in multiple states simultaneously due to superposition and entanglement. This intersection of quantum physics and advanced mathematical algorithms has the potential to solve complex problems beyond the reach of classical computing, including cryptography, optimization, and drug discovery. This paper explores the foundational principles of quantum computing, the mathematical frameworks that underpin its operations, and the implications for future technological advancements. Through a detailed examination of both theoretical and practical aspects, this study aims to provide a comprehensive overview of how quantum computing bridges the domains of physics and mathematics.

Frontiers in Applied Physics and Mathematics•Apr 30, 2024•0 citations

Computability in Quantum Mechanics

Wayne C. Myrvold

Springer eBooks•Jan 1, 1995•12 citations

Principles of Quantum Computation

Springer eBooks•Feb 2, 2007•4 citations

Computational Principle Boundary Theory: Defining the Limits of Computational Capability

Jincheng Zhang

Computational Principle Boundary Theory (CPBT) is a framework that formalises the relationship between a system's computational principles and its inherent capability limits. By representing computational power as a function of underlying principles and constraints, CPBT provides a unified method for analysing the theoretical upper bounds of any computational model. This paper introduces the core concepts of CPBT, develops a mathematical representation of the principle-ability boundary, explores its implications for classical and quantum models, and demonstrates how CPBT can guide the design of future computational architectures. The theory is expressed entirely in plain text, with all mathematical notation rendered in standard ASCII format to facilitate easy copying and pasting. The discussion is limited to theoretical analysis, and no experimental data or tables are presented.

•Aug 16, 2026•0 citations

Quantum Physics and the Nature of Computation

Umesh V. Vazirani

Lecture notes in computer science•Jan 1, 2005•1 citation

Computing the non-computable

Tien D. Kieu

We explore in the framework of quantum computation the notion of computability, which holds a central position in mathematics and theoretical computer science. A quantum algorithm that exploits the quantum adiabatic processes is considered for Hilbert's tenth problem, which is equivalent to the Turing halting problem and known to be mathematically non-computable. Generalized quantum algorithms are also considered for some other mathematical non-computables in the same and in different non-computability classes. The key element of all these algorithms is the measurability of both the values of physical observables and the quantum-mechanical probability distributions for these values. It is argued that computability, and thus the limits of mathematics, ought to be determined not solely by mathematics itself but also by physical principles.

arXiv:quant-ph/0203034•Contemporary Physics•Jan 1, 2003•30 citations
Quantum computing represents a revolutionary convergence of physics and advanced mathematics, promising to transform computational paradigms by leveraging quantum mechanical principles. Unlike classical computers, which process information in binary bits, quantum computers utilize quantum bits or qubits that can exist in multiple states simultaneously due to superposition and entanglement. This intersection of quantum physics and advanced mathematical algorithms has the potential to solve complex problems beyond the reach of classical computing, including cryptography, optimization, and drug discovery. This paper explores the foundational principles of quantum computing, the mathematical frameworks that underpin its operations, and the implications for future technological advancements. Through a detailed examination of both theoretical and practical aspects, this study aims to provide a comprehensive overview of how quantum computing bridges the domains of physics and mathematics.
Computational Principle Boundary Theory (CPBT) is a framework that formalises the relationship between a system's computational principles and its inherent capability limits. By representing computational power as a function of underlying principles and constraints, CPBT provides a unified method for analysing the theoretical upper bounds of any computational model. This paper introduces the core concepts of CPBT, develops a mathematical representation of the principle-ability boundary, explores its implications for classical and quantum models, and demonstrates how CPBT can guide the design of future computational architectures. The theory is expressed entirely in plain text, with all mathematical notation rendered in standard ASCII format to facilitate easy copying and pasting. The discussion is limited to theoretical analysis, and no experimental data or tables are presented.
We explore in the framework of quantum computation the notion of computability, which holds a central position in mathematics and theoretical computer science. A quantum algorithm that exploits the quantum adiabatic processes is considered for Hilbert's tenth problem, which is equivalent to the Turing halting problem and known to be mathematically non-computable. Generalized quantum algorithms are also considered for some other mathematical non-computables in the same and in different non-computability classes. The key element of all these algorithms is the measurability of both the values of physical observables and the quantum-mechanical probability distributions for these values. It is argued that computability, and thus the limits of mathematics, ought to be determined not solely by mathematics itself but also by physical principles.