Search NASA⌕ Search

Engineering topics

Wu, Yantao

Publications and source records attributed to Wu, Yantao.

Evidence for the utility of quantum computing before fault tolerance

Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications.

97 MATHEMATICS AND COMPUTING↗

Two-dimensional isometric tensor networks on an infinite strip

The exact contraction of a generic two-dimensional (2D) tensor network state (TNS) is known to be exponentially hard, making simulation of 2D systems difficult. The recently introduced class of isometric TNS (isoTNS) represents a subset of TNS that allows for efficient simulation of such systems on finite square lattices. The isoTNS ansatz requires the identification of an “orthogonality column” of tensors, within which one-dimensional matrix product state (MPS) methods can be used for calculation of observables and optimization of tensors. Here we extend isoTNS to infinitely long strip geometries and introduce an infinite version of the Moses Move algorithm for moving the orthogonality column around the network. Using this algorithm, we iteratively transform an infinite MPS representation of a 2D quantum state into a strip isoTNS and investigate the entanglement properties of the resulting state. In addition, we demonstrate that the local observables can be evaluated efficiently. Lastly, we introduce an infinite time-evolving block decimation algorithm (iTEBD 2 ) and use it to approximate the ground state of the 2D transverse field Ising model on lattices of infinite strip geometry.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers

We reformulate the continuous-space Schrödinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. A binary encoding of position produces a spin-1/2 Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code (BRGC), and a Hamming-distance-2 Gray code (H2GC) reduces the model complexity down to the 𝑋⁢𝑍 and transverse Ising model, respectively. For 𝐴 qubits BRGC yields 2 𝐴 positions and is reduced to its 2-local form with O⁡(𝐴) ancillary qubits. H2GC yields 2 𝐴/2+1 positions with O⁡(𝐴 2 ) three-local penalty terms. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of 𝑘 -local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic evolution is protected by the infrared cutoff of the system. As a result, initial state preparation from a free-field wave function to an interacting system is expected to exhibit polynomial time complexity with volume and constant scaling with respect to lattice discretization for all encodings. For H2GC, if the evolution starts with the transverse Hamiltonian due to hardware restrictions, then penalties are dynamically introduced such that the low-lying spectrum reproduces the energy levels of the Laplacian. The adiabatic evolution of the penalty Hamiltonian is therefore sensitive to the ultraviolet scale. It is expected to exhibit polynomial time complexity with lattice discretization, or exponential time complexity with respect to the number of qubits given a fixed volume.

97 MATHEMATICS AND COMPUTING↗

Time-dependent variational principle for mixed matrix product states in the thermodynamic limit

Here, we describe a time evolution algorithm for quantum spin chains whose Hamiltonians are composed of an infinite uniform left and right bulk part, and an arbitrary finite region in between. The left and right bulk parts are allowed to be different from each other. The algorithm is based on the time-dependent variational principle (TDVP) of matrix product states. It is inversion-free and very simple to adapt from an existing TDVP code for finite systems. The importance of working in the projective Hilbert space is highlighted. We study the quantum Ising model as a benchmark and an illustrative example. The spread of information after a local quench is studied in both the ballistic and the diffusive case. We also offer a derivation of TDVP directly from symplectic geometry.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Continuous-time Monte Carlo renormalization group

We implement the Monte Carlo renormalization group approach in the continuous-time Monte Carlo simulation of a quantum system. In this work, we demonstrate numerically the emergent isotropy between space and time at large distances for the systems that exhibit Lorentz invariance at quantum criticality. Here, this allows us to estimate accurately the sound velocity for these quantum systems. $\textit{Q}$-state Potts models in one and two space dimensions are used to illustrate the method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamical quantum phase transitions of quantum spin chains with a Loschmidt-rate critical exponent equal to $\frac{1}{2}$

In this work, we describe a new universality class of dynamical quantum phase transitions of the Loschmidt amplitude of quantum spin chains off equilibrium criticality. We demonstrate that in many cases it is possible to change the conventional linear singularity of the Loschmidt rate function into a smooth peak by tuning one parameter of the quench protocol. Exactly at the point when this change-over occurs, the singularity of the Loschmidt rate function persists, with a critical exponent equal to $\frac{1}{2}$. The nonequilibrium renormalization group fixed point controlling this universality class is described. An asymptotically exact renormalization group recursion relation is derived around this fixed point to obtain the critical exponent.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Nonequilibrium renormalization group fixed points of the quantum clock chain and the quantum Potts chain

In this work, we derive an exact renormalization group recursion relation for the Loschmidt amplitude of the quantum Q-state clock model and the quantum Q-state Potts model in one dimension. The renormalization group flow is discussed in detail. The fixed points of the renormalization group flow are found to be complex in general. These fixed points control the dynamical phases of the two models, giving rise to nonanalyticities in its Loschmidt rate function, for both the pure and the disordered system. For the quench protocols studied, dynamical quantum phase transitions are found to occur in the clock model for all Qs considered, while in the Potts model, they only occur when Q < 4 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Determination of the critical manifold tangent space and curvature with Monte Carlo renormalization group

We show that the critical manifold of a statistical mechanical system in the vicinity of a critical point is locally accessible through correlation functions at that point. A practical numerical method is presented to determine the tangent space and the curvature to the critical manifold with variational Monte Carlo renormalization group. Because of the use of a variational bias potential of the coarse-grained variables, critical slowing down is greatly alleviated in the Monte Carlo simulation. In addition, this method is free of truncation error. Furthermore, we study the isotropic Ising model on square and cubic lattices, the anisotropic Ising model, and the tricritical Ising model on square lattices to illustrate the method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tangent space to the manifold of critical classical Hamiltonians representable by tensor networks

We introduce a scheme to perform Monte Carlo renormalization group with the coupling constants of the system Hamiltonian encoded in a tensor network. Furthermore, with this scheme we compute the tangent space to the manifold of the critical Hamiltonians representable by a tensor network at the nearest-neighbor critical coupling for three models: the two- and three-dimensional Ising models and the two-dimensional three-state Potts model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational Approach to Monte Carlo Renormalization Group

We present a Monte Carlo method for computing the renormalized coupling constants and the critical exponents within renormalization theory. The scheme, which derives from a variational principle, overcomes critical slowing down, by means of a bias potential that renders the coarse grained variables uncorrelated. Here, the two-dimensional Ising model is used to illustrate the method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗