REVIEW 2 cited by
Classical simulation of universal measurement-based quantum computation using multipartite Bell scenarios
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 introduce a new classical simulation algorithm based on non-signaling polytopes of multipartite Bell scenarios, capable of simulating universal measurement-based quantum computation with single-qubit Pauli measurements. In our model, the simultaneous presence of non-stabilizerness and entanglement is necessary for quantum speedup. The region of quantum states that can be efficiently simulated includes the Bell polytope and extends beyond what is currently achievable by sampling algorithms based on phase space methods.
Forward citations
Cited by 2 Pith papers
-
Phase space tableau simulation for quantum computation
A new tableau algorithm simulates a broader class of quantum circuits than stabilizer circuits using CNC phase-space operators, with O(n^2)-per-measurement complexity.
-
Double categories for adaptive quantum computation
The paper unifies circuit, MBQC, magic-state, and Pauli measurement models as double categories, with quantum information horizontal and classical control vertical, and recasts the contextual-fraction bound on computi...
Discussion (0). Sign in to comment.