Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computer”

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 1,729 records · Page 96

Correcting errors in a quantum gate with pushed ions via optimal control

We analyze in detail the so-called pushing gate for trapped ions, introducing a time-dependent harmonic approximation for the external motion. We show how to extract the average fidelity for the gate from the resulting semiclassical simulations. We characterize and quantify precisely all types of errors coming from the quantum dynamics and reveal that slight nonlinearities in the ion-pushing force can have a dramatic effect on the adiabaticity of gate operation. By means of quantum optimal control techniques, we show how to suppress each of the resulting gate errors in order to reach a high fidelity compatible with scalable fault-tolerant quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Catalysis and activation of magic states in fault-tolerant architectures

In many architectures for fault-tolerant quantum computing universality is achieved by a combination of Clifford group unitary operators and preparation of suitable nonstabilizer states, the so-called magic states. Universality is possible even for some fairly noisy nonstabilizer states, as distillation can convert many noisy copies into fewer purer magic states. Here we propose protocols that exploit multiple species of magic states in surprising ways. These protocols provide examples of previously unobserved phenomena that are analogous to catalysis and activation well known in entanglement theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗

Tunneling qubit operation on a protected Josephson junction array

We propose a complete quantum computation process on a topologically protected Josephson junction array system, originally proposed by Ioffe and Feigel'man [Phys. Rev. B 66, 224503 (2002)]. Logical qubits for computation are encoded in the punctured array. The number of qubits is determined by the number of holes. The topological degeneracy is lightly shifted by tuning the flux along specific paths. We show how to perform both single-qubit and basic quantum-gate operations in this system, especially the controlled-NOT (CNOT) gate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probing Quantum Telecloning on Superconducting Quantum Processors

Quantum information cannot be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typically referred to as quantum cloning, and quantum teleportation. Quantum telecloning allows approximate copies of quantum information to be constructed by separate parties, using the classical results of a Bell measurement made on a prepared quantum telecloning state. Quantum telecloning can be implemented as a circuit on quantum computers using a classical coprocessor to compute classical feedforward instructions using if statements based on the results of a midcircuit Bell measurement in real time. We present universal symmetric optimal 1 → M telecloning circuits and experimentally demonstrate these quantum telecloning circuits for M = 2 up to M = 10, natively executed with real-time classical control systems on IBM Quantum superconducting processors, known as dynamic circuits. We perform the cloning procedure on many different message states across the Bloch sphere, on seven IBM Quantum processors, optionally using the error suppression technique X–X sequence digital dynamical decoupling. Two circuit optimizations are utilized: one that removes ancilla qubits for M = 2,3 , and one that reduces the total number of gates in the circuit but still uses ancilla qubits. Parallel single-qubit tomography with maximum likelihood estimation density matrix reconstruction is used in order to compute the mixed-state density matrices of the clone qubits, and clone quality is measured using quantum fidelity. These results present one of the largest and most comprehensive noisy intermediate-scale quantum computer experimental analyses on (single qubit) quantum telecloning to date. The clone fidelity sharply decreases to 0.5 for M > 5 , but for M = 2 , we are able to achieve a mean clone fidelity of up to 0.79 using dynamical decoupling.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Computing partition functions in the one-clean-qubit model

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive-semidefinite Hamiltonians, our method has an expected running-time that is almost linear in [M/( ε rel Z )] 2 , where M is the dimension of the quantum system, Z is the partition function, and ε rel is the relative precision. It is based on approximations of the exponential operator as linear combinations of certain operators related to block-encoding of Hamiltonians or Hamiltonian evolutions. The trace of each operator is estimated using a standard algorithm in the one-clean-qubit model. For large values of Z , our method may run faster than exact classical methods, whose complexities are polynomial in M . We also prove that a version of the partition function estimation problem within additive error is complete for the so-called DQC1 complexity class, suggesting that our method provides a superpolynomial speedup for certain parameter values. Overall, to attain a desired relative precision, we develop a classical procedure based on a sequence of approximations within predetermined additive errors that may be of independent interest.

97 MATHEMATICS AND COMPUTING↗

A Theoretical Mechanism of Szilard Engine Function in Nucleic Acids and the Implications for Quantum Coherence in Biological Systems

Nucleic acids theoretically possess a Szilard engine function that can convert the energy associated with the Shannon entropy of molecules for which they have coded recognition, into the useful work of geometric reconfiguration of the nucleic acid molecule. This function is logically reversible because its mechanism is literally and physically constructed out of the information necessary to reduce the Shannon entropy of such molecules, which means that this information exists on both sides of the theoretical engine, and because information is retained in the geometric degrees of freedom of the nucleic acid molecule, a quantum gate is formed through which multi-state nucleic acid qubits can interact. Entangled biophotons emitted as a consequence of symmetry breaking nucleic acid Szilard engine (NASE) function can be used to coordinate relative positioning of different nucleic acid locations, both within and between cells, thus providing the potential for quantum coherence of an entire biological system. Theoretical implications of understanding biological systems as such 'quantum adaptive systems' include the potential for multi-agent based quantum computing, and a better understanding of systemic pathologies such as cancer, as being related to a loss of systemic quantum coherence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Differentiable Quantum Programming with Unbounded Loops

The emergence of variational quantum applications has led to the development of automatic differentiation techniques in quantum computing. Existing work has formulated differentiable quantum programming with bounded loops, providing a framework for scalable gradient calculation by quantum means for training quantum variational applications. However, promising parameterized quantum applications, e.g., quantum walk and unitary implementation, cannot be trained in the existing framework due to the natural involvement of unbounded loops. To fill in the gap, we provide the first differentiable quantum programming framework with unbounded loops, including a newly designed differentiation rule, code transformation, and their correctness proof. Technically, we introduce a randomized estimator for derivatives to deal with the infinite sum in the differentiation of unbounded loops, whose applicability in classical and probabilistic programming is also discussed. We implement our framework with Python and Q# and demonstrate a reasonable sample efficiency. Through extensive case studies, we showcase an exciting application of our framework in automatically identifying close-to-optimal parameters for several parameterized quantum applications.

Computer Science↗

Noise Robustness and Experimental Demonstration of a Quantum Generative Adversarial Network for Continuous Distributions

Abstract The potential advantage of machine learning in quantum computers is a topic of intense discussion in the literature. Theoretical, numerical, and experimental explorations will most likely be required to understand its power. There have been different algorithms proposed to exploit the probabilistic nature of variational quantum circuits for generative modeling. In this paper, a hybrid architecture for quantum generative adversarial networks (QGANs) is employed and their robustness in the presence of noise is studied. A simple way of adding different types of noise to the quantum generator circuit is devised, and the noisy hybrid QGANs (HQGANs) are simulated numerically to learn continuous probability distributions, and to show that the performance of HQGANs remains unaffected. The effect of different parameters on the training time is also investigated to reduce the computational scaling of the algorithm and simplify its deployment on a quantum computer. The training on Rigetti's Aspen‐4‐2Q‐A quantum processing unit is then performed, and the results from the training are presented. The authors' results pave the way for experimental exploration of different quantum machine learning algorithms on noisy intermediate‐scale quantum devices.

Anand, Abhinav↗

Does provable absence of barren plateaus imply classical simulability?

A large amount of effort has recently been put into understanding the barren plateau phenomenon. In this perspective article, we face the increasingly loud elephant in the room and ask a question that has been hinted at by many but not explicitly addressed: Can the structure that allows one to avoid barren plateaus also be leveraged to efficiently simulate the loss classically? We collect evidence-on a case-by-case basis-that many commonly used models whose loss landscapes avoid barren plateaus can also admit classical simulation, provided that one can collect some classical data from quantum devices during an initial data acquisition phase. This follows from the observation that barren plateaus result from a curse of dimensionality, and that current approaches for solving them end up encoding the problem into some small, classically simulable, subspaces. Thus, while stressing that quantum computers can be essential for collecting data, our analysis sheds doubt on the information processing capabilities of many parametrized quantum circuits with provably barren plateau-free landscapes. We end by discussing the (many) caveats in our arguments including the limitations of average case arguments, the role of smart initializations, models that fall outside our assumptions, the potential for provably superpolynomial advantages and the possibility that, once larger devices become available, parametrized quantum circuits could heuristically outperform our analytic expectations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Capturing many-body correlation effects with quantum and classical computing

Theoretical descriptions of excited states of molecular systems in high-energy regimes are crucial for supporting and driving many experimental efforts at light source facilities. However, capturing their complicated correlation effects requires formalisms that provide a hierarchical infrastructure of approximations. These approximations lead to an increased overhead in classical computing methods and, therefore, decisions regarding the ranking of approximations and the quality of results must be made on purely numerical grounds. The emergence of quantum computing methods has the potential to change this situation. Here, in this study, we demonstrate the efficiency of the quantum phase estimator (QPE) in identifying core-level states relevant to x-ray photoelectron spectroscopy. We compare and validate the QPE predictions with exact diagonalization and real-time equation-of-motion coupled-cluster formulations, which are some of the most accurate methods for states dominated by collective correlation effects.

74 ATOMIC AND MOLECULAR PHYSICS↗

Single-nuclear-spin cavity QED

We constructed a cavity QED system with a diamagnetic atom of {sup 171}Yb and performed projective measurements on a single nuclear spin. Since Yb has no electronic spin and has 1/2 nuclear spin, the procedure of spin polarization and state verification can be dramatically simplified compared with the pseudo-spin-1/2 system. By enhancing the photon emission rate of the {sup 1}S{sub 0}-{sup 3}P{sub 1} transition, projective measurement is implemented for an atom with the measurement time of T{sub meas}=30 {mu}s. Unwanted spin flip and dark counts of the detector lead to systematic error when the present technique is applied for the determination of diagonal elements of an unknown spin state, which is {delta}|{beta}|{sup 2{<=}}2x10{sup -2}. Fast measurement on a long-lived qubit is key to the realization of large-scale one-way quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum state engineering with flux-biased Josephson phase qubits by rapid adiabatic passages

In this article, the scheme of quantum computing based on the Stark-chirped rapid adiabatic passage (SCRAP) technique [L. F. Wei, J. R. Johansson, L. X. Cen, S. Ashhab, and F. Nori, Phys. Rev. Lett. 100, 113601 (2008)] is extensively applied to implement quantum state manipulations in flux-biased Josephson phase qubits. The broken-parity symmetries of bound states in flux-biased Josephson junctions are utilized to conveniently generate the desirable Stark shifts. Then, assisted by various transition pulses, universal quantum logic gates as well as arbitrary quantum state preparations can be implemented. Compared with the usual {pi}-pulse operations widely used in experiments, the adiabatic population passages proposed here are insensitive to the details of the applied pulses and thus the desirable population transfers can be satisfyingly implemented. The experimental feasibility of the proposal is also discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation

The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-level benchmark suite and insightful evaluation metrics for characterizing the properties of prototype NISQ devices, the efficiency of QC programming compilers, schedulers and assemblers, and the capability of quantum system simulators in a classical computer. In this work, we fill this gap by proposing a low-level, easy-to-use benchmark suite called QASMBench based on the OpenQASM assembly representation. It consolidates commonly used quantum routines and kernels from a variety of domains including chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography, and so on, trading-off between generality and usability. To analyze these kernels in terms of NISQ device execution, in addition to circuit width and depth, we propose four circuit metrics including gate density, retention lifespan, measurement density, and entanglement variance, to extract more insights about the execution efficiency, the susceptibility to NISQ error, and the potential gain from machine-specific optimizations. Applications in QASMBench can be launched and verified on several NISQ platforms, including IBM-Q, Rigetti, IonQ and Quantinuum. For evaluation, we measure the execution fidelity of a subset of QASMBench applications on 12 IBM-Q machines through density matrix state tomography, comprising 25K circuit evaluations. In addition we also compare the fidelity of executions among the IBM-Q machines, the IonQ QPU and the Rigetti Aspen M-1 system.

97 MATHEMATICS AND COMPUTING↗

Quantum electrodynamics in a whispering-gallery microcavity coated with a polymer nanolayer

Quasi-transverse-electric and -transverse-magnetic fundamental whispering gallery modes in a polymer-coated silica microtoroid are theoretically investigated and demonstrated to possess very high-quality factors. The existence of a nanometer-thickness layer not only evidently reduces the cavity mode volume but also draws the maximal electric field's position of the mode to the outside of the silica toroid, where single quantum dots or nanocrystals are located. Both effects result in a strongly enhanced coherent interaction between a single dipole (for example, a single defect center in a diamond crystal) and the quantized cavity mode. Since the coated microtoroid is highly feasible and robust in experiments, it may offer an excellent platform to study strong-coupling cavity quantum electrodynamics, quantum information, and quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum logic gates based on ballistic transport in graphene

The paper presents various configurations for the implementation of graphene-based Hadamard, C-phase, controlled-NOT, and Toffoli gates working at room temperature. These logic gates, essential for any quantum computing algorithm, involve ballistic graphene devices for qubit generation and processing and can be fabricated using existing nanolithographical techniques. All quantum gate configurations are based on the very large mean-free-paths of carriers in graphene at room temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward demonstrating controlled-X operation based on continuous-variable four-partite cluster states and quantum teleporters

One-way quantum computation based on measurement and multipartite cluster entanglement offers the ability to perform a variety of unitary operations only through different choices of measurement bases. Here we present an experimental study toward demonstrating the controlled-X operation, a two-mode gate in which continuous variable (CV) four-partite cluster states of optical modes are utilized. Two quantum teleportation elements are used for achieving the gate operation of the quantum state transformation from input target and control states to output states. By means of the optical cluster state prepared off-line, the homodyne detection and electronic feeding forward, the information carried by the input control state is transformed to the output target state. The presented scheme of the controlled-X operation based on teleportation can be implemented nonlocally and deterministically. The distortion of the quantum information resulting from the imperfect cluster entanglement is estimated with the fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal quantum entanglement between an oscillator and continuous fields

Quantum entanglement has been actively sought in optomechanical and electromechanical systems. The simplest system is a mechanical oscillator interacting with a coherent optical field, while the oscillator also suffers from thermal decoherence. With a rigorous functional analysis, we develop a mathematical framework for treating quantum entanglement that involves infinite degrees of freedom. We show that the quantum entanglement is always present between the oscillator and continuous optical field--even when the environmental temperature is high and the oscillator is highly classical. Such a universal entanglement is also shown to be able to survive more than one mechanical oscillation period if the characteristic frequency of the optomechanical interaction is larger than that of the thermal noise. In addition, we introduce effective optical modes that are ordered by the entanglement strength to better understand the entanglement structure, analogously to the energy spectrum of an atomic system. In particular, we derive the optical mode that is maximally entangled with the mechanical oscillator, which will be useful for future quantum computing and encoding information into mechanical degrees of freedom.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗