arXiv subjects

Andrew Sornborger

Publications and source records attributed to Andrew Sornborger.

26 records · Page 2Linked to original sources

arXiv2021

Quantum simulation of operator spreading in the chaotic Ising model

There is great interest in using near-term quantum computers to simulate and study foundational problems in quantum mechanics and quantum information science, such as the scrambling measured by an out-of-time-ordered correlator (OTOC). Here we use an IBM Q processor, quantum error mitigation, and weaved Trotter simulation to study high-resolution operator spreading in a 4-spin Ising model as a function of space, time, and integrability. Reaching 4 spins while retaining high circuit fidelity is made possible by the use of a physically motivated fixed-node variant of the OTOC, allowing scrambling to be estimated without overhead. We find clear signatures of ballistic operator spreading in a chaotic regime, as well as operator localization in an integrable regime. The techniques developed and demonstrated here open up the possibility of using cloud-based quantum computers to study and visualize scrambling phenomena, as well as quantum information dynamics more generally.

quant-ph↗

arXiv2021

Experimental Quantum Learning of a Spectral Decomposition

Currently available quantum hardware allows for small scale implementations of quantum machine learning algorithms. Such experiments aid the search for applications of quantum computers by benchmarking the near-term feasibility of candidate algorithms. Here we demonstrate the quantum learning of a two-qubit unitary by a sequence of three parameterized quantum circuits containing a total of 21 variational parameters. Moreover, we variationally diagonalize the unitary to learn its spectral decomposition, i.e., its eigenvalues and eigenvectors. We illustrate how this can be used as a subroutine to compress the depth of dynamical quantum simulations. One can view our implementation as a demonstration of entanglement-enhanced machine learning, as only a single (entangled) training data pair is required to learn a 4x4 unitary matrix.

quant-ph↗

arXiv2020

Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time

Trotterization-based, iterative approaches to quantum simulation are restricted to simulation times less than the coherence time of the quantum computer, which limits their utility in the near term. Here, we present a hybrid quantum-classical algorithm, called Variational Fast Forwarding (VFF), for decreasing the quantum circuit depth of quantum simulations. VFF seeks an approximate diagonalization of a short-time simulation to enable longer-time simulations using a constant number of gates. Our error analysis provides two results: (1) the simulation error of VFF scales at worst linearly in the fast-forwarded simulation time, and (2) our cost function's operational meaning as an upper bound on average-case simulation error provides a natural termination condition for VFF. We implement VFF for the Hubbard, Ising, and Heisenberg models on a simulator. Additionally, we implement VFF on Rigetti's quantum computer to demonstrate simulation beyond the coherence time. Finally, we show how to estimate energy eigenvalues using VFF.

quant-ph↗

arXiv2020

Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation

Dynamical quantum simulation may be one of the first applications to see quantum advantage. However, the circuit depth of standard Trotterization methods can rapidly exceed the coherence time of noisy quantum computers. This has led to recent proposals for variational approaches to dynamical simulation. In this work, we aim to make variational dynamical simulation even more practical and near-term. We propose a new algorithm called Variational Hamiltonian Diagonalization (VHD), which approximately transforms a given Hamiltonian into a diagonal form that can be easily exponentiated. VHD allows for fast forwarding, i.e., simulation beyond the coherence time of the quantum computer with a fixed-depth quantum circuit. It also removes Trotterization error and allows simulation of the entire Hilbert space. We prove an operational meaning for the VHD cost function in terms of the average simulation fidelity. Moreover, we prove that the VHD cost function does not exhibit a shallow-depth barren plateau, i.e., its gradient does not vanish exponentially. Our proof relies on locality of the Hamiltonian, and hence we connect locality to trainability. Our numerical simulations verify that VHD can be used for fast-forwarding dynamics.

quant-ph↗

arXiv1999

Long-Lived Localized Field Configurations in Small Lattices: Application to Oscillons

Long-lived localized field configurations such as breathers, oscillons, or more complex objects naturally arise in the context of a wide range of nonlinear models in different numbers of spatial dimensions. We present a numerical method, which we call the {\it adiabatic damping method}, designed to study such configurations in small lattices. Using 3-dimensional oscillons in $ϕ^4$ models as an example, we show that the method accurately (to a part in 10^5 or better) reproduces results obtained with static or dynamically expanding lattices, dramatically cutting down in integration time. We further present new results for 2-dimensional oscillons, whose lifetimes would be prohibitively long to study with conventional methods.

patt-sol↗

arXiv1999

On the Interaction of Monopoles and Domain Walls

We study the interaction between monopoles and embedded domain walls in a O(3) linear sigma model. We discover that there is an attractive force between the monopole and the wall. We provide evidence that after the monopole and domain wall collide, the monopole unwinds on the wall, and that the winding number spreads out on the surface. These results support the suggestion by Dvali et al. (hep-ph/9710301) that the monopole problem can be solved by monopole-domain wall interactions.

hep-ph↗

arXiv1997

Persistence Amplitudes from Numerical Quantum Gravity

The Euclidean quantum amplitude to go between data specified on an initial and a final hypersurface may be approximated by the tree amplitude exp(-I_{classical}/\hbar), where I_{classical} is the Euclidean action of the classical solution joining the initial and final data. In certain cases the tree amplitude is exact. We study I_{classical} hence the quantum amplitude, in the case of a spherically symmetric Riemannian gravitational field coupled to a spherically symmetric scalar field. The classical scalar field obeys an elliptic equation, which we solve using relaxation techniques, in conjunction with the field equations giving the gravitational field. An example of the transition from linearity to non-linearity is presented and power law behavior of the action is demonstrated.

gr-qc↗

arXiv1997

The Collapse of Exotic Textures

The ordering of scalar fields after a phase transition in which a group $G$ of global symmetries is spontaneously broken to a subgroup $H$ provides a possible explanation for the origin of structure in the universe, as well as leading to observable effects in condensed matter systems. The field dynamics can depend in principle on the geometry and topology of the vacuum manifold G/H; for example, texture configurations which collapse and unwind will exist if the third homotopy group $π_3(G/H)$ is nontrivial. We numerically simulate the evolution of texture-like configurations in a number of different models, in order to determine the extent to which the geometry and topology of the vacuum manifold influences the field evolution. We find that the dynamics is affected by whether or not the theory supports strings or monopoles [characterized by $π_1(G/H)$ and $π_2(G/H)$, respectively]. In some of the theories studied, configurations with initially spherically symmetric energy densities are unstable to nonspherical collapse; these theories are also found to nucleate defects during the collapse. Models that do not support monopoles or strings behave similarly to each other, regardless of the specific vacuum manifold.

hep-ph↗