Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 181 records · Page 10

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.

encryption↗

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.

74 ATOMIC AND MOLECULAR PHYSICS↗

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.

Alipanah, Hirad [Univ. of Pittsburgh, PA (United S↗

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.

74 ATOMIC AND MOLECULAR PHYSICS↗

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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.

97 MATHEMATICS AND COMPUTING↗

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal waveform estimation for classical and quantum systems via time-symmetric smoothing. II. Applications to atomic magnetometry and Hardy's paradox

The time-symmetric quantum smoothing theory [Tsang, Phys. Rev. Lett. 102, 250403 (2009); Phys. Rev. A 80, 033840 (2009)] is extended to account for discrete jumps in the classical random process to be estimated, discrete variables in the quantum system, such as spin, angular momentum, and photon number, and Poisson measurements, such as photon counting. The extended theory is used to model atomic magnetometers and study Hardy's paradox in phase space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Decoherence in a one-dimensional quantum walk

In this article we study decoherence in the discrete-time quantum walk on the line. We generalize the method of decoherent coin quantum walk, introduced by Brun et al. [Phys. Rev. A 67, 32304 (2003)]. Our analytical expressions are applicable for all kinds of decoherence. As an example of the coin-position decoherence, we study the broken line quantum walk and compare our results with the numerical one. We also show that our analytical results reduce to the Brun formalism when only the coin is subjected to decoherence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum-walk approach to searching on fractal structures

We study continuous-time quantum walks mimicking the quantum search based on Grover's procedure. This allows us to consider structures, that is, databases, with arbitrary topological arrangements of their entries. We show that the topological structure of the database plays a crucial role by analyzing, both analytically and numerically, the transition from the ground to the first excited state of the Hamiltonian associated with different (fractal) structures. Additionally, we use the probability of successfully finding a specific target as another indicator of the importance of the topological structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accurate numerical verification of the instanton method for macroscopic quantum tunneling: Dynamics of phase slips

We study the quantum dynamics of supercurrents of one-dimensional Bose gases in a ring optical lattice to verify instanton methods applied to coherent macroscopic quantum tunneling (MQT). We directly simulate the real-time quantum dynamics of supercurrents, where a coherent oscillation between two macroscopically distinct current states occurs due to MQT. The tunneling rate extracted from the coherent oscillation is compared with that given by the instanton method. We find that the instanton method is quantitatively accurate when the effective Planck's constant is sufficiently small. We also find phase slips associated with the oscillations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient quantum circuits for Szegedy quantum walks

A major advantage in using Szegedy’s formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm. - Highlights: • A general theoretical framework for implementing Szegedy walks using quantum circuits. • Explicit efficient quantum circuit implementation of the Szegedy walk for several classes of graphs. • Efficient implementation of Szegedy walks for quantum page-ranking of a certain class of graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recurrences in three-state quantum walks on a plane

We analyze the role of dimensionality in the time evolution of discrete-time quantum walks through the example of the three-state walk on a two-dimensional triangular lattice. We show that the three-state Grover walk does not lead to trapping (localization) or recurrence to the origin, in sharp contrast to the Grover walk on the two-dimensional square lattice. We determine the power-law scaling of the probability at the origin with the method of stationary phase. We prove that only a special subclass of coin operators can lead to recurrence, and there are no coins that lead to localization. The propagation for the recurrent subclass of coins is quasi-one dimensional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convergence of quantum random walks with decoherence

In this paper, we study the discrete-time quantum random walks on a line subject to decoherence. The convergence of the rescaled position probability distribution p(x,t) depends mainly on the spectrum of the superoperator L{sub kk}. We show that if 1 is an eigenvalue of the superoperator with multiplicity one and there is no other eigenvalue whose modulus equals 1, then P(({nu}/{radical}(t)),t) converges to a convex combination of normal distributions. In terms of position space, the rescaled probability mass function p{sub t}(x,t){identical_to}p({radical}(t)x,t), x is an element of Z/{radical}(t), converges in distribution to a continuous convex combination of normal distributions. We give a necessary and sufficient condition for a U(2) decoherent quantum walk that satisfies the eigenvalue conditions. We also give a complete description of the behavior of quantum walks whose eigenvalues do not satisfy these assumptions. Specific examples such as the Hadamard walk and walks under real and complex rotations are illustrated. For the O(2) quantum random walks, an explicit formula is provided for the scaling limit of p(x,t) and their moments. We also obtain exact critical exponents for their moments at the critical point and show universality classes with respect to these critical exponents.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Limit theorems for quantum walks associated with Hadamard matrices

We study a one-parameter family of discrete-time quantum walk models on Z and Z{sup 2} associated with the Hadamard walk. Weak convergence in the long-time limit of all moments of the walker's pseudovelocity on Z and Z{sup 2} is proved. Symmetrization on Z and Z{sup 2} is theoretically investigated, leading to the resolution of the Konno-Namiki-Soshi conjecture in the special case of symmetrization of the unbiased Hadamard walk on Z. A necessary condition for the existence of a phenomenon known as localization is given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantumness in a decoherent quantum walk using measurement-induced disturbance

The classicalization of a decoherent discrete-time quantum walk on a line or an n-cycle can be demonstrated in various ways that do not necessarily provide a geometry-independent description. For example, the position probability distribution becomes increasingly Gaussian, with a concomitant fall in the standard deviation, in the former case, but not in the latter. As another example, each step of the quantum walk on a line may be subjected to an arbitrary phase gate, without affecting the position probability distribution, no matter whether the walk is noiseless or noisy. This symmetry, which is absent in the case of noiseless cyclic walk, but is restored in the presence of sufficient noise, serves as an indicator of classicalization, but only in the cyclic case. Here we show that the degree of quantum correlations between the coin and position degrees of freedom, quantified by a measure based on the disturbance induced by local measurements [Luo, Phys. Rev. A 77, 022301 (2008)], provides a suitable measure of classicalization across both type of walks. Applying this measure to compare the two walks, we find that cyclic quantum walks tend to classicalize faster than quantum walks on a line because of more efficient phase randomization due to the self-interference of the two counter-rotating waves. We model noise as acting on the coin, and given by the squeezed generalized amplitude damping (SGAD) channel, which generalizes the generalized amplitude damping channel.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗