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

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↗

Laser-free trapped-ion entangling gates with simultaneous insensitivity to qubit and motional decoherence

The dominant error sources for state-of-the-art laser-free trapped-ion entangling gates are decoherence of the qubit state and the ion motion. The effect of these decoherence mechanisms can be suppressed with additional control fields or with techniques that have the disadvantage of reducing gate speed. In this study, we propose using a near-motional-frequency magnetic field gradient to implement a laser-free gate that is simultaneously resilient to both types of decoherence, does not require additional control fields, and has a relatively small cost in gate speed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

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↗

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↗

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 ↗

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↗

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↗

Error-Detectable Bosonic Entangling Gates with a Noisy Ancilla

Bosonic quantum error correction has proven to be a successful approach for extending the coherence of quantum memories, but to execute deep quantum circuits, high-fidelity gates between encoded qubits are needed. To that end, we present a family of error-detectable two-qubit gates for a variety of bosonic encodings. From a new geometric framework based on a “Bloch sphere” of bosonic operators, we construct ZZ L ⁡(θ) and exponential-swap(θ) gates for the binomial, four-legged cat, dual-rail, and several other bosonic codes. The gate Hamiltonian is simple to engineer, requiring only a programmable beam splitter between two bosonic qubits and an ancilla dispersively coupled to one qubit. This Hamiltonian can be realized in circuit QED hardware with ancilla transmons and microwave cavities. The proposed theoretical framework was developed for circuit QED but is generalizable to any platform that can effectively generate this Hamiltonian. Crucially, one can also detect first-order errors in the ancilla and the bosonic qubits during the gates. We show that this allows one to reach error-detected gate fidelities at the 0.01% level with today’s hardware, limited only by second-order hardware errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational approaches to constructing the many-body nuclear ground state for quantum computing

Here, we explore the preparation of specific nuclear states on gate-based quantum hardware using variational algorithms. Large-scale classical diagonalizations of the nuclear shell model have reached sizes of 10 9 –10 10 basis states but are still severely limited by computational resources. Quantum computing can, in principle, solve such systems exactly with exponentially fewer resources than classical computing. Exact solutions for large systems require many qubits and large gate depth, but variational approaches can effectively limit the required gate depth. We use the unitary coupled cluster approach to construct approximations of the ground-state vectors, later to be used in dynamics calculations. The testing ground is the phenomenological shell model space, which allows us to mimic the complexity of the internucleon interactions. We find that often one needs to minimize over a large number of parameters, using a large number of entanglements that makes the application on existing hardware challenging. Prospects for rapid improvements with more capable hardware are, however, very encouraging.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

QuantumNAT: quantum noise-aware training with noise injection, quantization and normalization

Parameterized Quantum Circuits (PQC) are promising towards quantum advantage on near-term quantum hardware. However, due to the large quantum noises (errors), the performance of PQC models has a severe degradation on real quantum devices. Take Quantum Neural Network (QNN) as an example, the accuracy gap between noise-free simulation and noisy results on IBMQ-Yorktown for MNIST-4 classification is over 60%. Existing noise mitigation methods are general ones without leveraging unique characteristics of PQC; on the other hand, existing PQC work does not consider noise effect. To this end, we present QuantumNAT, a PQC-specific framework to perform noise-aware optimizations in both training and inference stages to improve robustness. We experimentally observe that the effect of quantum noise to PQC measurement outcome is a linear map from noise-free outcome with a scaling and a shift factor. Motivated by that, we propose post-measurement normalization to mitigate the feature distribution differences between noise-free and noisy scenarios. Furthermore, to improve the robustness against noise, we propose noise injection to the training process by inserting quantum error gates to PQC according to realistic noise models of quantum hardware. Lastly, post-measurement quantization is introduced to quantize the measurement outcomes to discrete values, achieving the denoising effect. Extensive experiments on 8 classification tasks using 6 quantum devices demonstrate that QuantumNAT improves accuracy by up to 43%, and achieves over 94% 2-class, 80% 4-class, and 34% 10-class classification accuracy measured on real quantum computers. The code for construction and noise-aware training of PQC is available in the TorchQuantum library.

Wang, Hanrui↗

Quantum state preparation and nonunitary evolution with diagonal operators

Realizing nonunitary transformations on unitary-gate-based quantum devices is critically important for simulating a variety of physical problems, including open quantum systems and subnormalized quantum states. Here, we present a dilation-based algorithm to simulate nonunitary operations using probabilistic quantum computing with only one ancilla qubit. We utilize the singular-value decomposition (SVD) to decompose any general quantum operator into a product of two unitary operators and a diagonal nonunitary operator, which we show can be implemented by a diagonal unitary operator in a one-qubit dilated space. While dilation techniques increase the number of qubits in the calculation, and thus the gate complexity, our algorithm limits the operations required in the dilated space to a diagonal unitary operator, which has known circuit decompositions. We use this algorithm to prepare random subnormalized two-level states on a quantum device with high fidelity. Furthermore, we present the accurate nonunitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude-damping channel computed on a quantum device. The algorithm presented will be most useful for implementing general nonunitary operations when the SVD can be readily computed, which is the case for most operators in the noisy intermediate-scale quantum computing era.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gate-free state preparation for fast variational quantum eigensolver simulations

Abstract The variational quantum eigensolver is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. The algorithm involves implementing a sequence of parameterized gates on quantum hardware to generate a target quantum state, and then measuring the molecular energy. Due to finite coherence times and gate errors, the number of gates that can be implemented remains limited. In this work, we propose an alternative algorithm where device-level pulse shapes are variationally optimized for the state preparation rather than using an abstract-level quantum circuit. In doing so, the coherence time required for the state preparation is drastically reduced. We numerically demonstrate this by directly optimizing pulse shapes which accurately model the dissociation of H 2 and HeH + , and we compute the ground state energy for LiH with four transmons where we see reductions in state preparation times of roughly three orders of magnitude compared to gate-based strategies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Crosstalk Suppression in Individually Addressed Two-Qubit Gates in a Trapped-Ion Quantum Computer

Crosstalk between target and neighboring spectator qubits due to spillover of control signals represents a major error source limiting the fidelity of two-qubit entangling gates in quantum computers. We show that in our laser-driven trapped-ion system coherent crosstalk error can be modeled as residual $X\hat{σ}_{\phi}$ interaction and can be actively canceled by single-qubit echoing pulses. We propose and demonstrate a crosstalk suppression scheme that eliminates all first-order crosstalk utilizing only local control of target qubits, as opposed to an existing scheme which requires control over all neighboring qubits. We report a two-qubit Bell state fidelity of 99.52(6)% with the echoing pulses applied after collective gates and 99.37(5)% with the echoing pulses applied to each gate in a five-ion chain. Finally, this scheme is widely applicable to other platforms with analogous interaction Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Error mitigation with Clifford quantum-circuit data

Achieving near-term quantum observables despite significant hardware noise. For this purpose, we propose a novel, scalable error-mitigation method that applies to gate-based quantum computers. The method generates training data { X i noisy , X i exact } via quantum circuits composed largely of Clifford gates, which can be efficiently simulated classically, where X i noisy and X i exact are noisy and noiseless observables respectively. Fitting a linear ansatz to this data then allows for the prediction of noise-free observables for arbitrary circuits. We analyze the performance of our method versus the number of qubits, circuit depth, and number of non-Clifford gates. Here, we obtain an order-of-magnitude error reduction for a ground-state energy problem on 16 qubits in an IBMQ quantum computer and on a 64-qubit noisy simulator.

97 MATHEMATICS AND COMPUTING↗