REVIEW 3 cited by
Stabilisation of Quantum Computations by Symmetrisation
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
Signed reviews
abstract
We propose a method for the stabilisation of quantum computations (including quantum state storage). The method is based on the operation of projection into $\cal SYM$, the symmetric subspace of the full state space of $R$ redundant copies of the computer. We describe an efficient algorithm and quantum network effecting $\cal SYM$--projection and discuss the stabilising effect of the proposed method in the context of unitary errors generated by hardware imprecision, and nonunitary errors arising from external environmental interaction. Finally, limitations of the method are discussed.
Forward citations
Cited by 3 Pith papers
-
An Optimal Analysis of the Product Test
For every n >= 2, the product test's worst-case acceptance probability equals (1 + mω^2 + (1−mω)^2)/2 with m = floor(1/ω), where ω is the maximum squared overlap with a product state.
-
Product testing with single-copy measurements
Testing whether a state is product across some bipartition costs Ω(d^{n/4}) copies with single-copy measurements versus O(n/ε²) with joint measurements — an exponential separation; full product testing has an O(n log ...
-
An Algorithm for Estimating $\alpha$-Stabilizer R\'enyi Entropies via Purity
Introduces a purity-encoding algorithm for estimating α-Stabilizer Rényi Entropies of unknown quantum states for integer α > 1, with benchmarks and a non-stabilizerness/entanglement link.
Discussion (0). Continue with ORCID to comment.