REVIEW 4 cited by
Efficient Simulation of Random Quantum States and Operators
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We investigate the generation of quantum states and unitary operations that are ``random'' in certain respects. We show how to use such states to estimate the average fidelity, an important measure in the study of implementations of quantum algorithms. We re-discover the result that the states of a maximal set of mutually-unbiased bases serve this purpose. An efficient circuit is presented that generates an arbitrary state out of such a set. Later on, we consider unitary operations that can be used to turn any quantum channel into a depolarizing channel. It was known before that the Clifford group serves this and a related purpose, and we show that these are actually the same. We also show that a small subset of the Clifford group is already sufficient to accomplish this. We conclude with an efficient construction of the elements of that subset. This thesis is based on joint work with Richard Cleve, Joseph Emerson, and Etera Livine.
Forward citations
Cited by 4 Pith papers
-
A distillation-teleportation protocol for fault-tolerant QRAM
An adaptive distillation-teleportation protocol implements a fault-tolerant QRAM query with poly(n) quantum resources and 1/poly(n) device fidelity, at the cost of an exponential classical dataset update each round.
-
Realizing Unitary $k$-designs with a Single Quench
A single quench between two independent random Hamiltonians at the Thouless time generates unitary k-designs.
-
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.
-
Long-time Freeness in the Kicked Top
In the fully chaotic regime of the kicked top, long-time freeness is reached exponentially fast, accompanied by a hierarchy of time scales indicating a multifractal approach.
Discussion (0). Continue with ORCID to comment.