AccQOC: Accelerating Quantum Optimal Control Based Pulse Generation

  title={AccQOC: Accelerating Quantum Optimal Control Based Pulse Generation},
  author={Jinglei Cheng and Haoqing Deng and Xuehai Qian},
  journal={2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA)},
In the last decades, we have witnessed the rapid growth of Quantum Computing. In the current Noisy Intermediate-Scale Quantum (NISQ) era, the capability of a quantum machine is limited by the decoherence time, gate fidelity and the number of Qubits. Current quantum computing applications are far from the real “quantum supremacy” due to the fragile physical Qubits, which can only be entangled for a few microseconds. Recent works use quantum optimal control to reduce the latency of quantum… 
QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits
This paper proposes QuantumNAS, a comprehensive framework for noise-adaptive co-search of the variational circuit and qubit mapping and introduces a novel SuperCircuit, which significantly outperforms noise-unaware search, human, random, and existing noiseadaptive qu bit mapping baselines.
Optimizing Noisy-Intermediate Scale Quantum Circuits: A Block-Based Synthesis
A hierarchical, block-by-block optimization framework, QGo, for quantum circuit optimization that can reduce the number of CNOT gates by 29.9% on average and up to 50% when compared with industrial compilers such as t|ket>.
Optimized Quantum Compilation for Near-Term Algorithms with OpenPulse
A compiler is introduced that exploits direct control at this microarchitectural level to achieve significant improvements for quantum programs, and achieves both 1.6x lower error rates and 2x faster execution time, relative to standard gate-based compilation.
Paulihedral: a generalized block-wise compiler optimization framework for Quantum simulation kernels
Experimental results show that Paulihedral can outperform state-of-the-art compiler infrastructures in a wide-range of applications on both near-term superconducting quantum processors and future fault-tolerant quantum computers.
Can Noise on Qubits Be Learned in Quantum Neural Network? A Case Study on QuantumFlow (Invited Paper)
This paper targets quantum neural network (QNN), and proposes to learn the errors in the training phase, so that the identified QNN model can be resilient to noise, and can optimize QNN models for different errors in qubits.
TQSim: A Case for Reuse-Focused Tree-Based Quantum Circuit Simulation
A noisy simulation technique called Tree-Based Quantum Circuit Simulation (TQSim), which exploits the reusability of the intermediate results during the noisy simulation and reduces computation.
Quantum Codesign
What codesign means in a QC setting is discussed, examples of its value to QC are given, and key attributes of QC codesign approaches going forward are proposed.
Variational Quantum Pulse Learning
Inspired by the promising performance of VQC, this paper proposes variational quantum pulses (VQP), a novel paradigm to directly train quantum pulses for learning tasks and maintains the robustness to noise on Noisy Intermediate-Scale Quantum (NISQ) computers.
QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
This paper proposes a hierarchical, block-by-block opti- mization framework, QGo, for quantum circuit optimization that allows an exponential cost optimization to scale to large circuits and demonstrates the scalability of the QGo technique to optimize circuits of 60+ qubits.


Characterizing quantum supremacy in near-term devices
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
A SWAP-based Bidirectional heuristic search algorithm (SABRE) is proposed, applicable to NISQ devices with arbitrary connections between qubits, which outperforms the best known algorithm with exponential speedup and comparable or better results on various benchmarks.
Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
This work proposes two strategies for partial compilation, exploiting the structure of variational circuits to pre-compile optimal pulses for specific blocks of gates, and indicates significant pulse speedups ranging from 1.5x-3x in typical benchmarks, with only a small fraction of the compilation latency of GRAPE.
Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
A universal quantum compilation methodology that aggregates multiple logical operations into larger units that manipulate up to 10 qubits at a time and optimizes these aggregates by finding commutative intermediate operations that result in more efficient schedules and creating custom control pulses optimized for the aggregate.
State preservation by repetitive error detection in a superconducting quantum circuit
The protection of classical states from environmental bit-flip errors is reported and the suppression of these errors with increasing system size is demonstrated, motivating further research into the many challenges associated with building a large-scale superconducting quantum computer.
Comparing the Overhead of Topological and Concatenated Quantum Error Correction
This work compares the overhead of quantum error correction with concatenated and topological quantum error-correcting codes. To perform a numerical analysis, we use the Quantum Resource Estimator
Quantum Computing in the NISQ era and beyond
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future, and the 100-qubit quantum computer will not change the world right away - but it should be regarded as a significant step toward the more powerful quantum technologies of the future.
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
A methodology which addresses the problem of properly mapping quantum functionality to a realization which satisfies all constraints given by the architecture and, at the same time, keeps the overhead in terms of additionally required quantum gates minimal is proposed.
Quantum computation with realistic magic-state factories
It is found that the magic-state factory required for postclassical factoring can be as small as 6.3 million data qubits, ignoring ancilla qu bits, assuming 10^−4 error gates and the availability of long-range interactions.
Efficient learning of quantum noise
The results pave the way for noise metrology in next-generation quantum devices, calibration in the presence of crosstalk, bespoke quantum error-correcting codes 10 and customized fault-tolerance protocols 11 that can greatly reduce the overhead in a quantum computation.