Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum gate”

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

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↗

Benchmarking quantum logic operations relative to thresholds for fault tolerance

Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates—defined via the diamond norm—which can differ from average error rates by orders of magnitude. One method for resolving this discrepancy is to randomize the physical implementation of quantum gates, using techniques like randomized compiling (RC). In this work, we use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor. We find that, under RC, gate errors are accurately described by a stochastic Pauli noise model without coherent errors, and that spatially correlated coherent errors and non-Markovian errors are strongly suppressed. We further show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set. Our results show that randomized benchmarks are a viable route to both verifying that a quantum processor’s error rates are below a fault-tolerance threshold, and to bounding the failure rates of near-term algorithms, if—and only if—gates are implemented via randomization methods which tailor noise.

97 MATHEMATICS AND COMPUTING↗

Combining dynamical decoupling with fault-tolerant quantum computation

We study how dynamical decoupling (DD) pulse sequences can improve the reliability of quantum computers. We prove upper bounds on the accuracy of DD-protected quantum gates and derive sufficient conditions for DD-protected gates to outperform unprotected gates. Under suitable conditions, fault-tolerant quantum circuits constructed from DD-protected gates can tolerate stronger noise and have a lower overhead cost than fault-tolerant circuits constructed from unprotected gates. Our accuracy estimates depend on the dynamics of the bath that couples to the quantum computer and can be expressed either in terms of the operator norm of the bath's Hamiltonian or in terms of the power spectrum of bath correlations; we explain in particular how the performance of recursively generated concatenated pulse sequences can be analyzed from either viewpoint. Our results apply to Hamiltonian noise models with limited spatial correlations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pulse control of superconducting cavity-based qudits with a Fock-state basis

Fock-basis-encoding qudits allow quantum gates to operate on multiple qudit levels simultaneously. This capability is advantageous for applications involving complex local gate operations, such as the digital quantum simulation of non-Abelian gauge theories. However, compiling unitary operations to native qudit gates remains a challenging task, often requiring substantial computational resources. In this work, we theoretically investigate the direct pulse control of a superconducting radio-frequency cavity coupled to an ancilla transmon for gate synthesis. We will discuss the improvements and limitations applicable to high Fock states. This work paves the way toward more efficient and robust qudit-gate synthesis.

Li, Andy C.Y. [Fermilab] (ORCID:0000000345423739)↗

Pulse control of superconducting cavity-based qudits with a Fock-state basis

Fock-basis-encoding qudits allow quantum gates to operate on multiple qudit levels simultaneously. This capability is advantageous for applications involving complex local gate operations, such as the digital quantum simulation of non-Abelian gauge theories. However, compiling unitary operations to native qudit gates remains a challenging task, often requiring substantial computational resources. In this work, we theoretically investigate the direct pulse control of a superconducting radio-frequency cavity coupled to an ancilla transmon for gate synthesis. We will discuss the improvements and limitations applicable to high Fock states. This work paves the way toward more efficient and robust qudit-gate synthesis.

Li, Andy C.Y. [Fermilab] (ORCID:0000000345423739)↗

Continuous-variable controlled-Z gate using an atomic ensemble

The continuous-variable controlled-Z gate is a canonical two-mode gate for universal continuous-variable quantum computation. It is considered as one of the most fundamental continuous-variable quantum gates. Here we present a scheme for realizing continuous-variable controlled-Z gate between two optical beams using an atomic ensemble. The gate is performed by simply sending the two beams propagating in two orthogonal directions twice through a spin-squeezed atomic medium. Its fidelity can run up to one if the input atomic state is infinitely squeezed. Considering the noise effects due to atomic decoherence and light losses, we show that the observed fidelities of the scheme are still quite high within presently available techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum advantage in learning from experiments

Quantum technology promises to revolutionize how we learn about the physical world. An experiment that processes quantum data with a quantum computer could have substantial advantages over conventional experiments in which quantum states are measured and outcomes are processed with a classical computer. We proved that quantum machines could learn from exponentially fewer experiments than the number required by conventional experiments. This exponential advantage is shown for predicting properties of physical systems, performing quantum principal component analysis, and learning about physical dynamics. Furthermore, the quantum resources needed for achieving an exponential advantage are quite modest in some cases. Conducting experiments with 40 superconducting qubits and 1300 quantum gates, we demonstrated that a substantial quantum advantage is possible with today’s quantum processors.

Science & Technology - Other Topics↗

Simulating strongly correlated molecules with a superconducting quantum processor

Many of the biggest challenges in expanding the nation’s access to clean and low-cost energy resources are fundamentally chemistry or materials challenges. An important case is the development of new catalysts for the up-conversion of cheap and readily available materials such as methane or water into materials suitable for use as a fuel such as methanol or oxygen. To understand and exploit such processes, computer simulations of chemical reactions provide a natural complement to experimental studies. Unfortunately, most catalytic reactions involve so-called “strongly correlated” molecules which are notoriously difficult to study with simulation algorithms that can be executed on existing (classical) computers. The recent growth in quantum information science offers an alternative potential route for simulating these difficult systems. As a result, an increasing number of computational chemists are becoming interested in quantum computing. At the same time, quantum information scientists have identified chemistry simulation as a possible first demonstration of a quantum computer providing an improvement over a classical computer. The objective of this project is to accurately simulate strongly correlated molecules on a quantum processor. To meet the high challenges of this objective, new hybrid quantum/classical algorithms will be co-designed with advanced quantum gate developments and computed on customized quantum hardware. Some of the developed techniques will be transferable to study other molecular systems, while the project as a whole will help define better strategies for advancing the quantum simulation of matter more generally.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A reconfigurable gate architecture for Si/SiGe quantum dots

We demonstrate a reconfigurable quantum dot gate architecture that incorporates two interchangeable transport channels. One channel is used to form quantum dots, and the other is used for charge sensing. The quantum dot transport channel can support either a single or a double quantum dot. We demonstrate few-electron occupation in a single quantum dot and extract charging energies as large as 6.6 meV. Magnetospectroscopy is used to measure valley splittings in the range of 35–70 μeV. By energizing two additional gates, we form a few-electron double quantum dot and demonstrate tunable tunnel coupling at the (1,0) to (0,1) interdot charge transition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Realization of Universal Ion-Trap Quantum Computation with Decoherence-Free Qubits

Any residual coupling of a quantum computer to the environment results in computational errors. Encoding quantum information in a so-called decoherence-free subspace provides means to avoid these errors. Despite tremendous progress in employing this technique to extend memory storage times by orders of magnitude, computation within such subspaces has been scarce. Here, we demonstrate the realization of a universal set of quantum gates acting on decoherence-free ion qubits. We combine these gates to realize the first controlled-NOT gate towards a decoherence-free, scalable quantum computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Terahertz Optoelectronics of Quantum Rings and Nanohelices

We outline a range of proposals on using quantum rings and nanohelices for terahertz device implementations. We show that an Aharonov-Bohm quantum ring system and a double-gated quantum ring system both permit control over the polarization properties of the associated terahertz radiation. In addition, we review the superlattice properties of a mathematically similar system, that of a nanohelix in external electric fields, which reveals negative differential conductance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algebraic compression of quantum circuits for Hamiltonian evolution

Here unitary evolution under a time-dependent Hamiltonian is a key component of simulation on quantum hardware. Synthesizing the corresponding quantum circuit is typically done by breaking the evolution into small time steps, also known as Trotterization, which leads to circuits the depth of which scales with the number of steps. When the circuit elements are limited to a subset of SU(4) - or equivalently, when the Hamiltonian may be mapped onto free fermionic models - several identities exist that combine and simplify the circuit. Based on this, we present an algorithm that compresses the Trotter steps into a single block of quantum gates using algebraic relations between adjacent circuit elements. This results in a fixed depth time evolution for certain classes of Hamiltonians. We explicitly show how this algorithm works for several spin models, and demonstrate its use for adiabatic state preparation of the transverse field Ising model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Photon-mediated interactions between quantum emitters in a diamond nanocavity

Photon-mediated interactions between quantum systems are essential for realizing quantum networks and scalable quantum information processing. We demonstrate such interactions between pairs of silicon-vacancy (SiV) color centers coupled to a diamond nanophotonic cavity. When the optical transitions of the two color centers are tuned into resonance, the coupling to the common cavity mode results in a coherent interaction between them, leading to spectrally-resolved superradiant and subradiant states. We use the electronic spin degrees of freedom of the SiV centers to control these optically-mediated interactions. Such controlled interactions will be crucial in developing cavity-mediated quantum gates between spin qubits and for realizing scalable quantum network nodes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum-state preparation with universal gate decompositions

In quantum computation every unitary operation can be decomposed into quantum circuits--a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces the total number of cnot gates from 2{sup n} to (23/24)2{sup n} in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 cnot gates to 9 and the depth from 11 to 5 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Construction of a universal quantum computer

We construct a universal quantum computer following Deutsch's original proposal of a universal quantum Turing machine (UQTM). Like Deutsch's UQTM, our machine can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is universal. We present the architecture of the machine, which consists of a memory tape and a processor and describe the observables that comprise the registers of the processor and the instruction set, which includes a set of operations that can approximate any unitary operation to any desired accuracy and hence is quantum computationally universal. We present the unitary evolution operators that act on the machine to achieve universal computation and discuss each of them in detail and specify and discuss explicit program halting and concatenation schemes. We define and describe a set of primitive programs in order to demonstrate the universal nature of the machine. These primitive programs facilitate the implementation of more complex algorithms and we demonstrate their use by presenting a program that computes the NAND function, thereby also showing that the machine can compute any classically computable function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Let Each Quantum Bit Choose Its Basis Gates

Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) gates that can be implemented in a given technology. 2Q entangling gates, coupled with some 1Q gates, allow for universal quantum computation. In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits (typically an XX-or XY-type gate). This strict hardware uniformity requirement for 2Q gates in a large quantum computer has made scaling up a time and resource-intensive endeavor in the lab. We propose a radical idea – allow the 2Q basis gate(s) to differ between every pair of qubits, selecting the best entangling gates that can be calibrated between given pairs of qubits. This work aims to give quantum scientists the ability to run meaningful algorithms with qubit systems that are not perfectly uniform. Scientists will also be able to use a much broader variety of novel 2Q gates for quantum computing. We develop a theoretical framework for identifying good 2Q basis gates on “nonstandard” Cartan trajectories that deviate from “standard” trajectories like XX. We then introduce practical methods for calibration and compilation with nonstandard 2Q gates, and discuss possible ways to improve the compilation. To demonstrate our methods in a case study, we simulated both standard XY-type trajectories and faster, nonstandard trajectories using an entangling gate architecture with far-detuned transmon qubits. We identify efficient 2Q basis gates on these nonstandard trajectories and use them to compile a number of standard benchmark circuits such as QFT and QAOA. Furthermore, our results demonstrate an 8x improvement over the baseline 2Q gates with respect to speed and coherence-limited gate fidelity.

quantum computing↗

Electro-Optic Frequency Beam Splitters and Tritters for High-Fidelity Photonic Quantum Information Processing

In this paper, we report the experimental realization of high-fidelity photonic quantum gates for frequency-encoded qubits and qutrits based on electro-optic modulation and Fourier-transform pulse shaping. Our frequency version of the Hadamard gate offers near-unity fidelity (0.99998±0.00003), requires only a single microwave drive tone for near-ideal performance, functions across the entire C band (1530–1570 nm), and can operate concurrently on multiple qubits spaced as tightly as four frequency modes apart, with no observable degradation in the fidelity. For qutrits, we implement a 3×3 extension of the Hadamard gate: the balanced tritter. This tritter—the first ever demonstrated for frequency modes—attains fidelity 0.9989±0.0004. Finally, these gates represent important building blocks toward scalable, high-fidelity quantum information processing based on frequency encoding.

36 MATERIALS SCIENCE↗

qcal v0.0.1

qcal is a software package for calibration, characterization, and benchmarking of quantum gates. It was developed to operate full-stack superconducting quantum systems at the Advanced Quantum Testbed.

Hashim, Akel [Lawrence Berkeley National Laborator↗