activity
20242026
collaborators

10 papers

quant-ph2026

Efficient classical simulation of large-scale unitary cluster Jastrow circuits

Hrishikesh Belagali, Thomas Van Camp, R. Pradeep +3

Recent experiments on quantum computers have challenged the limits of classical computation in chemistry, simulating ground states of strongly correlated molecules. Many of these e…

quant-ph2026

Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers

Jason Necaise, Namit Anand, Gaurav Gyawali +3

Efficient simulation of strongly-interacting fermionic systems on quantum processing units (QPUs) is a challenging task due to nonlocal mode entanglement generation. However, it is…

quant-ph2026

Partially Fault-Tolerant Quantum Computation for Megaquop Applications

Ming-Zhi Chung, Ali H. Z. Kavaki, Artur Scherer +14

Partially fault-tolerant quantum computing (FTQC) has recently emerged as a promising approach for the execution of megaquop-scale circuits with millions of logical operations. In…

quant-ph2026

Distributed Quantum Computing via Adaptive Circuit Knitting

K. Grace Johnson, Aniello Esposito, Gaurav Gyawali +5

Distributing quantum workloads over many Quantum Processing Units (QPUs) is a crucial step in scaling up quantum computers toward practical quantum advantage due to the limitations…

quant-ph2026

Qudit Designs and Where to Find Them

Namit Anand, Jeffrey Marshall, Jason Saied +2

Unitary t-designs are some of the most versatile tools in quantum information theory. Their applications range from randomized benchmarking and shadow tomography, to more fundament…

quant-ph2025

Dual-unitary shadow tomography

Ahmed A. Akhtar, Namit Anand, Jeffrey Marshall +1

We introduce ``dual-unitary shadow tomography'' (DUST), a classical shadow tomography protocol based on dual-unitary brick-wall circuits. To quantify the performance of DUST, we st…