SEARCH · Search NASA
Results for “Quantum, Quantum Algorithms”
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.
Mapping state transition susceptibility in quantum annealing
Not Available
Benchmarking variational quantum eigensolvers for the square-octagon-lattice Kitaev model
Not Available
Probing scrambling and operator size distributions using random mixed states and local measurements
The dynamical spreading of quantum information through a many-body system, typically called scrambling, is a complex process that has proven to be essential to describe many properties of out-of-equilibrium quantum systems. Scrambling can, in principle, be fully characterized via the use of out-of-time-ordered correlation functions, which are notoriously hard to access experimentally. In this work, we put forward an alternative toolbox of measurement protocols to experimentally probe scrambling by accessing properties of the operator size probability distribution, which tracks the size of the support of observables in a many-body system over time. Our measurement protocols require the preparation of separable mixed states together with local operations and measurements, and combine the tools of randomized operations, a modern development of near-term quantum algorithms, with the use of mixed states, a standard tool in NMR experiments. We demonstrate how to efficiently probe the probability-generating function of the operator distribution and discuss the challenges associated with obtaining the moments of the operator distribution. We further show that manipulating the initial state of the protocol allows us to directly obtain the individual elements of the distribution for small system sizes. Published by the American Physical Society 2024
Dynamic, symmetry-preserving, and hardware-adaptable circuits for quantum computing many-body states and correlators of the Anderson impurity model
We present a hardware-reconfigurable ansatz on N q -qubits for the variational preparation of many-body states of the Anderson impurity model (AIM) with N imp + N bath = N q /2 sites, which conserves total charge and spin z component within each variational search subspace. The many-body ground state of the AIM is determined as the minimum over all minima of O(N$^2_ q$) distinct charge-spin sectors. Hamiltonian expectation values are shown to require ω(N q ) < N meas. $\leqslant$ O(N imp N bath ) symmetry-preserving, parallelizable measurement circuits, each amenable to postselection. To obtain the one-particle impurity Green’s function we show how initial Krylov vectors can be computed via midcircuit measurement and how Lanczos iterations can be computed using the symmetry-preserving ansatz. For a single-impurity Anderson model with a number of bath sites increasing from one to seven, we show using numerical emulation that the ease of variational ground-state preparation is suggestive of linear scaling in circuit depth and subquartic scaling in optimizer complexity. We therefore expect that, combined with time-dependent methods for Green’s function computation, our ansatz provides a useful tool to account for electronic correlations on early fault-tolerant processors. Finally, with a view towards computing real materials properties of interest like magnetic susceptibilities and electron-hole propagators, we provide a straightforward method to compute many-body, time-dependent correlation functions using a combination of time evolution, midcircuit measurement-conditioned operations, and the Hadamard test.
Quantum Information Scrambling on a Superconducting Qutrit Processor
Not Available
Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
Not Available
Absence of Barren Plateaus in Quantum Convolutional Neural Networks
Not Available
Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quantum Processor
Not Available
Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms
Not Available
Faster Digital Quantum Simulation by Symmetry Protection
Not Available
Digital-Analog Quantum Simulations Using the Cross-Resonance Effect
Not Available
Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in the Variational Quantum Eigensolver
Not Available
Simulating Many-Body Systems with a Projective Quantum Eigensolver
Not Available
Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction
Not Available
Adaptive Variational Quantum Dynamics Simulations
Not Available
Quantum Filter Diagonalization with Compressed Double-Factorized Hamiltonians
Not Available