activity
20232026
most citedCircuit-to-Hamiltonian from tensor networks and fault tolerance

4 citations · 4 across the 3 of their papers we have counts for

collaborators

5 papers

quant-ph2026

A simple proof of unitary parallelization via port-based teleportation

Anurag Anshu, Quynh T. Nguyen

Port-based teleportation (PBT) is a variant of quantum teleportation that does not require corrections on the teleported state: starting with shared EPR states, Alice can telep…

cs.CC2026

Classical Adversarial Fault-Tolerance and PCPs

Anurag Anshu, Nikolas P. Breuckmann, Louis Golowich +2

We show how to compile an arbitrary classical circuit into a fault-tolerant circuit, which performs the desired computation even when an almost-linear number of bits are adversaria…

quant-ph2025

Learning quantum Gibbs states locally and efficiently

Chi-Fang Chen, Anurag Anshu, Quynh T. Nguyen

Learning the Hamiltonian underlying a quantum many-body system in thermal equilibrium is a fundamental task in quantum learning theory and experimental sciences. To learn the Gibbs…

quant-ph2024

On the complexity of unique quantum witnesses and quantum approximate counting

Anurag Anshu, Jonas Haferkamp, Yeongwoo Hwang +1

We study the long-standing open question on the power of unique witnesses in quantum protocols, which asks if , a variant of whose accepting witn…

quant-ph2023★ 4 cited

Circuit-to-Hamiltonian from tensor networks and fault tolerance

Anurag Anshu, Nikolas P. Breuckmann, Quynh T. Nguyen

We define a map from an arbitrary quantum circuit to a local Hamiltonian whose ground state encodes the quantum computation. All previous maps relied on the Feynman-Kitaev construc…