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/0504024 · International Journal of Modern Physics B

QUANTUM TIMING AND SYNCHRONIZATION PROBLEMS

Diego de Falco, Dario Tamascelli

Published Feb 20, 2004• 4 citations
arXivHTMLPDF

Abstract

Feynman's model of a quantum computer provides an example of a continuous-time quantum walk. Its clocking mechanism is an excitation of a basically linear chain of spins with occasional controlled jumps which allow for motion on a planar graph. The spreading of the wave packet poses limitations on the probability of ever completing the s elementary steps of a computation: an additional amount of storage space δ is needed in order to achieve an assigned completion probability. In this note we study the END instruction, viewed as a measurement of the position of the clocking excitation: a π-pulse indefinitely freezes the contents of the input/output register, with a probability depending only on the ratio δ/s.

DOI
10.1142/s0217979204024240

Related papers

Grover's algorithm on a Feynman computer

Diego de Falco, Dario Tamascelli

We present an implementation of Grover's algorithm in the framework of Feynman's cursor model of a quantum computer. The cursor degrees of freedom act as a quantum clocking mechanism, and allow Grover's algorithm to be performed using a single, time-independent Hamiltonian. We examine issues of locality and resource usage in implementing such a Hamiltonian. In the familiar language of Heisenberg spin–spin coupling, the clocking mechanism appears as an excitation of a basically linear chain of spins, with occasional controlled jumps that allow for motion on a planar graph: in this sense our model implements the idea of ‘timing’ a quantum algorithm using a continuous-time random walk. In this context we examine some consequences of the entanglement between the states of the input/output register and the states of the quantum clock.

arXiv:quant-ph/0610130•Journal of Physics A Mathematical and General•Jan 6, 2004•7 citations

The clock of a quantum computer

Bruno Apolloni, Diego de Falco

If the physical agent (the 'pointer', or 'cursor', or 'clocking mechanism') that sequentially scans the T lines of a long computer program is a microscopic system, two quantum phenomena become relevant: spreading of the probability distribution of the pointer along the program lines, and scattering of the probability amplitude at the two endpoints of the physical space allowed for its motion. We show that the first effect determines an upper bound O ( T −2/3 ) on the probability of finding the pointer exactly at the END line. By adding an adequate number δ of further empty lines ('telomers'), one can store the result of the computation up to the moment in which the pointer is scattered back into the active region. This leads to a less severe upper bound O (√δ/ T ) on the probability of finding the pointer either at the END line or within the additional empty lines. Our analysis is performed in the context of Feynman's model of quantum computation, the only model, to our knowledge, that explicitly includes a physically plausible quantum clocking mechanism in its considerations.

Journal of Physics A Mathematical and General•Nov 14, 2002•9 citations

Speed and entropy of an interacting continuous time quantum walk

Diego de Falco, Dario Tamascelli

We present some dynamic and entropic considerations about the evolution of a continuous time quantum walk implementing the clock of an autonomous machine. On a simple model, we study in quite explicit terms the Lindblad evolution of the clocked subsystem, relating the evolution of its entropy to the spreading of the wave packet of the clock. We explore possible ways of reducing the generation of entropy in the clocked subsystem, as it amounts to a deficit in the probability of finding the target state of the computation. We are thus led to examine the benefits of abandoning some classical prejudice about how a clocking mechanism should operate.

arXiv:quant-ph/0604067•Journal of Physics A Mathematical and General•May 3, 2006•11 citations

Interacting quantum walks

Dario Tamascelli

In this work we present the quantum mechanical computer proposed by Feynman in 1985 and, since then, widely cited but seldom used. The main feature of the model is the presence of a built in clocking mechanism managing for the ordered application of the computational primitives to the input/output register.

arXiv:0910.2871•Oct 15, 2009•0 citations

Clocks in Feynman's computer and Kitaev's local Hamiltonian: Bias, gaps, idling, and pulse tuning

Libor Caha, Zeph A. Landau, Daniel Nagaj

We present a collection of results about the clock in Feynman's computer construction and Kitaev's local Hamiltonian problem. First, by analyzing the spectra of quantum walks on a line with varying end-point terms, we find a better lower bound on the gap of the Feynman Hamiltonian, which translates into a less strict promise gap requirement for the quantum-Merlin-Arthur--complete local Hamiltonian problem. We also translate this result into the language of adiabatic quantum computation. Second, introducing an idling clock construction with a large state space but fast Cesaro mixing, we provide a way for achieving an arbitrarily high success probability of computation with Feynman's computer with only a logarithmic increase in the number of clock qubits. Finally, we tune and thus improve the costs (locality and gap scaling) of implementing a (pulse) clock with a single excitation.

arXiv:1712.07395•Physical Review A•Jun 5, 2018•34 citations

Efficiency of Feynman's quantum computer

Ralph Jason Costales, Ali Gunning, T. C. Dorlas

Feynman's circuit-to-Hamiltonian construction enables the mapping of a quantum circuit to a time-independent Hamiltonian. This model introduces a Hilbert space made from an ancillary clock register tracking the progress of the computation. In this paper, we explore the efficiency, or run time, of a quantum computer that directly implements the clock system. This relates to the model's probability of computation completion which we investigate at an established optimal time for an arbitrary number of gates k . The relationship between the run time of the model and the number of gates is obtained both numerically and analytically to be O ( k 5 / 3 ) . In principle, this is significantly more efficient than the well-investigated Feynman-Kitaev model of adiabatic quantum computation with a run time of O ( k 4 ) . We address the challenge which stems from the small window that exists to capture the optimal stopping time, after which there are rapid oscillations of decreasing probability amplitude. We establish a relationship for the time difference between the first and second maximum which scales as O( k 1 / 3 ).

arXiv:2309.09331•Physical Review A•Feb 14, 2025•1 citation
Feynman's model of a quantum computer provides an example of a continuous-time quantum walk. Its clocking mechanism is an excitation of a basically linear chain of spins with occasional controlled jumps which allow for motion on a planar graph. The spreading of the wave packet poses limitations on the probability of ever completing the s elementary steps of a computation: an additional amount of storage space δ is needed in order to achieve an assigned completion probability. In this note we study the END instruction, viewed as a measurement of the position of the clocking excitation: a π-pulse indefinitely freezes the contents of the input/output register, with a probability depending only on the ratio δ/s.
We present an implementation of Grover's algorithm in the framework of Feynman's cursor model of a quantum computer. The cursor degrees of freedom act as a quantum clocking mechanism, and allow Grover's algorithm to be performed using a single, time-independent Hamiltonian. We examine issues of locality and resource usage in implementing such a Hamiltonian. In the familiar language of Heisenberg spin–spin coupling, the clocking mechanism appears as an excitation of a basically linear chain of spins, with occasional controlled jumps that allow for motion on a planar graph: in this sense our model implements the idea of ‘timing’ a quantum algorithm using a continuous-time random walk. In this context we examine some consequences of the entanglement between the states of the input/output register and the states of the quantum clock.
If the physical agent (the 'pointer', or 'cursor', or 'clocking mechanism') that sequentially scans the T lines of a long computer program is a microscopic system, two quantum phenomena become relevant: spreading of the probability distribution of the pointer along the program lines, and scattering of the probability amplitude at the two endpoints of the physical space allowed for its motion. We show that the first effect determines an upper bound O ( T −2/3 ) on the probability of finding the pointer exactly at the END line. By adding an adequate number δ of further empty lines ('telomers'), one can store the result of the computation up to the moment in which the pointer is scattered back into the active region. This leads to a less severe upper bound O (√δ/ T ) on the probability of finding the pointer either at the END line or within the additional empty lines. Our analysis is performed in the context of Feynman's model of quantum computation, the only model, to our knowledge, that explicitly includes a physically plausible quantum clocking mechanism in its considerations.
We present some dynamic and entropic considerations about the evolution of a continuous time quantum walk implementing the clock of an autonomous machine. On a simple model, we study in quite explicit terms the Lindblad evolution of the clocked subsystem, relating the evolution of its entropy to the spreading of the wave packet of the clock. We explore possible ways of reducing the generation of entropy in the clocked subsystem, as it amounts to a deficit in the probability of finding the target state of the computation. We are thus led to examine the benefits of abandoning some classical prejudice about how a clocking mechanism should operate.
We present a collection of results about the clock in Feynman's computer construction and Kitaev's local Hamiltonian problem. First, by analyzing the spectra of quantum walks on a line with varying end-point terms, we find a better lower bound on the gap of the Feynman Hamiltonian, which translates into a less strict promise gap requirement for the quantum-Merlin-Arthur--complete local Hamiltonian problem. We also translate this result into the language of adiabatic quantum computation. Second, introducing an idling clock construction with a large state space but fast Cesaro mixing, we provide a way for achieving an arbitrarily high success probability of computation with Feynman's computer with only a logarithmic increase in the number of clock qubits. Finally, we tune and thus improve the costs (locality and gap scaling) of implementing a (pulse) clock with a single excitation.
Feynman's circuit-to-Hamiltonian construction enables the mapping of a quantum circuit to a time-independent Hamiltonian. This model introduces a Hilbert space made from an ancillary clock register tracking the progress of the computation. In this paper, we explore the efficiency, or run time, of a quantum computer that directly implements the clock system. This relates to the model's probability of computation completion which we investigate at an established optimal time for an arbitrary number of gates k . The relationship between the run time of the model and the number of gates is obtained both numerically and analytically to be O ( k 5 / 3 ) . In principle, this is significantly more efficient than the well-investigated Feynman-Kitaev model of adiabatic quantum computation with a run time of O ( k 4 ) . We address the challenge which stems from the small window that exists to capture the optimal stopping time, after which there are rapid oscillations of decreasing probability amplitude. We establish a relationship for the time difference between the first and second maximum which scales as O( k 1 / 3 ).