102 citations · 627 across the 36 of their papers we have counts for
35 papers
Fault-tolerant execution of error-corrected quantum algorithms
Michael A. Perlin, Zichang He, Anthony Alexiades Armenakas +9
Scaling up quantum algorithms to tackle high-impact problems in science and industry requires quantum error correction and fault tolerance. While progress has been made in experime…
Digital signatures with classical shadows on near-term quantum computers
Pradeep Niroula, Minzhao Liu, Sivaprasad Omanakuttan +15
Quantum mechanics provides cryptographic primitives whose security is grounded in hardness assumptions independent of those underlying classical cryptography. However, existing pro…
Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut
Anuj Apte, Sami Boulebnane, Yuwei Jin +3
Quantum algorithms for binary optimization problems have been the subject of extensive study. However, the application of quantum algorithms to integer optimization problems remain…
Compilation Pipeline for Predicting Algorithmic Break-Even in an Early-Fault-Tolerant Surface Code Architecture
Tianyi Hao, Joseph Sullivan, Sivaprasad Omanakuttan +2
Recent experimental progress in realizing surface code on hardware, including demonstrations of break-even logical memory on devices with up to hundreds of physical qubits, has mat…
Realization of a Quantum Streaming Algorithm on Long-lived Trapped-ion Qubits
Pradeep Niroula, Shouvanik Chakrabarti, Steven Kordonowy +30
Large classical datasets are often processed in the streaming model, with data arriving one item at a time. In this model, quantum algorithms have been shown to offer an unconditio…
Certified randomness amplification by dynamically probing remote random quantum states
Minzhao Liu, Pradeep Niroula, Matthew DeCross +49
Cryptography depends on truly unpredictable numbers, but physical sources emit biased or correlated bits. Quantum mechanics enables the amplification of imperfect randomness into n…
End-to-end quantum algorithms for tensor problems
Enrico Fontana, Sivaprasad Omanakuttan, Junhyung Lyle Kim +4
We present a comprehensive end-to-end quantum algorithm for tensor problems, including tensor PCA and planted kXOR, that achieves potential superquadratic quantum speedups over cla…
Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm
Sivaprasad Omanakuttan, Zichang He, Zhiwei Zhang +9
Optimization is often cited as a promising application of quantum computers. However, the low degree of provable quantum speedups has led prior rigorous end-to-end resource analyse…
Tensor networks for quantum computing
Aleksandr Berezutskii, Minzhao Liu, Atithi Acharya +25
In the rapidly evolving field of quantum computing, tensor networks serve as an important tool due to their multifaceted utility. In this paper, we review the diverse applications…
A universal neutral-atom quantum computer with individual optical addressing and non-destructive readout
A. G. Radnaev, W. C. Chung, D. C. Cole +55
Quantum computers must achieve large-scale, fault-tolerant operation to deliver on their promise of transformational processing power [1-4]. This will require thousands or millions…
Robust Quantum Sensing with Multiparameter Decorrelation
Shah Saad Alam, Victor E. Colussi, John Drew Wilson +3
The performance of a quantum sensor is fundamentally limited by noise. This noise is particularly damaging when it becomes correlated with the readout of a target signal, caused by…
Architecture for fast implementation of qLDPC codes with optimized Rydberg gates
C. Poole, T. M. Graham, M. A. Perlin +2
We propose an implementation of bivariate bicycle codes (Nature {\bf 627}, 778 (2024)) based on long-range Rydberg gates between stationary neutral atom qubits. An optimized layout…
Average circuit eigenvalue sampling on NISQ devices
Emilio Pelaez, Victory Omole, Pranav Gokhale +4
Average circuit eigenvalue sampling (ACES) was introduced by Flammia in arXiv:2108.05803 as a protocol to characterize the Pauli error channels of individual gates across the devic…
Q-CHOP: Quantum constrained Hamiltonian optimization
Michael A. Perlin, Ruslan Shaydulin, Benjamin P. Hall +7
Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both class…
A short note on effective Pauli noise models
Michael A. Perlin
We provide a simple prescription to extract an effective Pauli noise model from classical simulations of a noisy experimental protocol for a unitary gate. This prescription yields…
Superstaq: Deep Optimization of Quantum Programs
Colin Campbell, Frederic T. Chong, Denny Dahl +21
We describe Superstaq, a quantum software platform that optimizes the execution of quantum programs by tailoring to underlying hardware primitives. For benchmarks such as the Berns…
Circuit decompositions and scheduling for neutral atom devices with limited local addressability
Natalia Nottingham, Michael A. Perlin, Dhirpal Shah +4
Despite major ongoing advancements in neutral atom hardware technology, there remains limited work in systems-level software tailored to overcoming the challenges of neutral atom q…
Clifford-based Circuit Cutting for Quantum Simulation
Kaitlin N. Smith, Michael A. Perlin, Pranav Gokhale +5
Quantum computing has potential to provide exponential speedups over classical computing for many important applications. However, today's quantum computers are in their early stag…
SupercheQ: Quantum Advantage for Distributed Databases
E. R. Anschuetz, P. Gokhale, B. Tonekaboni +18
We introduce Supercheq, a family of quantum protocols that achieves asymptotic advantage over classical protocols for checking the equivalence of files, a task also known as finger…
Quantum Circuit Cutting for Classical Shadows
Daniel T. Chen, Zain H. Saleem, Michael A. Perlin
Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing…
Enhancing spin squeezing using soft-core interactions
Jeremy T. Young, Sean R. Muleady, Michael A. Perlin +2
We propose a new protocol for preparing spin squeezed states in controllable atomic, molecular, and optical systems, with particular relevance to emerging optical clock platforms c…
Engineering infinite-range SU() interactions with spin-orbit-coupled fermions in an optical lattice
Michael A. Perlin, Diego Barberena, Mikhail Mamaev +3
We study multilevel fermions in an optical lattice described by the Hubbard model with on site SU()-symmetric interactions. We show that in an appropriate parameter regime this…
Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation
Teague Tomesh, Zain H. Saleem, Michael A. Perlin +3
Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield…
Spin qudit tomography and state reconstruction error
Michael A. Perlin, Diego Barberena, Ana Maria Rey
We consider the task of performing quantum state tomography on a -level spin qudit, using only measurements of spin projection onto different quantization axes. After introducin…