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 451 records · Page 25

Evidence for the utility of quantum computing before fault tolerance

Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications.

97 MATHEMATICS AND COMPUTING↗

Strong Photon‐Magnon Coupling Using a Lithographically Defined Organic Ferrimagnet

Abstract A cavity‐magnonic system composed of a superconducting microwave resonator coupled to a magnon mode hosted by the organic‐based ferrimagnet vanadium tetracyanoethylene (V[TCNE] x ) is demonstrated. This work is motivated by the challenge of scalably integrating a low‐damping magnetic system with planar superconducting circuits. V[TCNE] x has ultra‐low intrinsic damping, can be grown at low processing temperatures on arbitrary substrates, and can be patterned via electron beam lithography. The devices operate in the strong coupling regime, with a cooperativity exceeding 1000 for coupling between the Kittel mode and the resonator mode at T≈0.4 K, suitable for scalable quantum circuit integration. Higher‐order magnon modes are also observed with much narrower linewidths than the Kittel mode. This work paves the way for high‐cooperativity hybrid quantum devices in which magnonic circuits can be designed and fabricated as easily as electrical wires.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Equivalence of quantum barren plateaus to cost concentration and narrow gorges

Optimizing parameterized quantum circuits (PQCs) is the leading approach to make use of near-term quantum computers. However, very little is known about the cost function landscape for PQCs, which hinders progress towards quantum-aware optimizers. In this work, we investigate the connection between three different landscape features that have been observed for PQCs: (1) exponentially vanishing gradients (called barren plateaus (BPs)), (2) exponential cost concentration about the mean, and (3) the exponential narrowness of minima (called narrow gorges). Here we analytically prove that these three phenomena occur together, i.e., when one occurs then so do the other two. A key implication of this result is that one can numerically diagnose BPs via cost differences rather than via the computationally more expensive gradients. More broadly, our work shows that quantum mechanics rules out certain cost landscapes (which otherwise would be mathematically possible), and hence our results could be interesting from a quantum foundations perspective.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Qubit Lattice Algorithms Based on the Schrödinger-Dirac Representation of Maxwell Equations and Their Extensions

It is well known that Maxwell equations can be expressed in a unitary Schrodinger-Dirac representation for homogeneous media. However, difficulties arise when considering inhomogeneous media. A Dyson map points to a unitary field qubit basis, but the standard qubit lattice algorithm of interleaved unitary collision-stream operators must be augmented by some sparse non-unitary potential operators that recover the derivatives on the refractive indices. Here, the effect of the steepness of these derivatives on two-dimensional scattering is examined with simulations showing quite complex wavefronts emitted due to transmissions/reflections within the dielectric objects. Maxwell equations are extended to handle dissipation using Kraus operators. Then, our theoretical algorithms are extended to these open quantum systems. A quantum circuit diagram is presented as well as estimates on the required number of quantum gates for implementation on a quantum computer.

2D electromagnetic scattering↗

Qubit Lattice Algorithms based on the Schrodinger-Dirac representation of Maxwell Equations and their Extensions

It is well known that Maxwell equations can be expressed in a unitary Schrodinger-Dirac representation for homogeneous media. However, difficulties arise when considering inhomoge- neous media. A Dyson map points to a unitary field qubit basis, but the standard qubit lattice algorithm of interleaved unitary collision-stream operators must be augmented by some sparse non-unitary potential operators that recover the derivatives on the refractive indices. The effect of the steepness of these derivatives on two dimensional scattering is examined with simulations showing quite complex wavefronts emitted due to transmissions/reflections within the dielectric objects. Maxwell equations are extended to handle dissipation using Kraus operators. Then, our theoretical algorithms are extended to these open quantum systems. A quantum circuit diagram is presented as well as estimates on the required number of quantum gates for implementation on a quantum computer.

Vahala, George↗

Qudit Designs and Where to Find Them

Unitary t-designs are some of the most versatile tools in quantum information theory. Their applications range from randomized benchmarking and shadow tomography, to more fundamental ones such as emulating quantum chaos and establishing exponential separations between classical and quantum query complexity. While unitary designs originating from a group structure, such as the Clifford group, have proven to be incredibly useful for qubit systems, unfortunately, this is no longer true for qudits. In fact, the classification of finite-group representations rules out the existence of unitary 2-designs for arbitrary qudit dimensions. This severely limits the applicability of standard quantum information primitives when it comes to qudit systems. We overcome these limitations with a three-fold contribution. First, we introduce a general technique to construct families of weighted state t-designs in arbitrary qudit dimensions. These weighted state-designs generalize classical shadow tomography protocol from qubits to qudits. Second, we introduce a Clifford character RB that allows us to benchmark the qudit Clifford group in any dimension, including non-prime-power dimensions. And third, we establish bounds on the quantum circuit complexity of generating approximate unitary-designs from native gates in existing quantum hardware such as high-spin and cavity-QED qudits. Our work further highlights the analogy between spin and optical coherent states by proving that spin-GKP codewords form a state 2-design while spin coherent states do not; in direct analogy with the optical case. This work is structured as a pedagogical and self-contained introduction to unitary designs and their applications to qudit systems.

Anand, Namit [NASA, Ames; Unlisted, US] (ORCID:000↗

Universal monitored dynamics in multimode bosonic systems

We propose a route to study monitored many-body dynamics in multimode bosonic systems using circuit quantum electrodynamics. In this experimental setting, we construct several bosonic models comprising brickwork circuits built from beam-splitter gates, local parity measurements, and optional on-site Hubbard interactions, and diagnose their monitored dynamics via ancilla purification and a learnability-based probe. Under parity measurements, generic gate sets exhibit behavior that is largely consistent with a conventional measurement-induced phase transition, while a special class of beam-splitter circuits shows an apparent critical-like high-measurement regime in which purification times scale linearly with system size. We show that for realistic noise, gate, and measurement rates, these signatures are observable with near-term circuit QED hardware.

Patel, Shivam [Rutgers U., Piscataway]↗

Efficient learning of t -doped stabilizer states with single-copy measurements

One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms for states generated from Clifford circuits with at most log ⁡ ( n ) non-Clifford gates. However, these algorithms necessitate multi-copy measurements, posing implementation challenges in the near term due to the requisite quantum memory. On the contrary, using solely single-qubit measurements in the computational basis is insufficient in learning even the output distribution of a Clifford circuit with one additional T gate under reasonable post-quantum cryptographic assumptions. In this work, we introduce an efficient quantum algorithm that employs only nonadaptive single-copy measurement to learn states produced by Clifford circuits with a maximum of O ( log ⁡ n ) non-Clifford gates, filling a gap between the previous positive and negative results.

Physics↗

Near-optimal routing of noisy quantum states

Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.

Sadlier III, Ronald↗

Dimensionality Reduction with Variational Encoders Based on Subsystem Purification

Efficient methods for encoding and compression are likely to pave the way toward the problem of efficient trainability on higher-dimensional Hilbert spaces, overcoming issues of barren plateaus. Here, we propose an alternative approach to variational autoencoders to reduce the dimensionality of states represented in higher dimensional Hilbert spaces. To this end, we build a variational algorithm-based autoencoder circuit that takes as input a dataset and optimizes the parameters of a Parameterized Quantum Circuit (PQC) ansatz to produce an output state that can be represented as a tensor product of two subsystems by minimizing $Tr(ρ^2)$. The output of this circuit is passed through a series of controlled swap gates and measurements to output a state with half the number of qubits while retaining the features of the starting state in the same spirit as any dimension-reduction technique used in classical algorithms. The output obtained is used for supervised learning to guarantee the working of the encoding procedure thus developed. We make use of the Bars and Stripes (BAS) dataset for an 8 × 8 grid to create efficient encoding states and report a classification accuracy of 95% on the same. Thus, the demonstrated example provides proof for the working of the method in reducing states represented in large Hilbert spaces while maintaining the features required for any further machine learning algorithm that follows.

97 MATHEMATICS AND COMPUTING↗

Coherent-state storage and retrieval between superconducting cavities using parametric frequency conversion

In superconducting quantum information, machined aluminum superconducting cavities have proven to be a well-controlled, low-dissipation electromagnetic environment for quantum circuits such as qubits. They can possess large internal quality factors, Q{sub int} > 10{sup 8}, and present the possibility of storing quantum information for times far exceeding those of microfabricated circuits. However, in order to be useful as a storage element, these cavities require a fast “read/write” mechanism—in other words, they require tunable coupling between other systems of interest such as other cavity modes and qubits, as well as any associated readout hardware. In this work, we demonstrate these qualities in a simple dual cavity architecture in which a low-Q “readout” mode is parametrically coupled to a high-Q “storage” mode, allowing us to store and retrieve classical information. Specifically, we employ a flux-driven Josephson junction-based coupling scheme to controllably swap coherent states between two cavities, demonstrating full, sequenced control over the coupling rates between modes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive basis sets for practical quantum computing

Electronic structure calculations on small systems such as H 2 , H 2 O, LiH, and BeH 2 with chemical accuracy are still a challenge for the current generation of noisy intermediate-scale quantum (NISQ) devices. One of the reasons is that due to the device limitations, only minimal basis sets are commonly applied in quantum chemical calculations, which allows one to keep the number of qubits employed in the calculations at a minimum. However, the use of minimal basis sets leads to very large errors in the computed molecular energies as well as potential energy surface shapes. One way to increase the accuracy of electronic structure calculations is through the development of small basis sets better suited for quantum computing. In this work, we show that the use of adaptive basis sets, in which exponents and contraction coefficients depend on molecular structure, provides an easy way to dramatically improve the accuracy of quantum chemical calculations without the need to increase the basis set size and thus the number of qubits utilized in quantum circuits. As a proof of principle, we optimize an adaptive minimal basis set for quantum computing calculations on an H 2 molecule, in which exponents and contraction coefficients depend on the H—H distance, and apply it to the generation of H 2 potential energy surface on IBM-Q quantum devices. The adaptive minimal basis set reaches the accuracy of the double-zeta basis sets, thus allowing one to perform double-zeta quality calculations on quantum devices without the need to utilize twice as many qubits in simulations. This approach can be extended to other molecular systems and larger basis sets in a straightforward manner.

97 MATHEMATICS AND COMPUTING↗

Broadband coplanar-waveguide-based impedance-transformed Josephson parametric amplifier

Quantum-limited Josephson parametric amplifiers play a pivotal role in advancing the field of circuit quantum electrodynamics by enabling the fast and high-fidelity measurement of weak microwave signals. Therefore, it is necessary to develop robust parametric amplifiers with low noise, broad bandwidth, and reduced design complexity for microwave detection. However, current broadband parametric amplifiers either have degraded noise performance or rely on complex designs. Here, we present a device based on the broadband impedance-transformed Josephson parametric amplifier that integrates a hornlike coplanar waveguide transmission line, which significantly decreases the design and fabrication complexity while keeping comparable performance. The device shows an instantaneous bandwidth of 700 (200) MHz for 15 (20) dB gain with an average input saturation power of − 110 dBm and near quantum-limited added noise. The operating frequency can be tuned over 1.4 GHz using an external flux bias. We further demonstrate the negligible backaction from our device on a transmon qubit. The amplification performance and simplicity of our device promise its wide adaptation in quantum metrology, quantum communication, and quantum information processing. Published by the American Physical Society 2024

Qing, Bingcheng (ORCID:0000000345227017)↗

Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations

We introduce the Sequency Hierarchy Truncation (SeqHT) scheme for reducing the resources required for state preparation and time evolution in quantum simulations, based upon a truncation in sequency. For the λϕ 4 interaction in scalar field theory, or any interaction with a polynomial expansion, upper bounds on the contributions of operators of a given sequency are derived. For the systems we have examined, observables computed in sequency-truncated wavefunctions, including quantum correlations as measured by magic, are found to step-wise converge to their exact values with increasing cutoff sequency. The utility of SeqHT is demonstrated in the adiabatic state preparation of the λϕ 4 anharmonic oscillator ground state using IBM's quantum computer ibm_sherbrooke. Using SeqHT, the depth of the required quantum circuits is reduced by ∼ 30 % , leading to significantly improved determinations of observables in the quantum simulations. More generally, SeqHT is expected to lead to a reduction in required resources for quantum simulations of systems with a hierarchy of length scales.

Li, Zhiyao [Univ. of Washington, Seattle, WA (Unit↗

Crystallography of hyperbolic lattices

Hyperbolic lattices are a revolutionary platform for tabletop simulations of holography and quantum physics in curved space and facilitate efficient quantum error correcting codes. Their underlying geometry is non-Euclidean, and the absence of Bloch's theorem precludes the straightforward application of the often indispensable energy band theory to study model Hamiltonians on hyperbolic lattices. Motivated by recent insights into hyperbolic band theory, we initiate a crystallography of hyperbolic lattices. Here we show that many hyperbolic lattices feature a hidden crystal structure characterized by unit cells, hyperbolic Bravais lattices, and associated symmetry groups. Using the mathematical framework of higher-genus Riemann surfaces and Fuchsian groups, we derive a list of example hyperbolic {p,q} lattices and their hyperbolic Bravais lattices, including five infinite families and several graphs relevant for experiments in circuit quantum electrodynamics and topolectrical circuits. This dramatically simplifies the computation of energy spectra of tight-binding Hamiltonians on hyperbolic lattices, from exact diagonalization on the graph to solving a finite set of equations in terms of irreducible representations. The significance of this achievement needs to be compared to the all-important role played by conventional Euclidean crystallography in the study of solids. We exemplify the high potential of this approach by constructing and diagonalizing finite-dimensional Bloch wave Hamiltonians.

2-dimensional systems↗

Unitary circuit synthesis for tomography of generalized coherent states

We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables. Such expectations can be estimated by performing projective measurements on $\mathcal{O}$(M 3 log(M/δ)/ε 2 ) copies of the state, where M is the dimension of an associated Lie algebra, ε is a precision parameter, and 1 - δ is the required confidence level. The method can be implemented on a classical computer and runs in time $\mathcal{O}$(M 4 log(M/ε)). It provides $\mathcal{O}$(Mlog(M/ε)) simple unitaries that form the sequence. The overall complexity is then polynomial in M, being very efficient in cases where M is significantly smaller than the Hilbert space dimension, as for some fermion algebras. When the algebra of relevant observables is given by certain Pauli matrices, each simple unitary may be easily decomposed into two-qubit gates. We discuss applications to efficient quantum state tomography and classical simulations of quantum circuits. $\mathcal{O}$

97 MATHEMATICS AND COMPUTING↗

Entanglement concentration and purification of two-mode squeezed microwave photons in circuit QED

We present a theoretical proposal for a physical implementation of entanglement concentration and purification protocols for two-mode squeezed microwave photons in circuit quantum electrodynamics (QED). First, we give the description of the cross-Kerr effect induced between two resonators in circuit QED. Then we use the cross-Kerr media to design the effective quantum nondemolition (QND) measurement on microwave-photon number. By using the QND measurement, the parties in quantum communication can accomplish the entanglement concentration and purification of nonlocal two-mode squeezed microwave photons. We discuss the feasibility of our schemes by giving the detailed parameters which can be realized with current experimental technology. Our work can improve some practical applications in continuous-variable microwave-based quantum information processing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Leveraging Hamiltonian simulation techniques to compile operations on bosonic devices

Circuit quantum electrodynamics enables the combined use of qubits and oscillator modes. Despite a variety of available gate sets, many hybrid qubit-boson (i.e. qubit-oscillator) operations are realizable only through optimal control theory, which is oftentimes intractable and uninterpretable. We introduce an analytic approach with rigorously proven error bounds for realizing specific classes of operations via two matrix product formulas commonly used in Hamiltonian simulation, the Lie–Trotter–Suzuki and Baker–Campbell–Hausdorff product formulas. We show how this technique can be used to realize a number of operations of interest, including polynomials of annihilation and creation operators, namely (a) p (a † ) q for integer p, q. We show examples of this paradigm including obtaining universal control within a subspace of the entire Fock space of an oscillator, state preparation of a fixed photon number in the cavity, simulation of the Jaynes–Cummings Hamiltonian, and simulation of the Hong-Ou-Mandel effect. This work demonstrates how techniques from Hamiltonian simulation can be applied to better control hybrid qubit-boson devices.

bosonic qubits↗