10 citations · 24 across the 11 of their papers we have counts for
11 papers
Experimental demonstration of the Quantum Fourier Transform on up to 100 qubits using a convolutional compilation strategy
Paul Coote, Michael J. Biercuk, Yuval Baum
We present and experimentally validate the `Convolutional QFT': a constructive compilation strategy for the Quantum Fourier Transform (QFT) subroutine on a linear nearest neighbor…
Driving Exchange Interaction in Spin Qubits with Quasi-Zero Pulses
Julian D. Teske, Remy L. Delva, Shobhan Kulshreshtha +6
The implementation of high-fidelity quantum gates for spin qubits requires accurate control of exchange interactions between electrons confined in quantum dots, but pulse distortio…
Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor
Gavin S. Hartnett, Khadijeh Sona Najafi, Aleksei Khindanov +5
We report experimental digital quantum simulation of the one-dimensional Fermi-Hubbard model on a superconducting quantum processor at a scale beyond the reach of exact statevector…
Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting
Pranav S. Mundada, Aleksei Khindanov, Yulun Wang +5
Quantum computer hardware is predicted to scale over hundreds of thousands of qubits coming online in the next decade. Despite significant theoretical and experimental QEC progress…
No need to calibrate: characterization and compilation for high-fidelity circuit execution using imperfect gates
Ashish Kakkar, Samuel Marsh, Yulun Wang +5
We propose and validate on real quantum computing hardware a new method for extended two-qubit gate set design, replacing iterative, fine calibration with fast characterization of…
-Motif: Parallel Subgraph Isomorphism via Tabular Operations for Scalable Layout Selection
Yulun Wang, Esteban Ginez, Jamie Friel +4
Subgraph isomorphism is a fundamental problem in graph analysis that seeks to find all instances of a pattern graph within a larger data graph while preserving structural relations…
Automated discovery of heralded ballistic graph state generators for fusion-based photonic quantum computation
Gavin S. Hartnett, Dave Kielpinski, Smarak Maity +3
Designing photonic circuits that prepare graph states with high fidelity and success probability is a central challenge in linear optical quantum computing. Existing approaches rel…
Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection
Haoran Liao, Gavin S. Hartnett, Ashish Kakkar +5
The resource overhead required to achieve net computational benefits from quantum error correction (QEC) limits its utility while current systems remain constrained in size, despit…
Resource-efficient context-aware dynamical decoupling embedding for arbitrary large-scale quantum algorithms
Paul Coote, Roman Dimov, Smarak Maity +3
We introduce and implement GraphDD: an efficient method for real-time, circuit-specific, optimal embedding of dynamical decoupling (DD) into executable quantum algorithms. We demon…
Integrated error-suppressed pipeline for quantum optimization of nontrivial binary combinatorial optimization problems on gate-model hardware at the 156-qubit scale
Natasha Sachdeva, Gavin S. Hartnett, Smarak Maity +12
We introduce a novel hybrid quantum-classical variational optimization method for unconstrained binary combinatorial optimization problems on gate-model quantum computers, integrat…
Learning to rank quantum circuits for hardware-optimized performance enhancement
Gavin S. Hartnett, Aaron Barbosa, Pranav S. Mundada +3
We introduce and experimentally test a machine-learning-based method for ranking logically equivalent quantum circuits based on expected performance estimates derived from a traini…