Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mi>N</a:mi></a:math> different times of many-body systems by only using <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"><b:mrow><b:mo form="prefix">log</b:mo><b:mo>(</b:mo><b:mi>N</b:mi><b:mo>)</b:mo></b:mrow></b:math> clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as <d:math xmlns:d="http://www.w3.org/1998/Math/MathML"><d:mrow><d:mi mathvariant="script">O</d:mi><d:mo>(</d:mo><d:mo form="prefix">log</d:mo><d:mo>(</d:mo><d:mi>N</d:mi><d:mo>)</d:mo><d:mi>n</d:mi><d:mo>)</d:mo></d:mrow></d:math>. As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

Authors

Institutions

Publication Details

Journal
Physical Review Research
Published
2025-09-29
DOI
https://doi.org/10.1103/wpnf-4nnn
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Parallel-in-time quantum simulation via Page and Wootters quantum time

Paolo Braccia, N. L. Diaz, R. Rossignoli, M. Cerezo et al.
2 citations
Physical Review Research
Quantum Computing Algorithms and Architecture
4.96
article

Parallel-in-time quantum simulation via Page and Wootters quantum time

Paolo Braccia, N. L. Diaz, R. Rossignoli, M. Cerezo, Martín Larocca, J. M. Matera
article en
2 citations

Abstract

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mi>N</a:mi></a:math> different times of many-body systems by only using <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"><b:mrow><b:mo form="prefix">log</b:mo><b:mo>(</b:mo><b:mi>N</b:mi><b:mo>)</b:mo></b:mrow></b:math> clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as <d:math xmlns:d="http://www.w3.org/1998/Math/MathML"><d:mrow><d:mi mathvariant="script">O</d:mi><d:mo>(</d:mo><d:mo form="prefix">log</d:mo><d:mo>(</d:mo><d:mi>N</d:mi><d:mo>)</d:mo><d:mi>n</d:mi><d:mo>)</d:mo></d:mrow></d:math>. As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

Physical Review ResearchVol. 7(3)
Los Alamos National Laboratory (US), Instituto de Física La Plata (AR), Comisión de Investigaciones Científicas (AR), Istituto Nazionale di Fisica Nucleare, Sezione di Firenze (IT)
Openalex Percentile: Top 5%
Quantum Computing Algorithms and Architecture
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.