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,117 records · Page 62

Demonstration of superconducting micromachined cavities

Superconducting enclosures will be key components of scalable quantum computing devices based on circuit quantum electrodynamics. Within a densely integrated device, they can protect qubits from noise and serve as quantum memory units. Whether constructed by machining bulk pieces of metal or microfabricating wafers, 3D enclosures are typically assembled from two or more parts. The resulting seams potentially dissipate crossing currents and limit performance. In this letter, we present measured quality factors of superconducting cavity resonators of several materials, dimensions, and seam locations. We observe that superconducting indium can be a low-loss RF conductor and form low-loss seams. Leveraging this, we create a superconducting micromachined resonator with indium that has a quality factor of two million, despite a greatly reduced mode volume. Inter-layer coupling to this type of resonator is achieved by an aperture located under a planar transmission line. The described techniques demonstrate a proof-of-principle for multilayer microwave integrated quantum circuits for scalable quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Workforce Development at Lawrence Livermore National Laboratory

The students applying to LLNL that are interested in quantum computing are being brought up with a universal quantum algorithm experience. The candidates we see have played with Qiskit or the IBM experience, they understand spin dynamics, and a few of them have attended hackathons by Rigetti or another company. These students have all been exposed to universal quantum computing, but not quantum engineering, quantum hardware, or even descriptions of noise. This is in a large part due to the simplified interface in current commercial quantum systems. To broaden the applicant pool, we have begun collaborating with several institutions to train quantum scientists and engineers. We are using the LLNL whitebox approach to testbed access in order to give students a look under the hood of quantum computing operations because that is what we desire in research scientists.

42 ENGINEERING↗

A variational eigenvalue solver on a photonic quantum processor

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansa¨tze and classical optimization. We implement the algorithm by combining a highly reconfigurable photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H þ . The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-time quantum calculations of phase shifts using wave packet time delays

We present a method to extract the phase shift of a scattering process using the real-time evolution in the early and intermediate stages of the collision in order to estimate the time delay of a wave packet. This procedure is convenient when using noisy quantum computers for which the asymptotic out-state behavior is unreachable. We demonstrate that the challenging Fourier transforms involved in the state preparation and measurements can be implemented in 1+1 dimensions with current trapped ion devices and IBM quantum computers. We compare quantum computations of the time delays obtained in the one-particle quantum mechanics limit and the scalable quantum field theory formulation with accurate numerical results. We discuss the finite volume effects in the Wigner formula connecting time delays to phase shifts. The results reported involve two- and four-qubit calculations, and we discuss the possibility of larger scale computations in the near future.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computer-automated tuning procedures for semiconductor quantum dot arrays

As with any quantum computing platform, semiconductor quantum dot devices require sophisticated hardware and controls for operation. The increasing complexity of quantum dot devices necessitates the advancement of automated control software and image recognition techniques for rapidly evaluating charge stability diagrams. We use an image analysis toolbox developed in Python to automate the calibration of virtual gates, a process that previously involved a large amount of user intervention. Moreover, we show that straightforward feedback protocols can be used to simultaneously tune multiple tunnel couplings in a triple quantum dot in a computer automated fashion. Finally, we adopt the use of a “tunnel coupling lever arm” to model the interdot barrier gate response and discuss how it can be used to more rapidly tune interdot tunnel couplings to the gigahertz values that are compatible with exchange gates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Simulation of Molecular Dynamics Processes─A Benchmark Study Using a Classical Simulator and Present-Day Quantum Hardware

Here, we explore how the fundamental problems in quantum molecular dynamics can be modeled using classical simulators (emulators) of quantum computers and the actual quantum hardware available to us today. The list of problems we tackle includes propagation of a free wave packet, vibration of a harmonic oscillator, and tunneling through a barrier. Each of these problems starts with the initial wave packet setup. Although Qiskit provides a general method for initializing wave functions, in most cases it generates deep quantum circuits. While these circuits perform well on noiseless simulators, they suffer from excessive noise on quantum hardware. To overcome this issue, we designed a shallower quantum circuit for preparing a Gaussian-like initial wave packet, which improves the performance of real hardware. Next, quantum circuits are implemented to apply the kinetic and potential energy operators for the evolution of a wave function over time. The results of our modeling on classical emulators of quantum hardware agree perfectly with the results obtained using the traditional (classical) methods. This serves as a benchmark and demonstrates that the quantum algorithms and Qiskit codes we developed are accurate. However, the results obtained on the actual quantum hardware available today, such as IBM’s superconducting qubits and IonQ’s trapped ions, indicate large discrepancies due to hardware limitations. This work highlights both the potential and challenges of using quantum computers to solve fundamental quantum molecular dynamics problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A programmable two-qubit quantum processor in silicon

Now that it is possible to achieve measurement and control fidelities for individual quantum bits (qubits) above the threshold for fault tolerance, attention is moving towards the difficult task of scaling up the number of physical qubits to the large numbers that are needed for fault-tolerant quantum computing (1,2). In this context, quantum-dot-based spin qubits could have substantial advantages over other types of qubit owing to their potential for all-electrical operation and ability to be integrated at high density onto an industrial platform (3,4,5). Initialization, readout and single- and two-qubit gates have been demonstrated in various quantum-dot-based qubit representations (6,7,8,9). However, as seen with small-scale demonstrations of quantum computers using other types of qubit (10,11,12,13), combining these elements leads to challenges related to qubit crosstalk, state leakage, calibration and control hardware. We overcome these challenges by using carefully designed control techniques to demonstrate a programmable two-qubit quantum processor in a silicon device that can perform the Deutsch–Josza algorithm and the Grover search algorithm—canonical examples of quantum algorithms that outperform their classical analogues. We characterize the entanglement in our processor by using quantum-state tomography of Bell states, measuring state fidelities of 85–89 per cent and concurrences of 73–82 per cent. These results pave the way for larger-scale quantum computers that use spins confined to quantum dots.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Anti-$\mathscr{PT}$-symmetric qubit: Decoherence and entanglement entropy

We investigate the dynamics of a general two-level based anti-parity-time (anti-$\mathscr{PT}$)-symmetric qubit and study its decoherence as well as entanglement entropy properties. We compare our findings with that of the corresponding parity-time ($\mathscr{PT}$)-symmetric and Hermitian qubits. To begin, we consider the time-dependent Dyson map to find the exact analytical dynamics for a general non-Hermitian qubit system weakly coupled with a thermal bath for pure dephasing, before specializing it to the case of a general anti-$\mathscr{PT}$-symmetric qubit. Basing the comparison under the same coupling strength or increasing the non-Hermiticity, we observe that the decoherence function and entanglement entropy of the anti-$\mathscr{PT}$-symmetric qubit decays and grows more slowly, respectively, compared to the $\mathscr{PT}$-symmetric and Hermitian qubits. Similarly, the corresponding variance and area of Fisher information are much higher compared to the $\mathscr{PT}$-symmetric and Hermitian qubits. These results demonstrate that anti-$\mathscr{PT}$-symmetric qubits may be better suited for quantum computing and quantum information processing applications than conventional Hermitian or even $\mathscr{PT}$-symmetric qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Feedback-based quantum algorithm inspired by counterdiabatic driving

In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to iteratively construct quantum circuits. Here, we propose a substantial enhancement by implementing a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our approach introduces an additional control field inspired by counterdiabatic driving. We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable acceleration in population transfer to low-energy states within a significantly reduced time frame compared to conventional feedback-based quantum algorithms. This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation. We validate our algorithm on the IBM cloud computer, highlighting its efficacy in expediting quantum computations for many-body systems and combinatorial optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Scalable quantum information processing with atomic ensembles and flying photons

We present a scheme for scalable quantum information processing with atomic ensembles and flying photons. Using the Rydberg blockade, we encode the qubits in the collective atomic states, which could be manipulated fast and easily due to the enhanced interaction in comparison to the single-atom case. We demonstrate that our proposed gating could be applied to generation of two-dimensional cluster states for measurement-based quantum computation. Moreover, the atomic ensembles also function as quantum repeaters useful for long-distance quantum state transfer. We show the possibility of our scheme to work in bad cavity or in weak coupling regime, which could much relax the experimental requirement. The efficient coherent operations on the ensemble qubits enable our scheme to be switchable between quantum computation and quantum communication using atomic ensembles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Algorithm for High Energy Physics Simulations

Simulating quantum field theories is a flagship application of quantum computing. However, calculating experimentally relevant high energy scattering amplitudes entirely on a quantum computer is prohibitively difficult. It is well known that such high energy scattering processes can be factored into pieces that can be computed using well established perturbative techniques, and pieces which currently have to be simulated using classical Markov chain algorithms. These classical Markov chain simulation approaches work well to capture many of the salient features, but cannot capture all quantum effects. To exploit quantum resources in the most efficient way, we introduce a new paradigm for quantum algorithms in field theories. This approach uses quantum computers only for those parts of the problem which are not computable using existing techniques. In particular, we develop a polynomial time quantum final state shower that accurately models the effects of intermediate spin states similar to those present in high energy electroweak showers with a global evolution variable. The algorithm is explicitly demonstrated for a simplified quantum field theory on a quantum computer.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory

With a focus on universal quantum computing for quantum simulation, and through the example of lattice gauge theories, we introduce rather general quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple (bosonic and fermionic) quantum numbers with non-trivial functional coefficients. In particular, we analyze diagonalization of Hamiltonian terms using a singular-value decomposition technique, and discuss how the achieved diagonal unitaries in the digitized time-evolution operator can be implemented. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions, for which a complete quantum-resource analysis within different computational models is presented. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories. The example chosen further demonstrates the importance of adopting efficient theoretical formulations: it is shown that an explicitly gauge-invariant formulation using loop, string, and hadron degrees of freedom simplifies the algorithms and lowers the cost compared with the standard formulations based on angular-momentum as well as the Schwinger-boson degrees of freedom. The loop-string-hadron formulation further retains the non-Abelian gauge symmetry despite the inexactness of the digitized simulation, without the need for costly controlled operations. Such theoretical and algorithmic considerations are likely to be essential in quantumly simulating other complex theories of relevance to nature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum-Hardware Focused Application Performance Benchmarks (Final Technical Report)

Quantum computers promise to transform how we do scientific calculations. In this project, we benchmark different current quantum computers for solving chemistry problems and find ways to build noise-resilient implementations. We also use the characterization techniques developed to test ion trap quantum computers.

74 ATOMIC AND MOLECULAR PHYSICS↗

Computing molecular excited states on a D-Wave quantum annealer

Abstract The possibility of using quantum computers for electronic structure calculations has opened up a promising avenue for computational chemistry. Towards this direction, numerous algorithmic advances have been made in the last five years. The potential of quantum annealers, which are the prototypes of adiabatic quantum computers, is yet to be fully explored. In this work, we demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems. These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience. The excited states are treated using two methods, time-dependent Hartree–Fock (TDHF) and time-dependent density-functional theory (TDDFT), both within a commonly used Tamm–Dancoff approximation (TDA). The resulting TDA eigenvalue equations are solved on a D-Wave quantum annealer using the Quantum Annealer Eigensolver (QAE), developed previously. The method is shown to reproduce a typical basis set convergence on the example $$\hbox {H}_2$$ H 2 molecule and is also applied to several other molecular species. Characteristic properties such as transition dipole moments and oscillator strengths are computed as well. Three potential energy profiles for excited states are computed for $$\hbox {NH}_3$$ NH 3 as a function of the molecular geometry. Similar to previous studies, the accuracy of the method is dependent on the accuracy of the intermediate meta-heuristic software called qbsolv.

74 ATOMIC AND MOLECULAR PHYSICS↗

Boson sampling with Gaussian input states: Toward efficient scaling and certification

A universal quantum computer of large scale is not available yet, however, intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage over classical computing and could challenge the Extended Church-Turing Thesis. One of these models based on single photons interacting via linear optics is called Boson Sampling. Although Boson Sampling was demonstrated and the threshold to claim quantum computational advantage was achieved, the question of how to scale up Boson Sampling experiments remains. To make progress with this problem, here we present a practically achievable pathway to scale Boson Sampling experiments by combining continuous-variable quantum information and temporal encoding. Here, we propose the combination of switchable dual-homodyne and single-photon detections, the temporal loop technique, and scattershot-based Boson Sampling. We detail the required assumptions for concluding computational hardness for this configuration. Furthermore, this particular combination of techniques moves towards an efficient scaling and certification of Boson Sampling, all in a single experimental setup.

79 ASTRONOMY AND ASTROPHYSICS↗

Towards Practical Quantum Simulation for High Energy Physics (Final report for DE-SC0019452)

Quantum computing offers the potential of transformative improvements in our ability to simulate strongly interacting quantum systems. Each application area of quantum simulation requires careful study and new insights to determine the potential advantages of quantum computation. In particular, high energy physics and quantum field theory present specific challenges to existing approaches. In this project we studied quantum simulation in the light-front formulation of quantum field theory. In this formulation, quantum field theory more closely resembles other many-body quantum systems such as quantum chemistry, which are well studied from the perspective of quantum computation. We considered applications suitable for both near term and future error-corrected quantum computers.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Qubit addressing using hyperfine-interaction control by an electric field in a magnetic crystal

We demonstrate experimentally the hyperfine-interaction control by an electric field, which is the operating principle of the addressable qubit operation in a silicon-based solid-state quantum computer in a new quantum computer system, a magnetic crystal. The transferred hyperfine field at a F{sup -} nucleus caused by neighboring Mn{sup 2+} electron spins in an antiferromagnetic MnF{sub 2} single crystal was measured by {sup 19}F nuclear magnetic resonance (NMR) with an external electric field applied along the [110] crystal direction. The electric field splits the {sup 19}F NMR peak into two resolved lines that come from the F nuclei located at geometrically equivalent sites. A line splitting of 56 kHz was achieved at an electric field of 3.4 V/{mu}m. One of the F{sup -} nuclear spins could be flipped selectively by a composite radio-frequency pulse while leaving the other unchanged, thereby demonstrating qubit addressing via electric field control of the hyperfine interaction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗