Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum time”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

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 𝑁 different times of many-body systems by only using log⁡(𝑁) 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 𝒪⁡(log⁡(𝑁)⁢𝑛). 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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bound on quantum computation time: Quantum error correction in a critical environment

We obtain an upper bound on the time available for quantum computation for a given quantum computer and decohering environment with quantum error correction implemented. First, we derive an explicit quantum evolution operator for the logical qubits and show that it has the same form as that for the physical qubits but with a reduced coupling strength to the environment. Using this evolution operator, we find the trace distance between the real and ideal states of the logical qubits in two cases. For a super-Ohmic bath, the trace distance saturates, while for Ohmic or sub-Ohmic baths, there is a finite time before the trace distance exceeds a value set by the user.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gapless Dirac Electron Mobility and Quantum Time in HgTe Quantum Wells

The mobility and quantum time of Dirac electrons in HgTe quantum wells with near-critical thickness corresponding to the transition from the direct to inverted spectrum are experimentally and theoretically investigated. The nonmonotonic dependence of the mobility on the electron concentration is experimentally established. The theory of the scattering of Dirac electrons by impurities and irregularities of the well boundaries leading to well thickness fluctuations is constructed. The comparison of this theory with an experiment shows their good agreement and explains the observed nonmonotonic behavior by a decrease in the ratio between the de Broglie wavelength of Dirac electrons and the characteristic size of irregularities with increasing electron concentration. It is established that the transport time is larger than the quantum time by almost an order of magnitude in the case of the dominance of roughness scattering. The transition from macroscopic to mesoscopic samples is studied and an abrupt decrease in both the mobility and quantum time is observed. This behavior is attributed to the size effect on the free path length.

36 MATERIALS SCIENCE↗

Can the ring polymer molecular dynamics method be interpreted as real time quantum dynamics?

The ring polymer molecular dynamics (RPMD) method has gained popularity in recent years as a simple approximation for calculating real time quantum correlation functions in condensed media. However, the extent to which RPMD captures real dynamical quantum effects and why it fails under certain situations have not been clearly understood. Addressing this issue has been difficult in the absence of a genuine justification for the RPMD algorithm starting from the quantum Liouville equation. To this end, a new and exact path integral formalism for the calculation of real time quantum correlation functions is presented in this work, which can serve as a rigorous foundation for the analysis of the RPMD method as well as providing an alternative derivation of the well established centroid molecular dynamics method. The new formalism utilizes the cyclic symmetry of the imaginary time path integral in the most general sense and enables the expression of Kubo-transformed quantum time correlation functions as that of physical observables pre-averaged over the imaginary time path. Upon filtering with a centroid constraint function, the formulation results in the centroid dynamics formalism. Upon filtering with the position representation of the imaginary time path integral, we obtain an exact quantum dynamics formalism involving the same variables as the RPMD method. The analysis of the RPMD approximation based on this approach clarifies that an explicit quantum dynamical justification does not exist for the use of the ring polymer harmonic potential term (imaginary time kinetic energy) as implemented in the RPMD method. It is analyzed why this can cause substantial errors in nonlinear correlation functions of harmonic oscillators. Such errors can be significant for general correlation functions of anharmonic systems. We also demonstrate that the short time accuracy of the exact path integral limit of RPMD is of lower order than those for finite discretization of path. The present quantum dynamics formulation also serves as the basis for developing new quantum dynamical methods that utilize the cyclic nature of the imaginary time path integral.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal quantum computation using the discrete-time quantum walk

A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501 (2009)]. We present a version based instead on the discrete-time quantum walk. We show that the discrete-time quantum walk is able to implement the same universal gate set and thus both discrete and continuous-time quantum walks are computational primitives. Additionally, we give a set of components on which the discrete-time quantum walk provides perfect state transfer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum space, quantum time, and relativistic quantum mechanics

We treat space and time as bona fide quantum degrees of freedom on an equal footing in Hilbert space. Motivated by considerations in quantum gravity, we focus on a paradigm dealing with linear, first-order Hamiltonian and momentum constraints that lead to emergent features of temporal and spatial translations. Unlike the conventional treatment, we show that Klein-Gordon and Dirac equations in relativistic quantum mechanics can be unified in our paradigm by applying relativistic dispersion relations to eigenvalues rather than treating them as operator-valued equations. With time and space being treated on an equal footing in Hilbert space, we show symmetry transformations to be implemented by unitary basis changes in Hilbert space, giving them a stronger quantum mechanical footing. Global symmetries, such as Lorentz transformations, modify the decomposition of Hilbert space; and local symmetries, such as U(1) gauge symmetry are diagonal in coordinate basis and do not alter the decomposition of Hilbert space. Here, we briefly discuss extensions of this paradigm to quantum field theory and quantum gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real time quantum dynamics preaveraged over imaginary time path integral: A formal basis for both Centroid Molecular Dynamics and Ring Polymer Molecular Dynamics

An exact real time quantum dynamics preaveraged over imaginary time path integral is formulated for general condensed phase equilibrium ensemble. This formulation results in the well-known centroid dynamics approach upon filtering of centroid constraint, and provides a rigorous framework to understand and analyze a related quantum dynamics approximation method called ring polymer molecular dynamics. The formulation also serves as the basis for developing new kinds of quantum dynamics that utilize the cyclic nature of the imaginary time path integral.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. Further, we also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Action principles for quantum automata and Lorentz invariance of discrete time quantum walks

A discrete action principle for general quantum automata is proposed. This action principle is particularized to Discrete Time Quantum Walks (DTQWs) and then extended into an energy and momentum preserving, manifestly covariant formulation. Space–time coordinates are introduced as new variables of the action and their equations of motion enforce energy and momentum conservation. This guarantees that the proposed action can be used to build future, DTQW-based self-consistent models of spinors interacting with gauge fields. A discrete stress–energy tensor for the DTQW is also obtained. The manifest covariance of the formulation highlights the special role played by the grid reference frame in the DTQW dynamics. The main discussion is complemented by three appendices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discrete-time quantum walk approach to state transfer

We show that a quantum-state transfer, previously studied as a continuous-time process in networks of interacting spins, can be achieved within the model of discrete-time quantum walks with a position-dependent coin. We argue that, due to additional degrees of freedom, discrete-time quantum walks allow one to observe effects which cannot be observed in the corresponding continuous-time case. First, we study a discrete-time version of the engineered coupling protocol due to Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and then we discuss the general idea of conversion between continuous-time quantum walks and discrete-time quantum walks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous-time quantum walks on star graphs

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K{sub 2} graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

From Quantum Time to Manifestly Covariant QFT: On the Need for a Quantum-Action-Based Quantization

In quantum time (QT) schemes, time is promoted to a degree of freedom, allowing Lorentz covariance to be made explicit for single particles. We ask whether this can be lifted to QFT so that Lorentz covariance becomes manifest at the Hilbert-space level, rather than being hidden as in the standard canonical formulation. We address this question by proposing a second-quantized approach in which the elementary particle is the QT particle itself, leading naturally to the notion of spacetime field algebras and of quantum action. We show, however, that a naive many-body construction runs into inconsistencies. To pinpoint their origin we introduce a classical counterpart of the second-quantized formalism, spacetime classical mechanics (SCM), and prove a no-go theorem: Dirac quantization of SCM collapses back to standard QFT and therefore hides covariance. We circumvent this problem by presenting a quantum-action-based quantization that yields a spacetime version of quantum mechanics (SQM), making covariance manifest for (interacting) QFTs. Finally, we show that this resolution is tied to a genuine spacetime generalization of the notion of a quantum state, required by causality and closely connected to recent “states over time” proposals and, in dS/CFT–motivated settings, to microscopic notions of timelike entanglement and emergent time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Space-Time Quantum Metasurfaces

Metasurfaces have recently entered the realm of quantum photonics, enabling manipulation of quantum light using a compact nanophotonic platform. Realizing the full potential of metasurfaces at the deepest quantum level requires the ability to tune coherent light-matter interactions continuously in space and time. Here, we introduce the concept of space-time quantum metasurfaces for arbitrary control of the spectral, spatial, and spin properties of nonclassical light using a compact photonic platform. We show that space-time quantum metasurfaces allow on-demand tailoring of entanglement among all degrees of freedom of a single photon. We also show that spatiotemporal modulation induces asymmetry at the fundamental level of quantum fluctuations, resulting in the generation of steered and vortex photon pairs out of vacuum. Space-time quantum metasurfaces have the potential to enable novel photonic functionalities, such as encoding quantum information into high-dimensional color qudits using designer modulation protocols, sculpting multispectral and multispatial modes in spontaneous emission, and generating reconfigurable hyperentanglement for high-capacity quantum communications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparing Algorithms for Graph Isomorphism Using Discrete- and Continuous-Time Quantum Random Walks

Berry and Wang [Phys. Rev. A 83, 042317 (2011)] show numerically that a discrete-time quan- tum random walk of two noninteracting particles is able to distinguish some non-isomorphic strongly regular graphs from the same family. Here we analytically demonstrate how it is possible for these walks to distinguish such graphs, while continuous-time quantum walks of two noninteracting parti- cles cannot. We show analytically and numerically that even single-particle discrete-time quantum random walks can distinguish some strongly regular graphs, though not as many as two-particle noninteracting discrete-time walks. Additionally, we demonstrate how, given the same quantum random walk, subtle di erences in the graph certi cate construction algorithm can nontrivially im- pact the walk's distinguishing power. We also show that no continuous-time walk of a xed number of particles can distinguish all strongly regular graphs when used in conjunction with any of the graph certi cates we consider. We extend this constraint to discrete-time walks of xed numbers of noninteracting particles for one kind of graph certi cate; it remains an open question as to whether or not this constraint applies to the other graph certi cates we consider.

97 MATHEMATICS AND COMPUTING↗

Quantum time dynamics employing the Yang-Baxter equation for circuit compression

Quantum time dynamics (QTD) is considered a promising problem for quantum supremacy on near-term quantum computers. However, QTD quantum circuits grow with increasing time simulations. This study focuses on simulating the time dynamics of one-dimensional (1D) integrable spin chains with nearest-neighbor interactions. We have proved the existence of a reflection symmetry in the quantum circuit employed for simulating the time evolution of certain classes of 1D Heisenberg model Hamiltonians by virtue of the quantum Yang-Baxter equation, and how this symmetry can be exploited to compress and produce a shallow quantum circuit. With this compression scheme, the depth of the quantum circuit becomes independent of step size and only depends on the number of spins. We show that the depth of the compressed circuit is rigorously a linear function of the system size for the studied Heisenberg model Hamiltonians in the present work. As a consequence, the number of CNOT gates in the compressed circuit only scales quadratically with the system size, which allows for the simulations of time dynamics of very large 1D spin chains. We derive the compressed circuit representations for different special cases of the Heisenberg Hamiltonian. We compare and demonstrate the effectiveness of this approach by performing simulations on quantum computers.

1-dimensional spin chains↗

Framework for discrete-time quantum walks and a symmetric walk on a binary tree

We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2, on which this is based. The framework has no need for coin spaces, it imposes no constraints on the evolution operator other than unitarity, and is unifying of other approaches. As an example we construct a symmetric discrete-time quantum walk on the semi-infinite binary tree. The generating function of the amplitude at the root is computed in closed form, as a function of time and the initial level n in the tree, and we find the asymptotic and a full numerical solution for the amplitude. It exhibits a sharp interference peak and a power-law tail, as opposed to the exponentially decaying tail of a broadly peaked distribution of the classical symmetric random walk on a binary tree. The probability peak is orders of magnitude larger than it is for the classical walk (already at small n). The quantum walk shows a polynomial algorithmic speedup in n over the classical walk, which we conjecture to be of the order 2/3, based on strong trends in data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous-time quantum walks on dynamic graphs

Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an ordered sequence of graphs governs free evolution of the quantum walk. We then consider how perfect state transfer during the quantum walk can be used to design dynamic graphs that implement a universal set of quantum logic gates. We give explicit examples for a complete logical basis, and we validate implementations using numerical simulations for quantum teleportation and addition circuits. Lastly, we discuss the potential for realizing CTQWs on dynamic graphs using actively controlled quantum optical waveguides.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗