2019 · 371 citations · 37 references
ComputingComputer EngineeringComputer ScienceCompilersFault ToleranceQuantum ComputingQuantum AlgorithmsQuantum BitsQuantum CircuitsQuantum CompilationQuantum ComputationQuantum Hardware ArchitecturesCoherence TimeCompiler DesignError Correction CircuitsHigh-level Intermediate RepresentationIntermediate Representation DesignQuantum Circuit CompilationQuantum Compilation For Fault-tolerant Quantum ComputingQuantum Computing Architecture
A massive gap exists between current quantum computing (QC) prototypes, and the size and scale required for many proposed QC algorithms. Current QC implementations are prone to noise and variability which affect their reliability, and yet with less than 80 quantum bits (qubits) total, they are too resource-constrained to implement error correction. The term Noisy Intermediate-Scale Quantum (NISQ) refers to these current and near-term systems of 1000 qubits or less. Given NISQ's severe resource constraints, low reliability, and high variability in physical characteristics such as coherence time or error rates, it is of pressing importance to map computations onto them in ways that use resources efficiently and maximize the likelihood of successful runs. This paper proposes and evaluates backend compiler approaches to map and optimize high-level QC programs to execute with high reliability on NISQ systems with diverse hardware characteristics. Our techniques all start from an LLVM intermediate representation of the quantum program (such as would be generated from high-level QC languages like Scaffold) and generate QC executables runnable on the IBM Q public QC machine. We then use this framework to implement and evaluate several optimal and heuristic mapping methods. These methods vary in how they account for the availability of dynamic machine calibration data, the relative importance of various noise parameters, the different possible routing strategies, and the relative importance of compile-time scalability versus runtime success. Using real-system measurements, we show that fine grained spatial and temporal variations in hardware parameters can be exploited to obtain an average 2.9x (and up to 18x) improvement in program success rate over the industry standard IBM Qiskit compiler. Despite small qubit counts, NISQ systems will soon be large enough to demonstrate "quantum supremacy", i.e., an advantage over classical computing. Tools like ours provide significant improvements in program reliability and execution time, and offer high leverage in accelerating progress towards quantum supremacy.
37
Quantum Computing in the NISQ era and beyond
John Preskill · Quantum · 2018 · 8.2K citations · Full text
Computing, Computer Science, Physics +17
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod R. McClean, Peter Shadbolt et al. · Nature Communications · 2014 · 4.6K citations · Full text
Natural Sciences, Chemistry, Physics +17
Jacob Biamonte, Péter Wittek, Nicola Pancotti et al. · Nature · 2017 · 4.4K citations · Full text
Ethan Bernstein, Umesh Vazirani · 1993 · 1.3K citations