Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum circuits”

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 577 records · Page 32

How quantum are non-negative wavefunctions?

We consider wavefunctions which are non-negative in some tensor product basis. We study what possible teleportation can occur in such wavefunctions, giving a complete answer in some cases (when one system is a qubit) and partial answers elsewhere. We use this to show that a one-dimensional wavefunction which is non-negative and has zero correlation length can be written in a “coherent Gibbs state” form, as explained later. We conjecture that such holds in higher dimensions. Additionally, some results are provided on possible teleportation in general wavefunctions, explaining how Schmidt coefficients before measurement limit the possible Schmidt coefficients after measurement, and on the absence of a “generalized area law” [D. Aharonov et al., in Proceedings of Foundations of Computer Science (FOCS) (IEEE, 2014), p. 246; e-print arXiv.org:1410.0951] even for Hamiltonians with no sign problem. One of the motivations for this work is an attempt to prove a conjecture about ground state wavefunctions which have an “intrinsic” sign problem that cannot be removed by any quantum circuit. We show a weaker version of this, showing that the sign problem is intrinsic for commuting Hamiltonians in the same phase as the double semion model under the technical assumption that TQO-2 holds [S. Bravyi et al., J. Math. Phys. 51, 093512 (2010)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scattering in the Ising model with the quantum Lanczos algorithm *

Abstract Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites with periodic boundary conditions on a quantum computer. We use the quantum Lanczos algorithm to obtain all energy levels and corresponding eigenstates of the system. We simplify the quantum computation by taking advantage of the symmetries of the system. These results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time. The quantum circuits were executed on various IBM Q superconducting hardware. The experimental results are in very good agreement with the values obtained using exact diagonalization.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fast-forwarding quantum evolution

We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states. Our definition accounts for any asymptotic complexity improvement of the general case and we use it to demonstrate fast-forwarding in several quantum systems. In particular, we show that some local spin systems whose Hamiltonians can be taken into block diagonal form using an efficient quantum circuit, such as those that are permutation-invariant, can be exponentially fast-forwarded. We also show that certain classes of positive semidefinite local spin systems, also known as frustration-free, can be polynomially fast-forwarded, provided the initial state is supported on a subspace of sufficiently low energies. Last, we show that all quadratic fermionic systems and number-conserving quadratic bosonic systems can be exponentially fast-forwarded in a model where quantum gates are exponentials of specific fermionic or bosonic operators, respectively. Our results extend the classes of physical Hamiltonians that were previously known to be fast-forwarded, while not necessarily requiring methods that diagonalize the Hamiltonians efficiently. We further develop a connection between fast-forwarding and precise energy measurements that also accounts for polynomial improvements.

97 MATHEMATICS AND COMPUTING↗

Quantum Vision Transformers for Quark–Gluon Classification

We introduce a hybrid quantum-classical vision transformer architecture, notable for its integration of variational quantum circuits within both the attention mechanism and the multi-layer perceptrons. The research addresses the critical challenge of computational efficiency and resource constraints in analyzing data from the upcoming High Luminosity Large Hadron Collider, presenting the architecture as a potential solution. In particular, we evaluate our method by applying the model to multi-detector jet images from CMS Open Data. The goal is to distinguish quark-initiated from gluon-initiated jets. We successfully train the quantum model and evaluate it via numerical simulations. Using this approach, we achieve classification performance almost on par with the one obtained with the completely classical architecture, considering a similar number of parameters.

Comajoan Cara, Marçal (ORCID:0009000126263752)↗

Many-body quantum dynamics slows down at low density

We study quantum many-body systems with a global U(1) conservation law, focusing on a theory of N interacting fermions with charge conservation, or N interacting spins with one conserved component of total spin. We define an effective operator size at finite chemical potential through suitably regularized out-of-time-ordered correlation functions. The growth rate of this density-dependent operator size vanishes algebraically with charge density; hence we obtain new bounds on Lyapunov exponents and butterfly velocities in charged systems at a given density, which are parametrically stronger than any Lieb-Robinson bound. We argue that the density dependence of our bound on the Lyapunov exponent is saturated in the charged Sachdev-Ye-Kitaev model. We also study random automaton quantum circuits and Brownian Sachdev-Ye-Kitaev models, each of which exhibit a different density dependence for the Lyapunov exponent, and explain the discrepancy. We propose that our results are a cartoon for understanding Planckian-limited energy-conserving dynamics at finite temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

In-plane emission of indistinguishable photons generated by an integrated quantum emitter

We demonstrate the emission of indistinguishable photons along a semiconductor chip originating from carrier recombination in an InAs quantum dot. The emitter is integrated in the waveguiding region of a photonic crystal structure, allowing for on-chip light propagation. We perform a Hong-Ou-Mandel-type of experiment with photons collected from the exit of the waveguide, and we observe two-photon interference under continuous wave excitation. Our results pave the way for the integration of quantum emitters in advanced photonic quantum circuits.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A non-commuting stabilizer formalism

We propose a non-commutative extension of the Pauli stabilizer formalism. The aim is to describe a class of many-body quantum states which is richer than the standard Pauli stabilizer states. In our framework, stabilizer operators are tensor products of single-qubit operators drawn from the group 〈αI, X, S〉, where α = e{sup iπ/4} and S = diag(1, i). We provide techniques to efficiently compute various properties related to bipartite entanglement, expectation values of local observables, preparation by means of quantum circuits, parent Hamiltonians, etc. We also highlight significant differences compared to the Pauli stabilizer formalism. In particular, we give examples of states in our formalism which cannot arise in the Pauli stabilizer formalism, such as topological models that support non-Abelian anyons.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Single-photon logic gates using minimal resources

We present a simple architecture for deterministic quantum circuits operating on single-photon qubits. Few resources are necessary to implement two elementary gates and can be recycled for computing with large numbers of qubits. The deterministic realization of some key multiqubit gates, such as the Fredkin and Toffoli gate, is greatly simplified in this approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analyzing Prospects for Quantum Advantage in Topological Data Analysis

Lloyd [Nat. Commun. , 10138 (2016)] were first to demonstrate the promise of quantum algorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, analyze, and optimize an improved quantum algorithm for topological data analysis (TDA) with reduced scaling, including a method for preparing Dicke states based on inequality testing, a more efficient amplitude estimation algorithm using Kaiser windows, and an optimal implementation of eigenvalue projectors based on Chebyshev polynomials. We compile our approach to a fault-tolerant gate set and estimate constant factors in the Toffoli complexity. Our analysis reveals that superquadratic quantum speedups are only possible for this problem when targeting a multiplicative error approximation and the Betti number grows asymptotically. Further, we propose a dequantization of the quantum TDA algorithm that shows that having exponentially large dimension and Betti number are necessary, but insufficient conditions, for superpolynomial advantage. We then introduce and analyze specific problem examples which have parameters in the regime where superpolynomial advantages may be achieved, and argue that quantum circuits with tens of billions of Toffoli gates can solve seemingly classically intractable instances. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗

Nonreciprocal Supercurrents in a Field-Free Graphene Josephson Triode

Superconducting diodes are proposed non-reciprocal circuit elements that should exhibit nondissipative transport in one direction while being resistive in the opposite direction. Multiple examples of such devices have emerged in the past couple of years, however their efficiency is typically limited, and most of them require magnetic field to function. Here we present a device achieving efficiencies upwards of 90% while operating at zero field. Our samples consist of a network of three graphene Josephson junctions linked by a common superconducting island, to which we refer as a Josephson triode. The triode is tuned by applying a control current to one of the contacts, thereby breaking the time-reversal symmetry of the current flow. The triode’s utility is demonstrated by rectifying a small (tens of nA amplitude) applied square wave. Finally, we speculate that devices of this type could be realistically employed in the modern quantum circuits.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

Simulation of Linear Non-Hermitian Boundary-Value Problems with Quantum Singular-Value Transformation

Herein we propose a quantum algorithm for simulating dissipative waves in inhomogeneous linear media as a boundary-value problem. Using the so-called quantum singular value transformation (QSVT), we construct a quantum circuit that models the propagation of electromagnetic waves in a one-dimensional system with outgoing boundary conditions. The corresponding measurement procedure is also discussed. Limitations of the QSVT algorithm are identified in connection with the large condition numbers that the dispersion matrices exhibit at weak dissipation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum algorithm for the Laughlin wave function

We construct a quantum algorithm that creates the Laughlin state for an arbitrary number n of particles for a filling fraction of one. This quantum circuit is efficient since it only uses n(n-1)/2 local qudit gates and its depth scales as 2n-3. Furthermore, we prove the optimality of the circuit using permutation theory arguments and we compute exactly how entanglement develops along the action of each gate. Finally, we discuss its experimental feasibility by decomposing the qudits and the gates in terms of qubits and two qubit-gates, as well as its generalization to arbitrary filling fraction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Traversable wormhole dynamics on a quantum processor

The holographic principle, theorized to be a property of quantum gravity, postulates that the description of a volume of space can be encoded on a lower-dimensional boundary. The anti-de Sitter (AdS)/conformal field theory correspondence or duality is the principal example of holography. The Sachdev–Ye–Kitaev (SYK) model of N >> 1 Majorana fermions has features suggesting the existence of a gravitational dual in AdS 2 , and is a new realization of holography. Here, we invoke the holographic correspondence of the SYK many-body system and gravity to probe the conjectured ER=EPR relation between entanglement and spacetime geometry through the traversable wormhole mechanism as implemented in the SYK model. A qubit can be used to probe the SYK traversable wormhole dynamics through the corresponding teleportation protocol. This can be realized as a quantum circuit, equivalent to the gravitational picture in the semiclassical limit of an infinite number of qubits. Here we use learning techniques to construct a sparsified SYK model that we experimentally realize with 164 two-qubit gates on a nine-qubit circuit and observe the corresponding traversable wormhole dynamics. Despite its approximate nature, the sparsified SYK model preserves key properties of the traversable wormhole physics: perfect size winding, coupling on either side of the wormhole that is consistent with a negative energy shockwave, a Shapiro time delay, causal time-order of signals emerging from the wormhole, and scrambling and thermalization dynamics. Our experiment was run on the Google Sycamore processor. By interrogating a two-dimensional gravity dual system, our work represents a step towards a program for studying quantum gravity in the laboratory. Future developments will require improved hardware scalability and performance as well as theoretical developments including higher-dimensional quantum gravity duals and other SYK-like models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient multimode Wigner tomography

Abstract Advancements in quantum system lifetimes and control have enabled the creation of increasingly complex quantum states, such as those on multiple bosonic cavity modes. When characterizing these states, traditional tomography scales exponentially with the number of modes in both computational and experimental measurement requirement, which becomes prohibitive as the system size increases. Here, we implement a state reconstruction method whose sampling requirement instead scales polynomially with system size, and thus mode number, for states that can be represented within such a polynomial subspace. We demonstrate this improved scaling with Wigner tomography of multimode entangled W states of up to 4 modes on a 3D circuit quantum electrodynamics (cQED) system. This approach performs similarly in efficiency to existing matrix inversion methods for 2 modes, and demonstrates a noticeable improvement for 3 and 4 modes, with even greater theoretical gains at higher mode numbers.

Science & Technology - Other Topics↗

Entanglement transitions from restricted Boltzmann machines

The search for novel entangled phases of matter has lead to the recent discovery of a new class of “en- tanglement transitions,” exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ansätze, we investigate under what conditions on the variational parameters these Ansätze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as 1/r α in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent α. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Furthermore, our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗