Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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.

At least 1,657 records · Page 92

Error detection on quantum computers improving the accuracy of chemical calculations

The ultimate goal of quantum error correction is to achieve the fault-tolerance threshold beyond which quantum computers can be made arbitrarily accurate. This requires extraordinary resources and engineering efforts. We show that even without achieving full fault-tolerance, quantum error detection is already useful on the current generation of quantum hardware. We demonstrate this by executing an end-to-end chemical calculation for the hydrogen molecule encoded in the [[4, 2, 2]] quantum error-detecting code. The encoded calculation with logical qubits significantly improves the accuracy of the molecular ground-state energy.

97 MATHEMATICS AND COMPUTING↗

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↗

Variational preparation of the thermofield double state of the Sachdev-Ye-Kitaev model

Here, we provide an algorithm for preparing the thermofield double (TFD) state of the Sachdev-Ye-Kitaev (SYK) model without the need for an auxiliary bath. Following previous work, the TFD can be cast as the approximate ground state of a Hamiltonian, H TFD . Using variational quantum circuits, we propose and implement a gradient-based algorithm for learning parameters that find this ground state, an application of the variational quantum eigensolver. Concretely, we find shallow quantum circuits that prepare the ground state of H TFD for the q = 4 SYK model for N = 8 Majoranas per side. For N = 12, we achieve a variational energy within 1% of the true ground-state energy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal thermodynamics of an SU ( N ) Fermi-Hubbard model

The SU(2) symmetric Fermi-Hubbard model (FHM) plays an essential role in strongly correlated fermionic many-body systems. In the one particle per site and strongly interacting limit U/t $\gg$ 1, it is effectively described by the Heisenberg Hamiltonian. In this limit, enlarging the spin and extending the typical SU(2) symmetry to SU(N) has been predicted to give exotic phases of matter in the ground state, with a complicated dependence on N. This raises the question of what—if any—are the finite-temperature signatures of these phases, especially in the currently experimentally relevant regime near or above the superexchange energy. We explore this question for thermodynamic observables by numerically calculating the thermodynamics of the SU(N) FHM in the two-dimensional square lattice near densities of one particle per site, using determinant quantum Monte Carlo and numerical linked cluster expansion. Interestingly, we find that for temperatures above the superexchange energy, where the correlation length is short, the energy, number of on-site pairs, and kinetic energy are universal functions of N. Although the physics in the regime studied is well beyond what can be captured by low-order high-temperature series, we show that an analytic description of the scaling is possible in terms of only one- and two-site calculations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Filtering states with total spin on a quantum computer

Starting from a general wave-function described on a set of spins or qubits, we propose several quantum algorithms to extract the components of this state on eigenstates of total spin S 2 and its z component S z . The method plays the role of total spin projection and gives access to the amplitudes of the initial state on a total spin basis. Here, the different algorithms have various degrees of sophistication depending on the requested tasks. They can either solely project onto the subspace with good total spin or completely uplift the degeneracy in this subspace. In the former case, when the projection on the total spin j is made, we show that the number of operations for the projection can be reduced from a quadratic to a linear dependence in j. After each measurement, the state collapses to one of the spin eigenstates that could be used for postprocessing. For this reason, we call the method total quantum spin filtering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Decomposition of high-rank factorized unitary coupled-cluster operators using ancilla and multiqubit controlled low-rank counterparts

The factorized form of the unitary coupled-cluster (UCC) approximation is one of the most promising methodologies to prepare trial states for strongly correlated systems within the variational quantum eigensolver framework. The factorized form of the UCC Ansatz can be systematically applied to a reference state to generate the desired entanglement. The difficulty associated with such an approach is the requirement of simultaneously entangling a growing number of qubits, which quickly exceeds the hardware limitations of today's quantum machines. In particular, while circuits for singles and double excitations can be performed on current hardware, higher-rank excitations require too many gate operations. In this work, we propose a set of schemes that trade off using extra qubits for a reduced gate depth to decompose high-rank UCC excitation operators into significantly lower depth circuits. These results will remain useful even when fault-tolerant machines are available to reduce the overall state-preparation circuit depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Laser-induced-fluorescence imaging of a spin-polarized ultracold neutral plasma in a magnetic field

In this work, we report Doppler-sensitive laser-induced-fluorescence (LIF) imaging of an ultracold neutral plasma in a magnetic field. Local values of ion density, hydrodynamic fluid velocity, temperature, and spin polarization are obtained using a fluorescence model based on velocity-resolved rate equations (REs) including the transfer of ions between states due to laser coupling and spontaneous emission. The RE approach captures optical pumping of ions into states that are not driven by the LIF excitation laser, and this is validated with experimental data. Combined molecular-dynamics and quantum-trajectories simulations verify that velocity-changing collisions have a negligible impact on the state population evolution for typical experimental conditions. Relative intensities of Zeeman components of the LIF spectra provide clear evidence that the ions are electron-spin-polarized when created by photoionization of magnetically trapped 88 Sr atoms. This probe opens many possibilities for studying thermal transport and the equilibration of neutral plasmas in overlapping regimes of strong coupling and magnetization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum Krylov subspace algorithms for ground- and excited-state energy estimation

Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground- and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form $\langle \phi_i|e^{-\widehat{H}τ}|\phi_j\rangle$, the associated quantum circuits require an ancilla qubit with controlled multiqubit gates that can be quite costly for near-term quantum hardware. In this paper, we show that a wide class of Hamiltonians relevant to condensed-matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test. We propose a multifidelity estimation protocol that can be used to compute such quantities, showing that our approach, when combined with efficient single-fidelity estimation protocols, provides a substantial reduction in circuit depth. In addition, here we develop a unified theory of quantum Krylov subspace algorithms and present three quantum-classical algorithms for the ground- and excited-state energy estimation problems, where each algorithm provides various advantages and disadvantages in terms of total number of calls to the quantum computer, gate depth, classical complexity, and stability of the generalized eigenvalue problem within the Krylov subspace.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum advantage for noisy channel discrimination

Many quantum mechanical experiments can be viewed as multiround interactive protocols between known quantum circuits and an unknown quantum process. Fully quantum “coherent” access to the unknown process is known to provide an advantage in many discrimination tasks compared to when only incoherent access is permitted, but it is unclear if this advantage persists when the process is noisy. Here, we show that a quantum advantage can be maintained when distinguishing between two noisy single-qubit rotation channels. Numerical and analytical calculations reveal a distinct transition between the performance of fully coherent and fully incoherent protocols as a function of noise strength. Moreover, the size of the region of coherent quantum advantage shrinks inverse polynomially in the number of channel uses, and in an intermediate regime an improved strategy is a hybrid of fully coherent and fully incoherent subroutines. The fully coherent protocol is based on quantum signal processing, suggesting a generalizable algorithmic framework for the study of quantum advantage in the presence of realistic noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimized low-depth quantum circuits for molecular electronic structure using a separable-pair approximation

We present a classically tractable model that leads to optimized low-depth quantum circuits leveraging separable-pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms. The associated wave functions can be represented with linear memory requirement, which allows classical optimization of the circuits and naturally defines a minimum benchmark for quantum algorithms. In this work we employ directly determined pair-natural orbitals within a basis-set-free approach. This leads to accurate representation of the one- and many-body parts for weakly correlated systems and we explicitly illustrate how the model can be integrated into other quantum algorithms for stronger correlated systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Computationally efficient zero-noise extrapolation for quantum-gate-error mitigation

Zero noise extrapolation (ZNE) is a widely used technique for gate error mitigation on near term quantum computers because it can be implemented in software and does not require knowledge of the quantum computer noise parameters. Traditional ZNE requires a significant resource overhead in terms of quantum operations. A recent proposal using a targeted (or random) instead of fixed identity insertion method (riim versus fiim) requires significantly fewer quantum gates for the same formal precision. We start by showing that riim can allow for ZNE to be deployed on deeper circuits than fiim but requires many more measurements to maintain the same statistical uncertainty. We develop two extensions to fiim and riim. The List Identity Insertion Method (liim) allows to mitigate the error from certain cnot gates, typically those with the largest error. Set Identity Insertion Method (siim) naturally interpolates between the measurement-efficient fiim and the gate-efficient riim allowing to trade off fewer cnot gates for more measurements. Finally, we investigate a way to boost the number of measurements, namely to run ZNE in parallel, utilizing as many quantum devices as are available. We explore the performance of riim in a parallel setting where there is a non-trivial spread in noise across sets of qubits within or across quantum computers.

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↗

Master equation emulation and coherence preservation with classical control of a superconducting qubit

Open quantum systems are a topic of intense theoretical research. The use of master equations to model a system's evolution subject to an interaction with an external environment is one of the most successful theoretical paradigms. General experimental tools to study different open system realizations have been limited, and so it is highly desirable to develop experimental tools which emulate diverse master equation dynamics and give a way to test open systems theories. In this paper we demonstrate a systematic method for engineering specific system-environment interactions and emulating master equations of a particular form using classical stochastic noise in a superconducting transmon qubit. We also demonstrate that non-Markovian noise can be used as a resource to extend the coherence of a quantum system and counteract the adversarial effects of Markovian environments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dyson maps and unitary evolution for Maxwell equations in tensor dielectric media

The propagation and scattering of electromagnetic waves in dielectric media is of theoretical and experimental interest in a wide variety of fields. An understanding of observational results generally requires a numerical solution of Maxwell equations—usually implemented on conventional computers using sophisticated numerical algorithms. In recent years, advances in quantum information science and in the development of quantum computers have piqued curiosity about taking advantage of these resources for an alternate numerical approach to Maxwell equations. This requires a reformulation of the classical Maxwell equations into a form suitable for quantum computers which, unlike conventional computers, are limited to unitary operations. In this paper, a unitary framework is developed for the propagation of electromagnetic waves in a spatially inhomogeneous, passive, nondispersive, and anisotropic dielectric medium. For such a medium, generally, the evolution operator in the combined Faraday-Ampere equations is not unitary. There are two steps needed to convert this equation into a unitary evolution equation. In the first step, a weighted Hilbert space is formulated in which the generator of dynamics is a pseudo-Hermitian operator. In the second step, a Dyson map is constructed which maps the weighted-physical-Hilbert space to the original Hilbert space. Furthermore, the resulting evolution equation for the electromagnetic wave fields is unitary. Utilizing the framework developed in these steps, a unitary evolution equation is derived for electromagnetic wave propagation in a uniaxial dielectric medium. The resulting form is suitable for quantum computing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Metal-insulator transition and magnetism of SU(3) fermions in the square lattice

We study the SU(3) symmetric Fermi-Hubbard model (FHM) in the square lattice at 1/3-filling using numerically exact determinant quantum Monte Carlo and numerical linked-cluster expansion techniques. We present the different regimes of the model in the T–U plane, which are characterized by local and short-range correlations, and capture signatures of the metal-insulator transition and magnetic crossovers. These signatures are detected as the temperature scales characterizing the rise of the compressibility, and an interaction-dependent change in the sign of the diagonal spin-spin correlation function. The analysis of the compressibility estimates the location of the metal-insulator quantum critical point at U c /t ~ 6, and provides a temperature scale for observing Mott physics at finite T. Furthermore, from the analysis of the spin-spin correlation function we observe that for U/t ≳ 6 and T ~ J = 4⁢t 2 /U there is a development of a short-range two-sublattice (2SL) antiferromagnetic structure, as well as an emerging three-sublattice (3SL) antiferromagnetic structure as the temperature is lowered below T/J ≲ 0.57. This crossover from 2SL to 3SL magnetic ordering agrees with Heisenberg limit predictions, and has observable effects on the density of on-site pairs. Finally, we describe how the features of the regimes in the T–U plane can be explored with alkaline-earth-like atoms in optical lattices with currently achieved experimental techniques and temperatures. Furthermore, the results discussed in this paper provide a starting point for the exploration of the SU(3) FHM upon doping.

74 ATOMIC AND MOLECULAR PHYSICS↗

Structural complexity of snapshots of two-dimensional Fermi-Hubbard systems

The development of quantum gas microscopy for two-dimensional optical lattices has provided an unparalleled tool to study the Fermi-Hubbard model (FHM) with ultracold atoms. Spin-resolved projective measurements, or snapshots, have played a significant role in quantifying correlation functions, theory verification, and thus the uncovering of underlying physical phenomena such as antiferromagnetism at commensurate filling on bipartite lattices and other charge and spin correlations, as well as dynamical properties at various densities. Here we employ a recent concept, the multiscale structural complexity, and show that when computed for the snapshots (of single spin species, local moments, or total density) it can provide a theory-free property, immediately accessible to experiments. Specifically, after benchmarking results for Ising and $XY$ models, we study the structural complexity of snapshots of the repulsive FHM in the two-dimensional square lattice as a function of doping and temperature. We generate projective measurements using determinant quantum Monte Carlo and compare their complexities against those from the experiment. We demonstrate that these complexities are linked to relevant physical observables such as the entropy and double occupancy. Their behaviors capture the development of correlations and relevant length scales in the system. Furthermore, we provide an open-source code in python which can be implemented into data analysis routines in experimental settings for the square lattice.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Error mitigation, optimization, and extrapolation on a trapped-ion testbed

Current noisy intermediate-scale quantum (NISQ) trapped-ion devices are subject to errors which can significantly impact the accuracy of calculations if left unchecked. A form of error mitigation called zero noise extrapolation (ZNE) can decrease an algorithm’s sensitivity to these errors without increasing the number of required qubits. Here we explore different methods for integrating this error mitigation technique into the Variational Quantum Eigensolver (VQE) algorithm for calculating the ground state of the HeH + molecule at 0.8 Å in the presence of experimental noise. Using the Quantum Scientific Computing Open User Testbed (QSCOUT) trapped-ion device, we test three methods of scaling noise for extrapolation: time stretching the two-qubit gates, scaling the sideband detuning parameter, and inserting two-qubit gate identity operations into the ansatz circuit. We find that time stretching and sideband detuning scaling fail to scale the noise on our particular hardware in a way that can be extrapolated to zero noise. Scaling our noise with global gate identity insertions and extrapolating after variational optimization, we achieve error suppression of 96.8%, resulting in an energy estimate within –0.004 ± 0.04 hartree of the ground state energy. This is an improvement, but still outside the chemical accuracy threshold of 0.0016 hartree. Furthermore, our results show that the efficacy of this error mitigation technique depends on choosing the correct implementation for a given device architecture.

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↗