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

Computational matematics series/Computational mathematics series

Transgressing the boundaries of quantum computation

S. A. Fulling

Published Feb 14, 2002• 0 citations
Publisher
DOI
10.1201/9781420035377.pt9

Related papers

Transgressing the boundaries of quantum computation: acontribution to the hermeneuticsof the NMR paradigm

Abstract This personal essay recounts a misadventure in attempting to find a quantum algorithm with a “general purpose” flavor. Exact arithmetic with large integers can be conducted modulo a list of relatively prime numbers, the answer being reconstructed in conventional terms only at the last moment. Implementing this process on a molecular level would lead not to a quantum computation, but to a massively parallel classical computation. It has been observed that something similar is going on, in practice though not in principle, in the nuclear magnetic resonance implementations of the Grover search algorithm. Certain other NMR computations, which are frankly of an “ensemble” nature, are even closer to my proposal, though more practical. Comparing and contrasting these situations may cast light on the current semantic disputes over what constitutes a “quantum” computation.

Chapman & Hall/CRC eBooks•Feb 14, 2002•0 citations

Opening the gate to quantum computation

Anonymous

Physics•Jan 19, 2010•0 citations

Complexity and algorithms in quantum computation

Richard Jozsa

In 1982 Feynman noted that the simulation of a quantum process on a classical computer appears to generally involve an exponential slowdown in running time compared to the evolution of the process itself. More recently in quantum computation this effect has been turned around and exploited for computational advantage by formulating quantum processes (quantum algorithms) whose evolution corresponds to the performance of useful computational tasks. Thus the quantum algorithm will engender an exponential speedup in computing time. The most famous such quantum algorithm is Shor's algorithm for factorising whole numbers. It factorises a number having d digits in a time of order less than d whereas no known classical algorithm can perform factorisation in a time bounded by any polynomial in d. In theoretical computer science, computational complexity is generally characterised by classifying computational tasks into complexity classes such as P, BPP and NP. It therefore appears that quantum computers will be able to transgress some of the boundaries set by these classes. (2 pages)

•Jan 1, 1997•15 citations

Quantum Computation and Its Perspective

Craig S. Lent

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

On the operation of machines powered by quantum non-thermal baths

Wolfgang Niedenzu, David Gelbwaser-Klimovsky, Abraham G. Kofman +1 more

Diverse models of engines energised by quantum-coherent, hence non-thermal, baths allow the engine efficiency to transgress the standard thermodynamic Carnot bound. These transgressions call for an elucidation of the underlying mechanisms. Here we show that non-thermal baths may impart not only heat, but also mechanical work to a machine. The Carnot bound is inapplicable to such a hybrid machine. Intriguingly, it may exhibit dual action, concurrently as engine and refrigerator, with up to 100% efficiency. We conclude that even though a machine powered by a quantum bath may exhibit an unconventional performance, it still abides by the traditional principles of thermodynamics.

arXiv:1508.06519•New Journal of Physics•Aug 2, 2016•150 citations

Advances in Quantum Computation

Kazem Mahdavi, Deborah Koslover

Contemporary mathematics - American Mathematical Society•Jan 1, 2009•8 citations
Abstract This personal essay recounts a misadventure in attempting to find a quantum algorithm with a “general purpose” flavor. Exact arithmetic with large integers can be conducted modulo a list of relatively prime numbers, the answer being reconstructed in conventional terms only at the last moment. Implementing this process on a molecular level would lead not to a quantum computation, but to a massively parallel classical computation. It has been observed that something similar is going on, in practice though not in principle, in the nuclear magnetic resonance implementations of the Grover search algorithm. Certain other NMR computations, which are frankly of an “ensemble” nature, are even closer to my proposal, though more practical. Comparing and contrasting these situations may cast light on the current semantic disputes over what constitutes a “quantum” computation.
In 1982 Feynman noted that the simulation of a quantum process on a classical computer appears to generally involve an exponential slowdown in running time compared to the evolution of the process itself. More recently in quantum computation this effect has been turned around and exploited for computational advantage by formulating quantum processes (quantum algorithms) whose evolution corresponds to the performance of useful computational tasks. Thus the quantum algorithm will engender an exponential speedup in computing time. The most famous such quantum algorithm is Shor's algorithm for factorising whole numbers. It factorises a number having d digits in a time of order less than d whereas no known classical algorithm can perform factorisation in a time bounded by any polynomial in d. In theoretical computer science, computational complexity is generally characterised by classifying computational tasks into complexity classes such as P, BPP and NP. It therefore appears that quantum computers will be able to transgress some of the boundaries set by these classes. (2 pages)
Diverse models of engines energised by quantum-coherent, hence non-thermal, baths allow the engine efficiency to transgress the standard thermodynamic Carnot bound. These transgressions call for an elucidation of the underlying mechanisms. Here we show that non-thermal baths may impart not only heat, but also mechanical work to a machine. The Carnot bound is inapplicable to such a hybrid machine. Intriguingly, it may exhibit dual action, concurrently as engine and refrigerator, with up to 100% efficiency. We conclude that even though a machine powered by a quantum bath may exhibit an unconventional performance, it still abides by the traditional principles of thermodynamics.