Pith. sign in

REVIEW

Bounds for Approximation in Total Variation Distance by Quantum Circuits

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

arxiv quant-ph/9508007 v1 pith:5EVZFMFS submitted 1995-08-08 quant-ph math.CO

classification quant-phmath.CO
keywords statesdistancequantumalmostapproximateasymptoticallyboundsepsilon
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It was recently shown that for reasonable notions of approximation of states and functions by quantum circuits, almost all states and functions are exponentially hard to approximate [Knill 1995]. The bounds obtained are asymptotically tight except for the one based on total variation distance (TVD). TVD is the most relevant metric for the performance of a quantum circuit. In this paper we obtain asymptotically tight bounds for TVD. We show that in a natural sense, almost all states are hard to approximate to within a TVD of 2/e-\epsilon even for exponentially small \epsilon. The quantity 2/e is asymptotically the average distance to the uniform distribution. Almost all states with probability amplitudes concentrated in a small fraction of the space are hard to approximate to within a TVD of 2-\epsilon. These results imply that non-uniform quantum circuit complexity is non-trivial in any reasonable model. They also reinforce the notion that the relative information distance between states (which is based on the difficulty of transforming one state to another) fully reflects the dimensionality of the space of qubits, not the number of qubits.

Discussion (0). Continue with ORCID to comment.

Pith tools