Daniel Liang

activity

20192025

most citedSimulation of Qubit Quantum Circuits via Pauli Propagation

63 citations · 121 across the 12 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

quant-ph2022★ 1 cited

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom

Sabee Grewal, Vishnu Iyer, William Kretschmer +1

We show that quantum states with "low stabilizer complexity" can be efficiently distinguished from Haar-random. Specifically, given an $n$ -qubit pure state $∣ ψ ⟩$ , we give an…

quant-ph2022★ 2 cited

Clifford Circuits can be Properly PAC Learned if and only if $RP = NP$

Daniel Liang

Given a dataset of input states, measurements, and probabilities, is it possible to efficiently predict the measurement probabilities associated with a quantum circuit? Recent work…

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom

Clifford Circuits can be Properly PAC Learned if and only if RP=NP

Clifford Circuits can be Properly PAC Learned if and only if $RP = NP$