Publications (18)
End-to-End Quantum Algorithms for the Jones Polynomial
Tuomas Laakkonen, Enrico Rinaldi, Chris N. Self +6
We present an end-to-end algorithmic pipeline where a noisy digital quantum computer is used to approximate the value of the Jones polynomial at the fifth root of unity for any inp…
Knitting Wormholes by Entanglement in Supergravity
Vijay Balasubramanian, Matthew DeCross, Gábor Sárosi
We construct a single-boundary wormhole geometry in type IIB supergravity by perturbing two stacks of extremal D3-branes in the decoupling limit. The solution interpolates from…
Quantum Complexity of Time Evolution with Chaotic Hamiltonians
Vijay Balasubramanian, Matthew DeCross, Arjun Kar +1
We study the quantum complexity of time evolution in large- chaotic systems, with the SYK model as our main example. This complexity is expected to increase linearly for exponen…
Complexity Growth in Integrable and Chaotic Models
Vijay Balasubramanian, Matthew DeCross, Arjun Kar +2
We use the SYK family of models with Majorana fermions to study the complexity of time evolution, formulated as the shortest geodesic length on the unitary group manifold betwe…
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…
Probing critical states of matter on a digital quantum computer
Reza Haghshenas, Eli Chertkov, Matthew DeCross +11
Although quantum mechanics underpins the microscopic behavior of all materials, its effects are often obscured at the macroscopic level by thermal fluctuations. A notable exception…
Controlled Gate Networks: Theory and Application to Eigenvalue Estimation
Max Bee-Lindgren, Zhengrong Qian, Matthew DeCross +5
We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy…
Qubit-reuse compilation with mid-circuit measurement and reset
Matthew DeCross, Eli Chertkov, Megan Kohagen +1
A number of commercially available quantum computers, such as those based on trapped-ion or superconducting qubits, can now perform mid-circuit measurements and resets. In addition…
Fully optimised variational simulation of a dynamical quantum phase transition on a trapped-ion quantum computer
Lesley Gover, Vinul Wimalaweera, Fariha Azad +3
We time-evolve a translationally invariant quantum state on the Quantinuum H1-1 trapped-ion quantum processor, studying the dynamical quantum phase transition of the transverse fie…
Digital quantum magnetism on a trapped-ion quantum computer
Reza Haghshenas, Eli Chertkov, Michael Mills +56
Digital quantum matter -- realized when discrete quantum gates approximate continuous time evolution -- is susceptible to heating into chaotic, structureless states. If digitizatio…
The computational power of random quantum circuits in arbitrary geometries
Matthew DeCross, Reza Haghshenas, Minzhao Liu +49
Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimens…
Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti +26
The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tac…
Binding Complexity and Multiparty Entanglement
Vijay Balasubramanian, Matthew DeCross, Arjun Kar +1
We introduce "binding complexity", a new notion of circuit complexity which quantifies the difficulty of distributing entanglement among multiple parties, each consisting of many l…
Certified randomness using a trapped-ion quantum processor
Minzhao Liu, Ruslan Shaydulin, Pradeep Niroula +29
While quantum computers have the potential to perform a wide range of practically important tasks beyond the capabilities of classical computers, realizing this potential remains a…
Demonstrating an unconditional separation between quantum and classical information resources
William Kretschmer, Sabee Grewal, Matthew DeCross +8
A longstanding goal in quantum information science is to demonstrate quantum computations that cannot be feasibly reproduced on a classical computer. Such demonstrations mark major…
Helios: A 98-qubit trapped-ion quantum computer
Anthony Ransford, M. S. Allman, Jake Arkinstall +183
We report on Quantinuum Helios, a 98-qubit trapped-ion quantum processor based on the quantum charge-coupled device (QCCD) architecture. Helios features Ba hyperfine…
Entanglement Entropy and the Colored Jones Polynomial
Vijay Balasubramanian, Matthew DeCross, Jackson Fliss +3
We study the multi-party entanglement structure of states in Chern-Simons theory created by performing the path integral on 3-manifolds with linked torus boundaries, called link co…
Computing with many encoded logical qubits beyond break-even
Shival Dasu, Matthew DeCross, Andrew Y. Guo +42
High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementi…