• Corpus ID: 236924542

Architectural considerations in the design of a third-generation superconducting quantum annealing processor

  title={Architectural considerations in the design of a third-generation superconducting quantum annealing processor},
  author={K. Boothby and C. Enderud and Trevor Lanting and Reza Molavi and N. Tsai and Mark H. Volkmann and F. Altomare and Mohammad H. S. Amin and Michael Babcock and Andrew J. Berkley and Catia Baron Aznar and Martin Boschnak and Holly Christiani and Sara Ejtemaee and Bram Evert and Matthew Gullen and Markus Hager and Richard G. Harris and E. Hoskinson and Jeremy P. Hilton and Kais Jooya and Ann Huang and Mark W. Johnson and Andrew D. King and Eric Ladizinsky and Ryan Li and Allison MacDonald and Teresa Medina Fernandez and Richard Bryon Neufeld and Mana Norouzpour and Travis Oh and Isil Ozfidan and Paul Paddon and I. G. Perminov and Gabriel Poulin-Lamarre and Thomas H. Prescott and Jack Raymond and Mauricio Reis and Chris Rich and Aidan Roy and Hossein Sadeghi Esfahani and Yuki Sato and Benjamin Sheldan and Anatoly Yu Smirnov and Loren J. Swenson and Jed D Whittaker and Jason J. Yao and Alexander G. Yarovoy and Paul I. Bunyk},
Kelly Boothby, Colin Enderud, Trevor Lanting, Reza Molavi, Nicholas Tsai, Mark H. Volkmann, Fabio Altomare, Mohammad H. Amin, Michael Babcock, Andrew J. Berkley, Catia Baron Aznar, Martin Boschnak, Holly Christiani, Sara Ejtemaee, Bram Evert, Matthew Gullen, Markus Hager, Richard Harris, Emile Hoskinson, Jeremy P. Hilton, Kais Jooya, Ann Huang, Mark W. Johnson, Andrew D. King, Eric Ladizinsky, Ryan Li, Allison MacDonald, Teresa Medina Fernandez, Richard Neufeld, Mana Norouzpour, Travis Oh, Isil… 

Figures from this paper

Challenge: A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks

The quantitative analysis predicts that with quantum hardware operating at a 140 μs problem latency and 4.3M qubits, quantum computation will achieve a spectral efficiency equal to silicon while reducing power consumption by 40.8 kW in a representative 5G base station scenario.

A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks

This paper gathers and synthesizes insights on power consumption, computational throughput and latency, spectral efficiency, operational cost, and feasibility timelines surrounding quantum technology, and project the quantitative performance targets future quantum annealing hardware must meet in order to provide a computational and power advantage over CMOS hardware, while matching its whole-network spectral efficiency.

Wasserstein Solution Quality and the Quantum Approximate Optimization Algorithm: A Portfolio Optimization Case Study

Derivative-requiring and derivative-free classical optimizers are benchmarked on the basis of the achieved η beyond p = 1 to find that derivative- free optimizer are generally more effective for the given computational resources, problem sizes and circuit depths.

A QUBO Formulation for Minimum Loss Spanning Tree Reconfiguration Problems in Electric Power Networks

A novel quadratic unconstrained binary optimization (QUBO) formulation for a classical problem in electrical engineering – the optimal reconfiguration of distribution grids and has the goal of being very efficient in terms of variables usage.

Quantum orders in the frustrated Ising model on the bathroom tile lattice

We determine the zero and finite temperature phase diagram of the fully frustrated quantum Ising model on the bathroom tile (4-8) lattice. The phase diagram exhibits a wealth of 2+1d physics,



Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor

A new ultralow-power embedded superconducting digital-to-analog flux converter (DAC) is developed used to program the processor with zero static power dissipation, optimized to achieve maximum flux storage density per unit area.

Phase transitions in a programmable quantum spin glass simulator

The ability to control and read out the state of individual spins provides direct access to several order parameters, which were used to determine the lattice’s magnetic phases as well as critical disorder and one of its universal exponents.

Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design

  • V. Choi
  • Mathematics, Computer Science
    Quantum Inf. Process.
  • 2011
The intertwined adiabatic quantum architecture design problem, which is to construct a hardware graph U that satisfies all known physical constraints and, at the same time, permits an efficient minor-embedding algorithm, is described.

Minor-embedding in adiabatic quantum computation: I. The parameter setting problem

  • V. Choi
  • Computer Science, Physics
    Quantum Inf. Process.
  • 2008
The embedded Ising Hamiltonian for solving the maximum independent set (MIS) problem via adiabatic quantum computation (AQC) using an Ising spin-1/2 system is demonstrated.

Frequency and sensitivity tunable microresonator array for high-speed quantum processor readout

Superconducting microresonators have been successfully utilized as detection elements for a wide variety of applications. With multiplexing factors exceeding 1000 detectors per transmission line,

A scalable control system for a superconducting adiabatic quantum optimization processor

We have designed, fabricated and operated a scalable system for applying independently programmable time-independent, and limited time-dependent flux biases to control superconducting devices in an

Next-Generation Topology of D-Wave Quantum Processors

This paper presents an overview of the topology of D-Wave's next-generation quantum processors. It provides examples of minor embeddings and discusses performance of embedding algorithms for the new

Observation of topological phenomena in a programmable lattice of 1,800 qubits

A large-scale programmable quantum simulation is described, using a D-Wave quantum processor to simulate a two-dimensional magnetic lattice in the vicinity of a topological phase transition.

Three state signaling system

  • Mar. 1982.
  • 1982