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.
Generalized Jaynes-Cummings model as a quantum search algorithm
We propose a continuous time quantum search algorithm using a generalization of the Jaynes-Cummings model. In this model the states of the atom are the elements among which the algorithm realizes the search, exciting resonances between the initial and the searched states. This algorithm behaves like Grover's algorithm; the optimal search time is proportional to the square root of the size of the search set and the probability to find the searched state oscillates periodically in time. In this frame, it is possible to reinterpret the usual Jaynes-Cummings model as a trivial case of the quantum search algorithm.
Provably secure time distribution for the electric grid
We demonstrate a quantum time distribution (QTD) method that combines the precision of optical timing techniques with the integrity of quantum key distribution (QKD). Critical infrastructure is dependent on microprocessor- and programmable logic-based monitoring and control systems. The distribution of timing information across the electric grid is accomplished by GPS signals which are known to be vulnerable to spoofing. We demonstrate a method for synchronizing remote clocks based on the arrival time of photons in a modifed QKD system. This has the advantage that the signal can be veried by examining the quantum states of the photons similar to QKD.
Time Evolution in Quantum Cosmology
The quantum description of time evolution in non-linear gravitational systems such as cosmological space-times is not well understood. We show, in the simplified setting of mini-superspace, that time evolution of this system can be obtained using a gauge fixed path integral, as long as one does not integrate over proper time. Using this gauge fixed action we can construct a Hamiltonian in the coherent - or classical - state basis. We show that by construction the coherent states satisfy the classical dynamical equations of General Relativity. They do not satisfy the Hamiltonian constraint. A consequence of this is that the Wheeler-DeWitt equation should not be satisfied in quantum gravity. Classical states have a natural non-trivial time evolution since they are not eigenstates of the Hamiltonian. A general feature of the unconstrained quantum theory of gravity is the prediction of a pressureless dark matter component of either sign energy density in the classical universe which may lead to novel phenomenology.
Simulating strongly correlated molecules with a superconducting quantum processor
Many of the biggest challenges in expanding the nation’s access to clean and low-cost energy resources are fundamentally chemistry or materials challenges. An important case is the development of new catalysts for the up-conversion of cheap and readily available materials such as methane or water into materials suitable for use as a fuel such as methanol or oxygen. To understand and exploit such processes, computer simulations of chemical reactions provide a natural complement to experimental studies. Unfortunately, most catalytic reactions involve so-called “strongly correlated” molecules which are notoriously difficult to study with simulation algorithms that can be executed on existing (classical) computers. The recent growth in quantum information science offers an alternative potential route for simulating these difficult systems. As a result, an increasing number of computational chemists are becoming interested in quantum computing. At the same time, quantum information scientists have identified chemistry simulation as a possible first demonstration of a quantum computer providing an improvement over a classical computer. The objective of this project is to accurately simulate strongly correlated molecules on a quantum processor. To meet the high challenges of this objective, new hybrid quantum/classical algorithms will be co-designed with advanced quantum gate developments and computed on customized quantum hardware. Some of the developed techniques will be transferable to study other molecular systems, while the project as a whole will help define better strategies for advancing the quantum simulation of matter more generally.
Quantum real-time evolution using tensor renormalization group methods
We introduce an approach for approximate real-time evolution of quantum systems using tensor renormalization group (TRG) methods originally developed for imaginary time. We use higher-order TRG to generate a coarse-grained time evolution operator for a 1+1D transverse Ising model with a longitudinal field. We show that the standard tensor norm used for the singular value decomposition-based truncation is degenerate and propose an alternate method to discriminate. We show that it is effective and efficient in evolving Gaussian wave packets for one and two particles in the disordered phase, while ordered phase behavior is more challenging to capture. We compare our algorithm with local simulators for universal quantum computers and discuss possible benchmarking in the near future.
Time operators and time crystals: self-adjointness by topology change
We investigate time operators in the context of quantum time crystals in ring systems. A generalized commutation relation called the generalized weak Weyl relation is used to derive a class of self-adjoint time operators for ring systems with a periodic time evolution: The conventional Aharonov–Bohm time operator is obtained by taking the infinite-radius limit. Then, we discuss the connection between time operators, time crystals and real-space topology. We also reveal the relationship between our time operators and a $ΡΤ$-symmetric time operator. These time operators are then used to derive several energy-time uncertainty relations.
Exact solutions and symmetry analysis for the limiting probability distribution of quantum walks
In the literature, there are numerous studies of one-dimensional discrete-time quantum walks (DTQWs) using a moving shift operator. However, there is no exact solution for the limiting probability distributions of DTQWs on cycles using a general coin or swapping shift operator. In this paper, we derive exact solutions for the limiting probability distribution of quantum walks using a general coin and swapping shift operator on cycles for the first time. Based on the exact solutions, we show how to generate symmetric quantum walks and determine the condition under which a symmetric quantum walk appears. Our results suggest that choosing various coin and initial state parameters can achieve a symmetric quantum walk. By defining a quantity to measure the variation of symmetry, deviation and mixing time of symmetric quantum walks are also investigated.
Deterministic Quantum Trajectory via Imaginary Time Evolution
Stochastic quantum trajectories, such as pure state evolutions under unitary dynamics and random measurements, offer a crucial ensemble description of many-body open system dynamics. Recent studies have highlighted that individual quantum trajectories also encode essential physical information. Prominent examples include measurement-induced phase transitions, where a pure quantum state corresponding to fixed measurement outcomes (trajectories) exhibits distinct entanglement phases, depending on the measurement rate. However, direct observation of this effect is hindered by an exponential postselection barrier, whereby the probability of realizing a specific trajectory is exponentially small. We propose a deterministic method to efficiently prepare quantum trajectories in polynomial time using imaginary time evolution and, thus, overcome this fundamental challenge. Here, we demonstrate that our method applies to a certain class of quantum states, and argue that universal approaches do not exist for any quantum trajectories. Our result paves the way for experimentally exploring the physics of individual quantum trajectories at scale and enables direct observation of certain postselection-dependent phenomena.
Simulations of two-particle interactions with 2D quantum walks in time
We present the experimental implementation of a quantum walk on a two-dimensional lattice and show how to employ the optical system to simulate the quantum propagation of two interacting particles. Our quantum walk in time transfers the spatial spread of a quantum walk into the time domain, which guarantees a high stability and scalability of the setup. We present with our device quantum walks over 12 steps on a 2D lattice. By changing the properties of the driving quantum coin, we investigate different kinds of two-particle interactions and reveal their impact on the occurring quantum propagation.
Implementation of quantum key distribution and quantum clock synchronization via time bin encoding
Quantum key distribution allows for a provably secure transmission of cryptographic keys over an optical channel. Encoded polarization states or time-bin degree of freedom have been used for successful demonstrations. However, photon losses in long fibers, slow single photon detectors, and detector dark counts significantly limit the overall bit rate. Improving key throughput and reducing the overhead of key reconciliation remain as major challenges. Methods which utilize multiple time bins allow for multiple key bits to be encoded in a single photon, thus increasing the fidelity of transmitted keys and decreasing the overhead of key reconciliation in real-world conditions. Previous implementations of these methods required that Alice and Bob share a time reference by sharing a dedicated classical channel used for synchronization. This work presents a technique that allows two parties to exchange time-bin encoded photons without the need for synchronized time references. Our technique uses a framing protocol which allows Alice to encode a time reference along with a key which is determined by Alice before transmission. Security can be achieved by monitoring the visibility of a pair of Franson interferometers, using decoy pulses and measuring the round trip time between Alice and Bob. The bit rate of this technique is limited only by the recovery time of the detector and the speed of the modulation electronics. We experimentally demonstrate a raw bit rate of 5Mb/s over an optical channel with 55dB of loss, which is competitive with current research. We also demonstrate absolute timing synchronization with an accuracy of 20ps.
On the accuracy of the noninteracting electron approximation for vibrationally coupled electron transport
The accuracy of the noninteracting electron approximation is examined for a model of vibrationally coupled electron transport in single molecule junction. In the absence of electronic-vibrational coupling, steady state transport in this model is described exactly by Landauer theory. Including coupling, both electronic-vibrational and vibrationally induced electron–electron correlation effects may contribute to the real time quantum dynamics. Using the multilayer multiconfiguration time-dependent Hartree (ML-MCTDH) theory to describe nuclear dynamics exactly while maintaining the noninteracting electron approximation for the electronic dynamics, the correlation effects are analyzed in different physical regimes. Here, it is shown that although the noninteracting electron approximation may be reasonable for describing short time dynamics, it does not give the correct long time limit for certain initial conditions.
Quantum dynamics simulation of the advection-diffusion equation
The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 −5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.
Coherent electronic-vibrational dynamics in deuterium bromide probed via attosecond transient-absorption spectroscopy
Ultrafast laser excitation can trigger multiplex coherent dynamics in molecules. Here, we report attosecond transient-absorption experiments addressing simultaneous probing of electronic and vibrational dynamics in a prototype molecule, deuterium bromide (DBr), following its strong-field ionization. Electronic and vibrational coherences in the ionic X$^2\Pi_{3/2}$ and X$^2\Pi_{1/2}$ states are characterized in the Br-$3d$ core-level absorption spectra via quantum beats with 12.6-fs and 19.9-fs periodicities, respectively. Polarization scans reveal that the phase of the electronic quantum beats depends on the probe direction, experimentally showing that the coherent electronic motion corresponds to the oscillation of the hole density along the ionization-field direction. The vibrational quantum beats are found to maintain a relatively constant amplitude, whereas the electronic quantum beats exhibit a partial decrease in time. Quantum wave-packet simulations show that the decoherence effect from the vibrational motion is insignificant because of the parallel relation between the X$^2\Pi_{3/2}$ and X$^2\Pi_{1/2}$ potentials. Finally, a comparison between the DBr and HBr results suggests that rotation motion is responsible for the decoherence since it leads to initial alignment prepared by the strong-field ionization.
Quantum snake walk on graphs
I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, which asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.
Authentication Protocol using Quantum Superposition States
When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.
Entropy production of doubly stochastic quantum channels
We study the entropy increase of quantum systems evolving under primitive, doubly stochastic Markovian noise and thus converging to the maximally mixed state. This entropy increase can be quantified by a logarithmic-Sobolev constant of the Liouvillian generating the noise. We prove a universal lower bound on this constant that stays invariant under taking tensor-powers. Our methods involve a new comparison method to relate logarithmic-Sobolev constants of different Liouvillians and a technique to compute logarithmic-Sobolev inequalities of Liouvillians with eigenvectors forming a projective representation of a finite abelian group. Our bounds improve upon similar results established before and as an application we prove an upper bound on continuous-time quantum capacities. In the last part of this work we study entropy production estimates of discrete-time doubly stochastic quantum channels by extending the framework of discrete-time logarithmic-Sobolev inequalities to the quantum case.
Accelerated impurity solver for DMFT and its diagrammatic extensions
Here, we present ComCTQMC, a GPU accelerated quantum impurity solver. It uses the continuous-time quantum Monte Carlo (CTQMC) algorithm wherein the partition function is expanded in terms of the hybridisation function (CT-HYB). ComCTQMC supports both partition and worm-space measurements, and it uses improved estimators and the reduced density matrix to improve observable measurements whenever possible. ComCTQMC efficiently measures all one and two-particle Green's functions, all static observables which commute with the local Hamiltonian, and the occupation of each impurity orbital. ComCTQMC can solve complex-valued impurities with crystal fields that are hybridized to both fermionic and bosonic baths. Most importantly, ComCTQMC utilizes graphical processing units (GPUs), if available, to dramatically accelerate the CTQMC algorithm when the Hilbert space is sufficiently large. We demonstrate acceleration by a factor of over 600 (100) in a simulation of δ-Pu at 600 K with (without) crystal fields. In easier problems, the GPU offers less impressive acceleration or even decelerates the CTQMC. Here we describe the theory, algorithms, and structure used by ComCTQMC in order to achieve this set of features and level of acceleration.