Digital quantum simulation of controlled molecular dynamics in first quantization
Explore the source record for details and available documents.
Porter, Maxwell Dare↗
SEARCH · Search NASA
Results for “Digital quantum simulation”
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.
Digital quantum simulation of molecular dynamics and control.
Abstract not provided.
Magann, Alicia Bette↗
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.
97 MATHEMATICS AND COMPUTING↗
Probing the Kitaev honeycomb model on a neutral-atom quantum computer
Quantum simulations of many-body systems are among the most promising applications of quantum computers. In particular, models based on strongly correlated fermions are central to our understanding of quantum chemistry and materials problems, and can lead to exotic, topological phases of matter. However, owing to the non-local nature of fermions, such models are challenging to simulate with qubit devices. Here we realize a digital quantum simulation architecture for two-dimensional fermionic systems based on reconfigurable atom arrays. We utilize a fermion-to-qubit mapping based on Kitaev’s model on a honeycomb lattice, in which fermionic statistics are encoded using long-range entangled states. We prepare these states efficiently using measurement and feedforward, realize subsequent fermionic evolution through Floquet engineering with tunable entangling gates interspersed with atom rearrangement, and improve results with built-in error detection. Leveraging this fermion description of the Kitaev spin model, we efficiently prepare topological states across its complex phase diagram and verify the non-Abelian spin-liquid phase by evaluating an odd Chern number. We further explore this two-dimensional fermion system by realizing tunable dynamics and directly probing fermion exchange statistics. Finally, we simulate strong interactions and study the dynamics of the Fermi–Hubbard model on a square lattice. These results pave the way for digital quantum simulations of complex fermionic systems for materials science, chemistry and high-energy physics.
atomic and molecular physics↗
Digital-Analog Quantum Simulations Using the Cross-Resonance Effect
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Para-particle oscillator simulations on a trapped-ion quantum computer
Deformed oscillators allow for a generalization of the standard fermions and bosons, namely, for the description of para-particles. Such particles remain hypothetical and unobserved in nature; yet, they can model physical phenomena, such as topological phases of matter. Here, we report the digital quantum simulation of para-particle oscillators by mapping para-particle states to the state of a qubit register, which allows us to identify the para-particle oscillator Hamiltonian as an XY model and further digitize the system onto a universal set of gates. In both instances, the gate depth grows polynomially with the number of qubits used. To establish the validity of our results, we experimentally simulate the dynamics of para-fermions and para-bosons, demonstrating full control of para-particle oscillators on a quantum computer. Furthermore, we compare the overall performance of the digital simulation of dynamics of the driven para-Fermi oscillator to a recent analog quantum simulation result.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Towards string order melting of spin-1 particle chains in superconducting transmons using optimal control
Utilizing optimal control to simulate a model Hamiltonian is an emerging strategy that leverages the intrinsic physics of a device with digital quantum simulation methods. Here we evaluate optimal control for probing the nonequilibrium properties of symmetry-protected topological (SPT) states simulated with superconducting hardware. Assuming a tunable transmon architecture, we cast the evolution of these SPT states as a series of one- and two-site pulse optimization problems that are solved in the presence of leakage constraints. From the generated pulses, we classically simulate the time-dependent melting of the perturbed SPT string order across a six-site model with an average state infidelity of 10 -3 . The feasibility of these pulses as well as their efficient application indicate that high-fidelity simulations of string order melting are within reach of current quantum computing systems.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Diagnosis of information scrambling from Hamiltonian evolution under decoherence
We apply a quantum teleportation protocol based on the Hayden-Preskill thought experiment to quantify how scrambling a given quantum evolution is. It has an advantage over the direct measurement of out-of time ordered correlators when used to diagnose the information scrambling in the presence of decoherence effects stemming from a noisy quantum device. We demonstrate the protocol by applying it to two physical systems: Ising spin chain and SU(2) lattice Yang-Mills theory. To this end, we numerically simulate the time evolution of the two theories in the Hamiltonian formalism. The lattice Yang-Mills theory is implemented with a suitable truncation of Hilbert space on the basis of the Kogut-Susskind formalism. On a two-leg ladder geometry and with the lowest nontrivial spin representations, it can be mapped to a spin chain, which we call Yang-Mills-Ising model and is also directly applicable to future digital quantum simulations. Here, we find that the Yang-Mills-Ising model shows the signal of information scrambling at late times.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Quantum computing for nuclear physics
Future quantum computers are anticipated to be able to perform simulations of quantum many-body systems and quantum field theories that lie beyond the capabilities of classical computation. This will lead to new insights and predictions for systems ranging from dense non-equilibrium matter, to low-energy nuclear structure and reactions, to high-energy collisions. I present an overview of digital quantum simulations in nuclear physics, with select examples relevant for studies of quark matter.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
A Quantum Analog Coprocessor for Correlated Electron Systems Simulation
Analog quantum simulation is an approach for studying physical systems that might otherwise be computationally intractable to simulate on classical high-performance computing (HPC) systems. The key idea behind analog quantum simulation is the realization of a physical system with a low-energy effective Hamiltonian that is the same as the low-energy effective Hamiltonian of some target system to be studied. Purpose-built nanoelectronic devices are a natural candidate for implementing the analog quantum simulation of strongly correlated materials that are otherwise challenging to study using classical HPC systems. However, realizing devices that are sufficiently large to study the properties of a non-trivial material system (e.g., those described by a Fermi-Hubbard model) will eventually require the fabrication, control, and measurement of at least 0(10) quantum dots, or other engineered quantum impurities. As a step toward large-scale analog or digital quantum simulation platforms based on nanoelectronic devices, we propose a new approach to analog quantum simulation that makes use of the large Hilbert space dimension of the electronic baths that are used to adjust the occupancy of one or a few engineered quantum impurities. This approach to analog quantum simulation allows us to study a wide array of quantum impurity models. We can further augment the computational power of such an approach by combining it with a classical computer to facilitate dynamical mean-field theory (DMFT) calculations. DMFT replaces the solution of a lattice impurity problem with the solution of a family of localized impurity problems with bath couplings that are adjusted to satisfy a self-consistency condition between the two models. In DMFT, the computationally challenging task is the high-accuracy solution of an instance of a quantum impurity model that is determined self-consistently in coordination with a mean-field calculation. We propose using one or a few engineered quantum impurities with adjustable couplings to baths to realize an analog quantum coprocessor that effects the solution of such a model through measurements of a physical quantum impurity, operating in coordination with a classical computer to achieve a self-consistent solution to a DMFT calculation. We focus on implementation details relevant to a number of technologies for which Sandia has design, fabrication, and measurement expertise. The primary technical advances outlined in this report concern the development of a supporting modeling capability. As with all analog quantum simulation platforms, the successful design and operation of individual devices depends critically on one's ability to predict the effective low-energy Hamiltonian governing its dynamics Our project has made this possible and lays the foundation for future experimental implementations.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Light-Front Field Theory on Current Quantum Computers
We present a quantum algorithm for simulation of quantum field theory in the light-front formulation and demonstrate how existing quantum devices can be used to study the structure of bound states in relativistic nuclear physics. Specifically, we apply the Variational Quantum Eigensolver algorithm to find the ground state of the light-front Hamiltonian obtained within the Basis Light-Front Quantization (BLFQ) framework. The BLFQ formulation of quantum field theory allows one to readily import techniques developed for digital quantum simulation of quantum chemistry. This provides a method that can be scaled up to simulation of full, relativistic quantum field theories in the quantum advantage regime. As an illustration, we calculate the mass, mass radius, decay constant, electromagnetic form factor, and charge radius of the pion on the IBM Vigo chip. This is the first time that the light-front approach to quantum field theory has been used to enable simulation of a real physical system on a quantum computer.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Topological prethermal strong zero modes on superconducting processors
Abstract Symmetry-protected topological phases 1–4 cannot be described by any local order parameter and are beyond the conventional symmetry-breaking model 5 . They are characterized by topological boundary modes that remain stable under symmetry respecting perturbations 1–4,6–8 . In clean, gapped systems without disorder, the stability of these edge modes is restricted to the zero-temperature manifold; at finite temperatures, interactions with mobile thermal excitations lead to their decay 9–11 . Here we report the observation of a distinct type of topological edge mode 12–14 , which is protected by emergent symmetries and persists across the entire spectrum, in an array of 100 programmable superconducting qubits. Through digital quantum simulation of a one-dimensional disorder-free stabilizer Hamiltonian, we observe robust long-lived topological edge modes over up to 30 cycles for a wide range of initial states. We show that the interaction between these edge modes and bulk excitations can be suppressed by dimerizing the stabilizer strength, leading to an emergent U(1) × U(1) symmetry in the prethermal regime of the system. Furthermore, we exploit these topological edge modes as logical qubits and prepare a logical Bell state, which exhibits persistent coherence, despite the system being disorder-free and at finite temperature. Our results establish a viable digital simulation approach 15–18 to experimentally study topological matter at finite temperature and demonstrate a potential route to construct long-lived, robust boundary qubits in disorder-free systems.
Science & Technology - Other Topics↗
Unification of finite symmetries in the simulation of many-body systems on quantum computers
Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can result in significant overhead due to the exponentially growing size of some symmetry groups as the number of particles increases. Quantum computers hold the promise of achieving exponential speedup in simulating quantum many-body systems; however, a general method for utilizing symmetries in quantum simulations has not yet been established. In this work, we present a unified framework for incorporating symmetry group transforms on quantum computers to simulate many-body systems. The core of our approach lies in the development of efficient quantum circuits for symmetry-adapted projection onto irreducible representations of a group or pairs of commuting groups. We provide resource estimations for common groups, including the cyclic and permutation groups. Our algorithms demonstrate the capability to prepare coherent superpositions of symmetry-adapted states and to perform quantum evolution across a wide range of models in condensed-matter physics and ab initio electronic structure in quantum chemistry. Specifically, we execute a symmetry-adapted quantum subroutine for small molecules in first-quantization on noisy hardware and demonstrate the emulation of symmetry-adapted quantum phase estimation for preparing coherent superpositions of quantum states in various irreducible representations of a symmetry group. In addition, we present a discussion of open problems regarding treating symmetries in digital quantum simulations of many-body systems, paving the way for future systematic investigations into leveraging symmetries quantumly for practical quantum advantage. The broad applicability and rigorous resource estimation for symmetry transformations make our framework appealing for achieving provable quantum advantage on fault-tolerant quantum computers, especially for symmetry-related properties.
quantum algorithms↗
Pairwise‐Parallel Entangling Gates on Orthogonal Modes in a Trapped‐Ion Chain
Abstract Parallel operations are important for both near‐term quantum computers and larger‐scale fault‐tolerant machines because they reduce execution time and qubit idling. This study proposes and implements a pairwise‐parallel gate scheme on a trapped‐ion quantum computer. The gates are driven simultaneously on different sets of orthogonal motional modes of a trapped‐ion chain. This work demonstrates the utility of this scheme by creating a Greenberger‐Horne‐Zeilinger (GHZ) state in one step using parallel gates with one overlapping qubit. It also shows its advantage for circuits by implementing a digital quantum simulation of the dynamics of an interacting spin system, the transverse‐field Ising model. This method effectively extends the available gate depth by up to two times with no overhead when no overlapping qubit is involved, apart from additional initial cooling. This scheme can be easily applied to different trapped‐ion qubits and gate schemes, broadly enhancing the capabilities of trapped‐ion quantum computers.
Optics↗
Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms
Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Exponentially Reduced Circuit Depths Using Trotter Error Mitigation
Product formulas are a popular class of digital quantum simulation algorithms due to their conceptual simplicity, low overhead, and performance, which often exceeds theoretical expectations. Recently, Richardson extrapolation and polynomial interpolation have been proposed to mitigate the Trotter error incurred by the use of these formulas. This work provides a rigorous, general analysis of these techniques for computing time-evolved observables, simplifying the interpolation algorithm in the process, and shows that extrapolation generically improves the performance of product formulas for this task. We demonstrate that, to achieve error 𝜖 in a simulation of time 𝑇 using a 𝑝 th-order product formula with extrapolation, circuit depths of 𝑂(𝑇 1+1/𝑝 polylog (1/𝜖)) are sufficient—an exponential improvement in the precision over product formulas alone. Furthermore, we prove that these algorithms achieve commutator scaling, and improve the 𝑇 complexity for the interpolation algorithm. By relaxing the requirement of performing exact Chebyshev interpolation, our simplified algorithm eliminates the need for fractional implementations of Trotter steps, reducing computational overhead. Finally, we show these techniques can be combined with the classical shadows method to estimate many time-evolved local observables. Taken together, our findings provide the strongest evidence yet for the utility of Trotter error-mitigation techniques in algorithmic applications.
quantum algorithms & computation↗
Primitive quantum gates for an S U ( 2 ) discrete subgroup: Binary tetrahedral
We construct a primitive gate set for the digital quantum simulation of the binary tetrahedral ($\mathbb{BT}$) group on two quantum architectures. This nonabelian discrete group serves as a crude approximation to $SU(2)$ lattice gauge theory while requiring five qubits or one quicosotetrit per gauge link. The necessary basic primitives are the inversion gate, the group multiplication gate, the trace gate, and the $\mathbb{BT}$ Fourier transform over $\mathbb{BT}$. We experimentally benchmark the inversion and trace gates on ibm nairobi, with estimated fidelities between $14-55\%$, depending on the input state.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Primitive quantum gates for an S U ( 2 ) discrete subgroup: Binary octahedral
We construct a primitive gate set for the digital quantum simulation of the 48-element binary octahedral ( BO ) group. This non-Abelian discrete group better approximates S U ( 2 ) lattice gauge theory than previous work on the binary tetrahedral group at the cost of one additional qubit—for a total of six—per gauge link. The necessary primitives are the inversion gate, the group multiplication gate, the trace gate, and the BO Fourier transform. Published by the American Physical Society 2024
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗