Toward quantum simulations of Z 2 gauge theory without state preparation
Not Available
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
SEARCH · Engineering Papers
Results for “quantum computing for 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.
Classically emulated digital quantum simulation for screening and confinement in the Schwinger model with a topological term
Not Available
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Simulating hadronic physics on noisy intermediate-scale quantum devices using basis light-front quantization
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
SU(2) non-Abelian gauge field theory in one dimension on digital quantum computers
A dynamical quantum simulation of SU(2) non-Abelian gauge field theory on a digital quantum computer is presented here. This was enabled on current quantum hardware by introducing a mapping of the field onto a register of qubits that utilizes local gauge symmetry while preserving local constraints on the fields, reducing the dimensionality of the calculation. Controlled plaquette operators and gauge-variant completions in the unphysical part of the Hilbert space were designed and used to implement time evolution. The new techniques developed in this work generalize to quantum simulations of higher dimensional gauge field theories.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Sub-100-fs energy transfer in coenzyme NADH is a coherent process assisted by a charge-transfer state
Excitation energy transfer (EET) is a key photoinduced process in biological chromophoric assemblies. Here we investigate the factors which can drive EET into efficient ultrafast sub-ps regimes. We demonstrate how a coherent transport of electronic population could facilitate this in water solvated NADH coenzyme and uncover the role of an intermediate dark charge-transfer state. High temporal resolution ultrafast optical spectroscopy gives a 54 ± 11 fs time constant for the EET process. Nonadiabatic quantum dynamical simulations computed through the time-evolution of multidimensional wavepackets suggest that the population transfer is mediated by photoexcited molecular vibrations due to strong coupling between the electronic states. The polar aqueous solvent environment leads to the active participation of a dark charge transfer state, accelerating the vibronically coherent EET process in favorably stacked conformers and solvent cavities. Our work demonstrates how the interplay of structural and environmental factors leads to diverse pathways for the EET process in flexible heterodimers and provides general insights relevant for coherent EET processes in stacked multichromophoric aggregates like DNA strands.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
Trotter–Suzuki decompositions are frequently used in the quantum simulation of quantum chemistry. They transform the evolution operator into a form implementable on a quantum device, while incurring an error—the Trotter error. The Trotter error can be made arbitrarily small by increasing the Trotter number. However, this increases the length of the quantum circuits required, which may be impractical. It is therefore desirable to find methods of reducing the Trotter error through alternate means. The Trotter error is dependent on the order in which individual term unitaries are applied. Due to the factorial growth in the number of possible orderings with respect to the number of terms, finding an optimal strategy for ordering Trotter sequences is difficult. In this paper, we propose three ordering strategies, and assess their impact on the Trotter error incurred. Initially, we exhaustively examine the possible orderings for molecular hydrogen in a STO-3G basis. We demonstrate how the optimal ordering scheme depends on the compatibility graph of the Hamiltonian, and show how it varies with increasing bond length. We then use 44 molecular Hamiltonians to evaluate two strategies based on coloring their incompatibility graphs, while considering the properties of the obtained colorings. We find that the Trotter error for most systems involving heavy atoms, using a reference magnitude ordering, is less than 1 kcal/mol. Relative to this, the difference between ordering schemes can be substantial, being approximately on the order of millihartrees. The coloring-based ordering schemes are reasonably promising—particularly for systems involving heavy atoms—however further work is required to increase dependence on the magnitude of terms. Finally, we consider ordering strategies based on the norm of the Trotter error operator, including an iterative method for generating the new error operator terms added upon insertion of a term into an ordered Hamiltonian.
97 MATHEMATICS AND COMPUTING↗
Simulating scalar field theories on quantum computers with limited resources
Here we present a quantum algorithm for implementing φ 4 lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the implementation of the evolution operator is proportional to the lattice size. The algorithm allows efficient φ 4 state preparation for a large range of input parameters in both the normal and broken-symmetry phases. The states are prepared using a combination of variational and adiabatic evolution methods. First, the ground state of a local Hamiltonian, which includes the φ 4 self-interaction, is prepared using short variational circuits. Next, this state is evolved by switching on the coupling between the lattice sites adiabatically. The parameters defining the local Hamiltonian are adjustable and constitute the input of our algorithm. We present a method to optimize these parameters in order to reduce the adiabatic time required for state preparation. For preparing broken-symmetry states, the adiabatic evolution problems caused by crossing the phase transition critical line and by the degeneracy of the broken-symmetry ground state can be addressed using an auxiliary external field which gradually turns off during the adiabatic process. We show that the time dependence of the external field during the adiabatic evolution is important for addressing the broken-symmetry ground state degeneracy. The adiabatic time dependence on the inverse error tolerance can be reduced from quadratic to linear by using a field strength that decreases exponentially in time relative to one that decreases linearly.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Universality of a truncated sigma-model
Bosonic quantum field theories, even when regularized using a finite lattice, possess an infinite dimensional Hilbert space and, therefore, cannot be simulated in quantum computers with a finite number of qubits. A truncation of the Hilbert space is then needed and the physical results are obtained after a double limit: one to remove the truncation and another to remove the regulator (the continuum limit). A simpler alternative is to find a model with a finite dimensional Hilbert space belonging to the same universality class as the continuum model (a “qubitization”), so only the space continuum limit is required. A qubitization of the 1 + 1 dimensional asymptotically free O(3) nonlinear σ-model based on ideas of non-commutative geometry was previously proposed [1] and, in this paper, we provide evidence that it reproduces the physics of the σ-model both in the infrared and the ultraviolet regimes.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Metasurface holographic optical traps for ultracold atoms
We propose metasurface holograms as a novel platform to generate optical trap arrays for cold atoms with high quality, efficiency, and thermal stability. We developed design and fabrication methods to create dielectric, phase-only metasurface holograms based on titanium dioxide. We experimentally demonstrated optical trap arrays of various geometries, including periodic and aperiodic configurations with dimensions ranging from 1D to 3D and up to a few hundred trap sites. We characterized the performance of the holographic metasurfaces in terms of the positioning accuracy, size and intensity uniformity of the generated traps, and power handling capability of the dielectric metasurfaces. Our proposed platform has great potential for enabling fundamental studies of quantum many-body physics, and quantum simulation and computation tasks. The compact form factor, passive nature, good power handling capability, and scalability of generating high-quality, large-scale arrays also make the metasurface platform uniquely suitable for realizing field-deployable devices and systems based on cold atoms.
42 ENGINEERING↗
Efficient sparse state preparation via quantum walks
Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work, we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla-free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.
dynamic continuous time quantum walks↗
Sub-system quantum dynamics using coupled cluster downfolding techniques
In this paper, we discuss extending the sub-system embedding sub-algebra coupled cluster (SES-CC) formalism and the double unitary coupled cluster (DUCC) ansatz to the time domain. As we demonstrated in earlier studies, it is possible, using these formalisms, to calculate the energy of the entire system as an eigenvalue of downfolded/effective Hamiltonian in the active space, that is identifiable with the sub-system of the composite system. In these studies, we demonstrated that downfolded Hamiltonians integrate out Fermionic degrees of freedom that do not correspond to the physics encapsulated by the active space. We extend these results to the time-dependent Schrödinger equation, showing that a similar construct is possible to partition a system into a sub-system that varies slowly in time and a remaining subsystem that corresponds to fast oscillations. This time dependent formalism allows coupled cluster quantum dynamics to be extended to larger systems and for the formulation of novel quantum algorithms based on the quantum Lanczos approach, which have recently been considered in the literature.
coupled cluster, Electron correlation, quantum dyn↗
Generation of thermofield double states and critical ground states with a quantum computer
Significance Our experiment prepares two types of nontrivial quantum states on a trapped ion quantum computer: the thermofield double state of the transverse-field Ising model at arbitrary temperature and the quantum critical state of the zero-temperature model. We use techniques motivated by the quantum approximate optimization algorithm, and we implement a hybrid quantum–classical optimization loop to prepare the quantum critical state. Our results pave the way for exploring strongly correlated models at finite temperature and teleportation protocols inspired by black hole physics.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Quantum eigenvalue estimation via time series analysis
We present an efficient method for estimating the eigenvalues of a Hamiltonian H from the expectation values of the evolution operator for various times. For a given quantum state ρ, our method outputs a list of eigenvalue estimates and approximate probabilities. Each probability depends on the support of ρ in those eigenstates of H associated with eigenvalues within an arbitrarily small range. The complexity of our method is polynomial in the inverse of a given precision parameter ε, which is the gap between eigenvalue estimates. Unlike the well-known quantum phase estimation algorithm that uses the quantum Fourier transform, our method does not require large ancillary systems, large sequences of controlled operations, or preserving coherence between experiments, and is therefore more attractive for near-term applications. The output of our method can be used to estimate spectral properties of H and other expectation values efficiently, within additive error proportional to ε.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Computing partition functions in the one-clean-qubit model
We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive-semidefinite Hamiltonians, our method has an expected running-time that is almost linear in [M/( ε rel Z )] 2 , where M is the dimension of the quantum system, Z is the partition function, and ε rel is the relative precision. It is based on approximations of the exponential operator as linear combinations of certain operators related to block-encoding of Hamiltonians or Hamiltonian evolutions. The trace of each operator is estimated using a standard algorithm in the one-clean-qubit model. For large values of Z , our method may run faster than exact classical methods, whose complexities are polynomial in M . We also prove that a version of the partition function estimation problem within additive error is complete for the so-called DQC1 complexity class, suggesting that our method provides a superpolynomial speedup for certain parameter values. Overall, to attain a desired relative precision, we develop a classical procedure based on a sequence of approximations within predetermined additive errors that may be of independent interest.
97 MATHEMATICS AND COMPUTING↗
Statistical analysis on random quantum circuit sampling by Sycamore and Zuchongzhi quantum processors
Random quantum circuit sampling, a task to sample bit strings from a random quantum circuit, is considered a suitable benchmark task to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum circuit sampling was performed on the Sycamore quantum processor with 53 qubits [Nature (London) 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare the statistical properties of the outputs of the random quantum circuit sampling by the Sycamore and Zuchongzhi processors. Using the Marchenko-Pastur law of random matrices of bit strings and the Wasssertein distances between bit strings, we find that the statistical properties of Sycamore bit strings are quite different from those of Zuchongzhi bit strings, while both processors score similar values of linear cross-entropy fidelity for random circuit sampling. Some bit strings sampled by the Zuchongzhi processor pass the NIST random number tests while both Sycamore and Zuchongzhi processors show similar patterns in the heat maps of bit strings. Zuchongzhi bit strings are much closer to classical uniform random bits than those of Sycamore. It is shown that the statistical properties of bit strings of both random quantum circuits change little as the depth of the random quantum circuits increases. Our findings raise a question about the computational reliability of noisy quantum processors because two quantum processors with similar noise levels and similar qubit structures produced statistically different outputs for the same random quantum circuit sampling.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Cheaper and more noise-resilient quantum state preparation using eigenvector continuation
Subspace methods are powerful, noise-resilient methods that can effectively prepare ground states on quantum computers. The challenge is to get a subspace with a small condition number that spans the states of interest using minimal quantum resources. In this work, we will use eigenvector continuation to build a subspace from the low-lying states of a set of Hamiltonians. The basis vectors are prepared using truncated versions of standard state preparation methods such as imaginary-time evolution (ITE), adiabatic state preparation (ASP), and variational quantum eigensolver. By using these truncated methods combined with eigenvector continuation, we can directly improve upon them, obtaining more accurate ground-state energies at a reduced cost. We use several spin systems to demonstrate convergence even when methods like ITE and ASP fail, such as ASP in the presence of level crossings and ITE with vanishing energy gaps. We also showcase the noise resilience of this approach beyond the gains already made by having shallower quantum circuits. Furthermore, our findings suggest that eigenvector continuation can be used to improve existing state preparation methods in the near term.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗