A sample-optimal quantum state tomography algorithm that is memory-efficient by using unitary Schur sampling with streaming access to samples.
Title resolution pending
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 7verdicts
UNVERDICTED 7roles
background 2polarities
background 2representative citing papers
A representation-theoretic framework computes LXEB scores and proves anticoncentration for Fock-state Boson Sampling in the saturated regime using irrep decompositions of bosonic spaces.
Unitary designs emerge from the temporal ensemble of two chaotic Hamiltonian evolutions separated by a random Pauli operation, based on the universal Pauli spectrum.
Rigorous bounds establish that t = Theta(k^2) non-Clifford gates are necessary and sufficient for frame-potential approximation to unitary k-designs while t = Theta(nk) suffices for relative-error k-designs.
Efficient witnesses and testing algorithms based on stabilizer Rényi entropy certify and quantify magic in mixed states, with experimental demonstration on IonQ hardware showing robustness under strong noise.
FACES is a new protocol for simultaneous self-consistent learning of averaged error rates across many FLO gates with rigorously shown efficient sampling complexity via Kravchuk transformations.
QCNNs are classically simulable via Pauli shadows on low-bodyness subspaces of locally-easy datasets, with explicit simulation demonstrated up to 1024 qubits for phases of matter classification.
citing papers explorer
-
Sample Optimal and Memory Efficient Quantum State Tomography
A sample-optimal quantum state tomography algorithm that is memory-efficient by using unitary Schur sampling with streaming access to samples.
-
General framework for anticoncentration and linear cross-entropy benchmarking in photonic quantum advantage experiments
A representation-theoretic framework computes LXEB scores and proves anticoncentration for Fock-state Boson Sampling in the saturated regime using irrep decompositions of bosonic spaces.
-
Unitary Designs from Two Chaotic Hamiltonians and a Random Pauli Operation
Unitary designs emerge from the temporal ensemble of two chaotic Hamiltonian evolutions separated by a random Pauli operation, based on the universal Pauli spectrum.
-
Non-Clifford Cost of Random Unitaries
Rigorous bounds establish that t = Theta(k^2) non-Clifford gates are necessary and sufficient for frame-potential approximation to unitary k-designs while t = Theta(nk) suffices for relative-error k-designs.
-
Efficient witnessing and testing of magic in mixed quantum states
Efficient witnesses and testing algorithms based on stabilizer Rényi entropy certify and quantify magic in mixed states, with experimental demonstration on IonQ hardware showing robustness under strong noise.
-
Fermionic Averaged Circuit Eigenvalue Sampling
FACES is a new protocol for simultaneous self-consistent learning of averaged error rates across many FLO gates with rigorously shown efficient sampling complexity via Kravchuk transformations.
-
Quantum Convolutional Neural Networks are Effectively Classically Simulable
QCNNs are classically simulable via Pauli shadows on low-bodyness subspaces of locally-easy datasets, with explicit simulation demonstrated up to 1024 qubits for phases of matter classification.