Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Language
      Language
      Clear All
      Language
  • Subject
      Subject
      Clear All
      Subject
  • Item Type
      Item Type
      Clear All
      Item Type
  • Discipline
      Discipline
      Clear All
      Discipline
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
47 result(s) for "Berkley, Andrew J."
Sort by:
Quantum critical dynamics in a 5,000-qubit programmable spin glass
Experiments on disordered alloys 1 – 3 suggest that spin glasses can be brought into low-energy states faster by annealing quantum fluctuations than by conventional thermal annealing. Owing to the importance of spin glasses as a paradigmatic computational testbed, reproducing this phenomenon in a programmable system has remained a central challenge in quantum optimization 4 – 13 . Here we achieve this goal by realizing quantum-critical spin-glass dynamics on thousands of qubits with a superconducting quantum annealer. We first demonstrate quantitative agreement between quantum annealing and time evolution of the Schrödinger equation in small spin glasses. We then measure dynamics in three-dimensional spin glasses on thousands of qubits, for which classical simulation of many-body quantum dynamics is intractable. We extract critical exponents that clearly distinguish quantum annealing from the slower stochastic dynamics of analogous Monte Carlo algorithms, providing both theoretical and experimental support for large-scale quantum simulation and a scaling advantage in energy optimization. Using a quantum annealing processor to study three-dimensional spin glasses demonstrates an accurate large-scale quantum simulation of critical dynamics and a scaling advantage over analogous classical methods for energy optimization.
Coherent quantum annealing in a programmable 2,000 qubit Ising chain
Quantum simulation has emerged as a valuable arena for demonstrating and understanding the capabilities of near-term quantum computers 1 – 3 . Quantum annealing 4 , 5 has been successfully used in simulating a range of open quantum systems, both at equilibrium 6 – 8 and out of equilibrium 9 – 11 . However, in all previous experiments, annealing has been too slow to coherently simulate a closed quantum system, due to the onset of thermal effects from the environment. Here we demonstrate coherent evolution through a quantum phase transition in the paradigmatic setting of a one-dimensional transverse-field Ising chain, using up to 2,000 superconducting flux qubits in a programmable quantum annealer. In large systems, we observe the quantum Kibble–Zurek mechanism with theoretically predicted kink statistics, as well as characteristic positive kink–kink correlations, independent of temperature. In small chains, excitation statistics validate the picture of a Landau–Zener transition at a minimum gap. In both cases, the results are in quantitative agreement with analytical solutions to the closed-system quantum model. For slower anneals, we observe anti-Kibble–Zurek scaling in a crossover to the open quantum regime. The coherent dynamics of large-scale quantum annealers demonstrated here can be exploited to perform approximate quantum optimization, machine learning and simulation tasks. The coherent dynamics of the transverse-field Ising model driven through a quantum phase transition can be accurately simulated using a large-scale quantum annealer.
Scaling advantage over path-integral Monte Carlo in quantum simulation of geometrically frustrated magnets
The promise of quantum computing lies in harnessing programmable quantum devices for practical applications such as efficient simulation of quantum materials and condensed matter systems. One important task is the simulation of geometrically frustrated magnets in which topological phenomena can emerge from competition between quantum and thermal fluctuations. Here we report on experimental observations of equilibration in such simulations, measured on up to 1440 qubits with microsecond resolution. By initializing the system in a state with topological obstruction, we observe quantum annealing (QA) equilibration timescales in excess of one microsecond. Measurements indicate a dynamical advantage in the quantum simulation compared with spatially local update dynamics of path-integral Monte Carlo (PIMC). The advantage increases with both system size and inverse temperature, exceeding a million-fold speedup over an efficient CPU implementation. PIMC is a leading classical method for such simulations, and a scaling advantage of this type was recently shown to be impossible in certain restricted settings. This is therefore an important piece of experimental evidence that PIMC does not simulate QA dynamics even for sign-problem-free Hamiltonians, and that near-term quantum devices can be used to accelerate computational tasks of practical relevance. Experimental demonstration of quantum speedup that scales with the system size is the goal of near-term quantum computing. Here, the authors demonstrate such scaling advantage for a D-Wave quantum annealer over analogous classical algorithms in simulations of frustrated quantum magnets.
Quantum error mitigation in quantum annealing
Quantum error mitigation (QEM) presents a promising near-term approach to reducing errors when estimating expectation values in quantum computing. Here, we introduce QEM techniques tailored for quantum annealing, using zero-noise extrapolation (ZNE). We implement ZNE through zero-temperature and zero-time extrapolations. The practical zero-time extrapolation developed exploits the Kibble-Zurek mechanism so that only problem-Hamiltonian rescaling is required. We conduct experimental investigations into the quantum critical and post-critical dynamics of a transverse-field Ising spin chain by examining statistics with weak and strong post-critical dynamics. We demonstrate successful mitigation of thermal noise and non-thermal errors through both of these extrapolation techniques.
Hybrid quantum annealing for larger-than-QPU lattice-structured problems
Quantum processing units (QPUs) executing annealing algorithms have shown promise in optimization and simulation applications. Hybrid algorithms are a natural bridge to additional applications of larger scale. We present a straightforward and effective method for solving larger-than-QPU lattice-structured Ising optimization problems. Performance is compared against simulated annealing with promising results, and improvement is shown as a function of the generation of D-Wave QPU used.
Quantum critical dynamics in a 5000-qubit programmable spin glass
Experiments on disordered alloys suggest that spin glasses can be brought into low-energy states faster by annealing quantum fluctuations than by conventional thermal annealing. Due to the importance of spin glasses as a paradigmatic computational testbed, reproducing this phenomenon in a programmable system has remained a central challenge in quantum optimization. Here we achieve this goal by realizing quantum critical spin-glass dynamics on thousands of qubits with a superconducting quantum annealer. We first demonstrate quantitative agreement between quantum annealing and time-evolution of the Schr\"odinger equation in small spin glasses. We then measure dynamics in 3D spin glasses on thousands of qubits, where simulation of many-body quantum dynamics is intractable. We extract critical exponents that clearly distinguish quantum annealing from the slower stochastic dynamics of analogous Monte Carlo algorithms, providing both theoretical and experimental support for a scaling advantage in reducing energy as a function of annealing time.
Coherent quantum annealing in a programmable 2000-qubit Ising chain
Quantum simulation has emerged as a valuable arena for demonstrating and understanding the capabilities of near-term quantum computers. Quantum annealing has been used successfully in simulating a range of open quantum systems, both at equilibrium and out of equilibrium. However, in all previous experiments, annealing has been too slow to simulate a closed quantum system coherently, due to the onset of thermal effects from the environment. Here we demonstrate coherent evolution through a quantum phase transition in the paradigmatic setting of the 1D transverse-field Ising chain, using up to 2000 superconducting flux qubits in a programmable quantum annealer. In large systems we observe the quantum Kibble-Zurek mechanism with theoretically predicted kink statistics, as well as characteristic positive kink-kink correlations, independent of system temperature. In small chains, excitation statistics validate the picture of a Landau-Zener transition at a minimum gap. In both cases, results are in quantitative agreement with analytical solutions to the closed-system quantum model. For slower anneals we observe anti-Kibble-Zurek scaling in a crossover to the open quantum regime. These experiments demonstrate that large-scale quantum annealers can be operated coherently, paving the way to exploiting coherent dynamics in quantum optimization, machine learning, and simulation tasks.
Quantum error mitigation in quantum annealing
Quantum Error Mitigation (QEM) presents a promising near-term approach to reduce error when estimating expectation values in quantum computing. Here, we introduce QEM techniques tailored for quantum annealing, using Zero-Noise Extrapolation (ZNE). We implement ZNE through zero-temperature extrapolation as well as energy-time rescaling. We conduct experimental investigations into the quantum critical dynamics of a transverse-field Ising spin chain, demonstrating the successful mitigation of thermal noise through both of these techniques. Moreover, we show that energy-time rescaling effectively mitigates control errors in the coherent regime where the effect of thermal noise is minimal. Our ZNE results agree with exact calculations of the coherent evolution over a range of annealing times that exceeds the coherent annealing range by almost an order of magnitude.
A Josephson junction qubit
I studied the Josephson junction system in the context of its usability for quantum computation. The zero-voltage state of a Josephson junction biased with constant current has a set of metastable quantum energy levels. In principle, it should be possible to use the two lowest states as a qubit for a quantum computer, provided both the dissipation time and coherence time of this qubit can be made long enough. I present a scheme for resistively isolating a Josephson junction to increase its dissipation time. I fabricated and measured a prototype system and showed that the constraints of heating in conjunction with high-frequency design requirements make it unlikely that this isolation method will lead to the coherence times required for quantum computation. I then discuss a resonant isolation method that I used to successfully increase the dissipation time of a Josephson junction qubit. I performed spectroscopic measurements at low temperatures to find the coherence time of resonantly isolated 100 μm2 Al/AlOx/Al and Nb/AlOx/Nb junctions with critical currents of roughly 10 μA. The results of these measurements reveal two mechanisms beyond spontaneous emission for decoherence: low-frequency current noise and tunneling to the voltage state. To explain these results on decoherence, I present a model based on the Bloch equations. Going beyond a single qubit, I designed a capacitively coupled two-qubit system. Using spectroscopy, I showed that the energy level spacings between the ground state and the excited entangled states of the system agree with those calculated from the Schrödinger equation.
Computational supremacy in quantum simulation
Quantum computers hold the promise of solving certain problems that lie beyond the reach of conventional computers. Establishing this capability, especially for impactful and meaningful problems, remains a central challenge. One such problem is the simulation of nonequilibrium dynamics of a magnetic spin system quenched through a quantum phase transition. State-of-the-art classical simulations demand resources that grow exponentially with system size. Here we show that superconducting quantum annealing processors can rapidly generate samples in close agreement with solutions of the Schr\"odinger equation. We demonstrate area-law scaling of entanglement in the model quench in two-, three- and infinite-dimensional spin glasses, supporting the observed stretched-exponential scaling of effort for classical approaches. We assess approximate methods based on tensor networks and neural networks and conclude that no known approach can achieve the same accuracy as the quantum annealer within a reasonable timeframe. Thus quantum annealers can answer questions of practical importance that classical computers cannot.