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

QUANTUM TIME MACHINE

Yakir Aharonov, J. Anandan, Lev Vaidman A

Published Mar 1, 1991• 0 citations
Publisher
DOI
10.1142/9789814439251_0029

Related papers

THE QUANTUM TIME MACHINE

А.К. Гуц

SPACE TIME AND FUNDAMENTAL INTERACTIONS•Jan 1, 2019•2 citations

The quantum time machine

Justin Mullins

The New Scientist•Nov 1, 2010•0 citations

PHYSICS VS MACHINE LEARNING: TOPOLOGICAL CLASSIFICATION WITH MACHINE LEARNING & ENHANCED MACHINE LEARNING WITH QUANTUM PROPERTIES

MA NANNAN

•Aug 21, 2023•0 citations

COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE

Tirtharaj Dash, Tanistha Nayak

Now-a-days every computing device is based on the Turing Machine. It is known that classical physics is sufficient to explain macroscopic phenomena, but is not to explain microscopic phenomena like the interference of electrons. In these days, speed-up and down-sizing of computing devices have been carried out using quantum physical effects; however, principles of computation on these devices are also based on classical physics. This paper tries to analyze mathematically a possibility that the Universal Quantum Turing Machine (UQTM) is able to compute faster than any other classical models of computation. Basically we focused on comparative study on computation power of Universal Turing Machine (UTM) and UQTM. Namely, in the equal, we tried to show that the UQTM can solve any NP-complete problem in polynomial time. The result analysis showed that UQTM is faster for any computation.

Journal of Global Research in Computer Sciences•Jun 10, 2012•2 citations

A quantum time machine

Lev Vaidman A

Foundations of Physics•Aug 1, 1991•14 citations

A quantum time machine

Tony Sudbery

Nature•Aug 1, 1990•1 citation
Now-a-days every computing device is based on the Turing Machine. It is known that classical physics is sufficient to explain macroscopic phenomena, but is not to explain microscopic phenomena like the interference of electrons. In these days, speed-up and down-sizing of computing devices have been carried out using quantum physical effects; however, principles of computation on these devices are also based on classical physics. This paper tries to analyze mathematically a possibility that the Universal Quantum Turing Machine (UQTM) is able to compute faster than any other classical models of computation. Basically we focused on comparative study on computation power of Universal Turing Machine (UTM) and UQTM. Namely, in the equal, we tried to show that the UQTM can solve any NP-complete problem in polynomial time. The result analysis showed that UQTM is faster for any computation.