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

International Journal of Theoretical Physics

The Mechanism of Quantum Computation

Giuseppe Castagnoli

Published Mar 7, 2008• 5 citations
Publisher
DOI
10.1007/s10773-008-9698-x

Related papers

Brief Primer on the Fundaments of Quantum Computing

Richard L. Amoroso

This QC primer is based on excerpts from the breakthrough volume Universal Quantum Computing (ISBN: 978-981-3145-99-3) which touts having dissolved the remaining barriers to implementing Bulk Universal Quantum Computing (UQC), and as such most likely describes the most advanced QC development platform. Numerous books, hundreds of patents, thousands of papers and a Googolplex of considerations fill the pantheon of QC RD but by what chimeric definition. Does flipping a few qubits in a logic gate without an algorithm qualify as quantum computing? In physics, theory bears little weight without rigorous experimental confirmation, less if new, radical or a paradigm shift. This volume develops quantum computing based on '3rd regime' physics of Unified Field Mechanics (UFM). What distinguishes this work from a myriad of other avenues to UQC under study? Virtually all RD the floodgates will open momentarily. Then we will have actual QCs! The QC prototype proposed herein is room temperature and tabletop. It is dramatically different in that it is not confined to the limitations of quantum mechanics; since it is based on principles of UFM, the Uncertainty Principle and Decoherence no longer apply. Thus, this QC model could be implemented on any other quantum platform!

•Mar 1, 2018•0 citations

Theory of Quantum Computation

Stephen Fenner

WORLD SCIENTIFIC eBooks•Aug 6, 2025•0 citations

Universal Quantum Computing: Supervening Decoherence - Surmounting Uncertainty

Richard L. Amoroso

"This breakthrough volume touts having dissolved the remaining barriers to implementing Bulk Universal Quantum Computing (UQC), and as such most likely describes the most advanced QC development platform. Numerous books, 100s of patents, 1,000s of papers and a Googolplex of considerations fill the pantheon of QC R&D. Of late QC mathemagicians claim QCs already exist; but by what chimeric definition. Does flipping a few qubits in a logic gate without an algorithm qualify as quantum computing? In physics, theory bears little weight without rigorous experimental confirmation, less if new, radical or a paradigm shift. This volume develops quantum computing based on '3rd regime' physics of Unified Field Mechanics (UFM). What distinguishes this work from myriad other avenues to UQC under study? Virtually all R&D paths struggle with technology and decoherence. If highly favored room-sized cryogenically cooled QCs ever become successful, they would be reminiscent of the city block-sized Eniac computer of 1946. The QC prototype proposed herein is room temperature and tabletop. It is dramatically different in that it is not confined to the limitations of quantum mechanics; since it is based on principles of UFM the Uncertainty Principle and Decoherence no longer apply. Thus this QC model could be implemented on any other quantum platform!"...

•Jan 23, 2017•3 citations

The Physics of Quantum Computation

G. Falci, Elisabette Paladino

WORLD SCIENTIFIC eBooks•Sep 28, 2014•2 citations

Quantum Computation and Its Perspective

Craig S. Lent

FEDジャ-ナル•Mar 1, 1997•2 citations

Quantum Computing

Oscar Humberto Montiel Ross, Roberto Sepulveda

In the twenty-fi rst century, many signifi cant developments in science and engineering have been achieved through interdisciplinary research. Quantum computing (QC) is about computing with quantum systems, called quantum computers. A quantum computer is a computational device that makes use of the quantum mechanics (QM) phenomena such as entanglement, superposition and interference to perform operations on data. Quantum computers are different from classical binary digital computers since they work with quantum bits. The theoretical model is the quantum turing machine (QTM) which is a normal turing machine (TM) with quantum parallelism. Richard Feynman introduced this fi eld for the fi rst time in the 80’s (Feynman 1982) since he observed that certain quantum-mechanical effects cannot be simulated in an effi cient way using a classical computer. Such observation let to speculate that using quantum effects may become more effi cient computing. The interest grew up in 1994 when Peter Shor published the paper entitled “Algorithms for Quantum Computation : Discrete Logarithms and Factoring” (Shor 1994) where he described polynomial time quantum algorithms for fi nding discrete logarithms and factoring integers.

CRC Press eBooks•Jan 9, 2014•0 citations
This QC primer is based on excerpts from the breakthrough volume Universal Quantum Computing (ISBN: 978-981-3145-99-3) which touts having dissolved the remaining barriers to implementing Bulk Universal Quantum Computing (UQC), and as such most likely describes the most advanced QC development platform. Numerous books, hundreds of patents, thousands of papers and a Googolplex of considerations fill the pantheon of QC RD but by what chimeric definition. Does flipping a few qubits in a logic gate without an algorithm qualify as quantum computing? In physics, theory bears little weight without rigorous experimental confirmation, less if new, radical or a paradigm shift. This volume develops quantum computing based on '3rd regime' physics of Unified Field Mechanics (UFM). What distinguishes this work from a myriad of other avenues to UQC under study? Virtually all RD the floodgates will open momentarily. Then we will have actual QCs! The QC prototype proposed herein is room temperature and tabletop. It is dramatically different in that it is not confined to the limitations of quantum mechanics; since it is based on principles of UFM, the Uncertainty Principle and Decoherence no longer apply. Thus, this QC model could be implemented on any other quantum platform!
"This breakthrough volume touts having dissolved the remaining barriers to implementing Bulk Universal Quantum Computing (UQC), and as such most likely describes the most advanced QC development platform. Numerous books, 100s of patents, 1,000s of papers and a Googolplex of considerations fill the pantheon of QC R&D. Of late QC mathemagicians claim QCs already exist; but by what chimeric definition. Does flipping a few qubits in a logic gate without an algorithm qualify as quantum computing? In physics, theory bears little weight without rigorous experimental confirmation, less if new, radical or a paradigm shift. This volume develops quantum computing based on '3rd regime' physics of Unified Field Mechanics (UFM). What distinguishes this work from myriad other avenues to UQC under study? Virtually all R&D paths struggle with technology and decoherence. If highly favored room-sized cryogenically cooled QCs ever become successful, they would be reminiscent of the city block-sized Eniac computer of 1946. The QC prototype proposed herein is room temperature and tabletop. It is dramatically different in that it is not confined to the limitations of quantum mechanics; since it is based on principles of UFM the Uncertainty Principle and Decoherence no longer apply. Thus this QC model could be implemented on any other quantum platform!"...
In the twenty-fi rst century, many signifi cant developments in science and engineering have been achieved through interdisciplinary research. Quantum computing (QC) is about computing with quantum systems, called quantum computers. A quantum computer is a computational device that makes use of the quantum mechanics (QM) phenomena such as entanglement, superposition and interference to perform operations on data. Quantum computers are different from classical binary digital computers since they work with quantum bits. The theoretical model is the quantum turing machine (QTM) which is a normal turing machine (TM) with quantum parallelism. Richard Feynman introduced this fi eld for the fi rst time in the 80’s (Feynman 1982) since he observed that certain quantum-mechanical effects cannot be simulated in an effi cient way using a classical computer. Such observation let to speculate that using quantum effects may become more effi cient computing. The interest grew up in 1994 when Peter Shor published the paper entitled “Algorithms for Quantum Computation : Discrete Logarithms and Factoring” (Shor 1994) where he described polynomial time quantum algorithms for fi nding discrete logarithms and factoring integers.