Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum gates”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Hardware-Efficient Microwave-Activated Tunable Coupling between Superconducting Qubits

Generating high-fidelity, tunable entanglement between qubits is crucial for realizing gate-based quantum computation. In superconducting circuits, tunable interactions are often implemented using flux-tunable qubits or coupling elements, adding control complexity and noise sources. Here, we realize a tunable $ZZ$ interaction between two transmon qubits with fixed frequencies and fixed coupling, induced by driving both transmons off-resonantly. We show tunable coupling over one order of magnitude larger than the static coupling, and change the sign of the interaction, enabling cancellation of the idle coupling. Further, this interaction is amenable to large quantum processors: the drive frequency can be flexibly chosen to avoid spurious transitions, and because both transmons are driven, it is resilient to microwave crosstalk. We apply this interaction to implement a controlled phase (CZ) gate with a gate fidelity of $99.43(1)\%$ as measured by cycle benchmarking, and we observe the fidelity is limited by incoherent errors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗
NASA NTRS2019

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗
DOE OSTI2021

Crystalline materials for quantum computing: Semiconductor heterostructures and topological insulators exemplars

Abstract High-purity crystalline solid-state materials play an essential role in various technologies for quantum information processing, from qubits based on spins to topological states. New and improved crystalline materials emerge each year and continue to drive new results in experimental quantum science. This article summarizes the opportunities for a selected class of crystalline materials for qubit technologies based on spins and topological states and the challenges associated with their fabrication. We start by describing semiconductor heterostructures for spin qubits in gate-defined quantum dots and benchmark GaAs, Si, and Ge, the three platforms that demonstrated two-qubit logic. We then examine novel topologically nontrivial materials and structures that might be incorporated into superconducting devices to create topological qubits. We review topological insulator thin films and move onto topological crystalline materials, such as PbSnTe, and its integration with Josephson junctions. We discuss advances in novel and specialized fabrication and characterization techniques to enable these. We conclude by identifying the most promising directions where advances in these material systems will enable progress in qubit technology.

Scappucci, G. (ORCID:0000000325120079)↗
DOE OSTI2022

Engineering, Control, and Longitudinal Readout of Floquet Qubits

We discuss how properties of time-periodic Hamiltonians can be exploited to increase the dephasing time of qubits and to design protected one- and two-qubit gates. Recently, Huang et al. [Phys. Rev. Applied 15, 034065 (2021)] have shown that Floquet states offer a manifold of working points with dynamical protection larger than the few, usual, static sweet spots. Here, we show how Floquet theory, often used on systems with a single drive tone, can be used to describe approaches to robustly control Floquet qubits in the presence of multiple commensurate drive tones. Using this formulation, we introduce a longitudinal readout protocol to measure the Floquet qubit without the need of first adiabatically mapping the Floquet states back to the static qubit states, resulting in a significant speedup in the measurement time of the Floquet qubit. The analytical approach developed here can be applied to any Hamiltonian involving a small number of distinct drive tones, typical in the study of standard parametric gates for qubits outside of the rotating-wave approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Nonlinear signal distortion corrections through quantum sensing

Having accurate gate generation is essential for precise control of a quantum system. The generated gate usually suffers from linear and nonlinear distortion. Previous works have demonstrated how to use a qubit to correct linear frequency distortions but have not commented on how to handle nonlinear distortions. This is an important issue as we show that nonlinear amplitude distortions from the RF electronics can affect Rabi pulses by as much as 10%. We present work that demonstrates how a transmon qubit can be used as a highly sensitive cryogenic detector to characterize these nonlinear amplitude distortions. We show that a correction can drive these errors down to <1% over a 700 MHz range. The correction technique provides a method to minimize the effects of signal distortions and can be easily applied to broadband control pulses to produce higher fidelity arbitrary quantum gates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Implementation of a Frenkel exciton-based controlled phase shifter

Frenkel excitons are of interest for ultrafast switching applications due to the femtosecond timescale at which coherent exciton transfer between chromophores takes place. The Frenkel Hamiltonian, which governs the dynamics of Frenkel excitons, belongs to a class of Hamiltonians that enable universal quantum computation. It is thus of interest to determine how a complete set of exciton-based gates for quantum computing could be constructed as aggregates of chromophores. Here, we demonstrate that a controlled phase shifter can be constructed as a pair of exciton transmission lines that employ two types of chromophores and that are cross coupled by a two-exciton interaction. This element facilitates the construction of controlled basis-change gates, thereby enabling the implementation of a complete set of exciton-based gates for universal quantum computation.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2020

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

One- and two-qubit gate infidelities due to motional errors in trapped ions and electrons

In this work, we derive analytic formulas that determine the effect of error mechanisms on one- and two-qubit gates in trapped ions and electrons. First, we analyze and derive expressions for the effect of driving field inhomogeneities on one-qubit gate fidelities. Second, we derive expressions for two-qubit gate errors, including static motional frequency shifts, trap anharmonicities, field inhomogeneities, heating, and motional dephasing. We show that, for small errors, each of our expressions for infidelity converges to its respective numerical simulation; this shows that our formulas are sufficient for determining error budgets for high-fidelity gates, obviating numerical simulations in future projects. All of the derivations are general to any internal qubit state, and any mixed state of the ion crystal's motion that is diagonal in the Fock state basis. Our treatment of static motional frequency shifts, trap anharmonicities, heating, and motional dephasing apply to both laser-based and laser-free gates, while our treatment of field inhomogeneities applies to laser-free systems.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

Characterizing Midcircuit Measurements on a Superconducting Qubit Using Gate Set Tomography

Measurements that occur within the internal layers of a quantum circuit—midcircuit measurements—are a useful quantum-computing primitive, most notably for quantum error correction. Midcircuit measurements have both classical and quantum outputs, so they can be subject to error modes that do not exist for measurements that terminate quantum circuits. In this work, we show how to characterize midcircuit measurements, modeled by quantum instruments, using a technique that we call quantum instrument linear gate set tomography (QILGST). We then apply this technique to characterize a dispersive measurement on a superconducting transmon qubit within a multiqubit system. By varying the delay time between the measurement pulse and subsequent gates, we explore the impact of residual cavity photon population on measurement error. QILGST can resolve different error modes and quantify the total error from a measurement; in our experiment, for delay times above 1000 ns we measure a total error rate (i.e., half diamond distance) of ϵ$\diamond$ = 8.1 ± 1.4%, a readout fidelity of 97.0 ± 0.3%, and output quantum-state fidelities of 96.7 ± 0.6% and 93.7 ± 0.7 % when measuring 0 and 1, respectively.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Hierarchical memories: Simulating quantum LDPC codes with local gates

Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to geometric-locality constraints, it becomes challenging to realize these codes. In this paper, we construct a new family of [[N,K,D]] codes, referred to as hierarchical codes, that encode a number of logical qubits K=Ω(N/log(N) 2 ). The N th element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code; nearest-neighbor gates in two dimensions are sufficient to implement the corresponding syndrome-extraction circuit and achieve a threshold. Below threshold the logical failure rate vanishes superpolynomially as a function of the distance D(N). We present a bilayer architecture for implementing the syndrome-extraction circuit, and estimate the logical failure rate for this architecture. Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.

Pattison, Christopher A. [California Institute of ↗
DOE OSTI2022

Entropic lens on stabilizer states

The n-qubit stabilizer states are those left invariant by a 2 n -element subset of the Pauli group. The Clifford group is the group of unitaries which take stabilizer states to stabilizer states; a physically motivated generating set, the Hadamard, phase, and controlled-not (cnot) gates which comprise the Clifford gates, impose a graph structure on the set of stabilizers. We explicitly construct these structures, the “reachability graphs,” at n ≤ 5. When we consider only a subset of the Clifford gates, the reachability graphs separate into multiple, often complicated, connected components. Seeking an understanding of the entropic structure of the stabilizer states, which is ultimately built up by cnot gate applications on two qubits, we are motivated to consider the restricted subgraphs built from the Hadamard and cnot gates acting on only two of the n qubits. We show how the two subgraphs already present at two qubits are embedded into more complicated subgraphs at three and four qubits. We argue that no additional types of subgraph appear beyond four qubits, but that the entropic structures within the subgraphs can grow progressively more complicated as the qubit number increases. Starting at four qubits, some of the stabilizer states have entropy vectors which are not allowed by holographic entropy inequalities. Here, we comment on the nature of the transition between holographic and nonholographic states within the stabilizer reachability graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Electronic structure with direct diagonalization on a D-wave quantum annealer

Quantum chemistry is regarded to be one of the first disciplines that will be revolutionized by quantum computing. Although universal quantum computers of practical scale may be years away, various approaches are currently being pursued to solve quantum chemistry problems on near-term gate-based quantum computers and quantum annealers by developing the appropriate algorithm and software base. This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. The approach is based on the matrix formulation, efficiently uses qubit resources based on a power-of-two encoding scheme and is hardware-dominant relying on only one classically optimized parameter. We demonstrate the use of D-Wave hardware for obtaining ground and excited electronic states across a variety of small molecular systems. The approach can be adapted for use by a vast majority of electronic structure methods currently implemented in conventional quantum-chemical packages. The results of this work will encourage further development of software such as qbsolv which has promising applications in emerging quantum information processing hardware and has expectation to address large and complex optimization problems intractable for classical computers.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

Quantum metrology

This paper addresses the formal equivalence between the Mach-Zehnder interferometer, the Ramsey spectroscope, and a specific quantum logical gate. Based on this equivalence we introduce the quantum Rosetta Stone, and we describe a projective measurement scheme for generating the desired correlations between the interferometric input states in order to achieve Heisenberg-limited sensitivity.

quantum interferometry lithography projective meas↗