Corpus ID: 237940747

Faster and More Reliable Quantum SWAPs via Native Gates

@article{Gokhale2021FasterAM,
  title={Faster and More Reliable Quantum SWAPs via Native Gates},
  author={Pranav Gokhale and Teague Tomesh and Martin Suchara and Frederic T. Chong},
  journal={ArXiv},
  year={2021},
  volume={abs/2109.13199}
}
Due to the sparse connectivity of superconducting quantum computers, qubit communication via SWAP gates accounts for the vast majority of overhead in quantum programs. We introduce a method for improving the speed and reliability of SWAPs at the level of the superconducting hardware’s native gateset. Our method relies on four techniques: 1) SWAP Orientation, 2) Cross-Gate Pulse Cancellation, 3) Commutation through Cross-Resonance, and 4) Cross-Resonance Polarity. Importantly, our Optimized SWAP… Expand
Optimized fermionic SWAP networks with equivalent circuit averaging for QAOA
Akel Hashim, 2, 3, ∗ Rich Rines, ∗ Victory Omole, Ravi K. Naik, 3 John Mark Kreikebaum, 5, † David I. Santiago, Frederic T. Chong, 6 Irfan Siddiqi, 3, 5 and Pranav Gokhale ‡ Quantum NanoelectronicsExpand

References

SHOWING 1-10 OF 50 REFERENCES
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
TLDR
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. Expand
Extending the Frontier of Quantum Computers With Qutrits
TLDR
A novel technique using qutrits is presented to achieve a logarithmic runtime decomposition of the Generalized Toffoli gate using no ancilla---an exponential improvement over the best qubit-only equivalent. Expand
Optimized Surface Code Communication in Superconducting Quantum Computers
TLDR
This paper evaluates two established quantum error correction codes-planar and double-defect surface codes-using a set of compilation, scheduling and network simulation tools, and finds that the simpler planar codes are sometimes more favorable for implementation on superconducting quantum computers, especially under conditions of high communication congestion. Expand
Asymptotic Improvements to Quantum Circuits via Qutrits
TLDR
This work presents a novel technique using qutrits to achieve a logarithmic depth (runtime) decomposition of the Generalized Toffoli gate using no ancilla-a significant improvement over linear depth for the best qubit-only equivalent. Expand
Efficient measurement of quantum gate error by interleaved randomized benchmarking.
TLDR
A scalable experimental protocol is described that consists of interleaving random Clifford gates between the gate of interest and provides an estimate as well as theoretical bounds for the average error of the gate under test, so long as the average noise variation over all Clifford gates is small. Expand
Basic circuit compilation techniques for an ion-trap quantum machine
TLDR
The approach allows a trade-off between circuit runtime and quantum error, as well as to accommodate future changes in the optimization criteria that may likely arise as a result of the anticipated improvements in the physical-level control of the experiment. Expand
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
TLDR
This work provides a method that maps quantum circuits to IBM's QX architectures with a minimal number of SWAP and H operations, and shows by experimental evaluation that the number of operations added by IBM’s heuristic solution exceeds the lower bound by more than 100% on average. Expand
Optimized Quantum Compilation for Near-Term Algorithms with OpenPulse
TLDR
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. Expand
Context-Sensitive and Duration-Aware Qubit Mapping for Various NISQ Devices
TLDR
Codar proposes a COntext-sensitive and Duration-Aware Remapping algorithm (Codar) based on the QAM, which halves the total execution time of several quantum algorithms and cut down 17.5% - 19.4% total executed time on average in different architectures. Expand
Not All Qubits Are Created Equal: A Case for Variability-Aware Policies for NISQ-Era Quantum Computers
TLDR
This paper proposes Variation-Aware Qubit Movement (VQM), policies that optimize the movement and allocation of qubits to avoid the weaker qubits and links, and guide more operations towards the stronger qu bits and links. Expand
...
1
2
3
4
5
...