REVIEW 12 cited by
Adaptive constant-depth circuits for manipulating non-abelian anyons
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 consider Kitaev's quantum double model based on a finite group $G$ and describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement. We show that for any solvable group $G$ all above tasks can be realized by constant-depth adaptive circuits with geometrically local unitary gates and mid-circuit measurements. Each gate may be chosen adaptively depending on previous measurement outcomes. Constant-depth circuits are well suited for implementation on a noisy hardware since it may be possible to execute the entire circuit within the qubit coherence time. Thus our results could facilitate an experimental study of exotic phases of matter with a non-abelian particle statistics. We also show that adaptiveness is essential for our circuit construction. Namely, task (b) cannot be realized by non-adaptive constant-depth local circuits for any non-abelian group $G$. This is in a sharp contrast with abelian anyons which can be created and moved over an arbitrary distance by a depth-$1$ circuit composed of generalized Pauli gates.
Forward citations
Cited by 12 Pith papers
-
State preparation via measurement and feedback: pushing relations, state structures, and non-invertible symmetries
Finite-depth measurement-feedback preparation of 1D matrix product states is classified by pushable virtual-bond defects and their pushing relations, yielding explicit circuits and links to non-invertible symmetries.
-
Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes
Non-Abelian surface codes based on dihedral groups D_{4N} implement transversal phase gates T^{1/N} at any Clifford-hierarchy level in 2D, with a qubit-only version when 8N is a power of two.
-
Certifying localizable quantum properties with constant sample complexity
A new framework certifies global quantum properties including multipartite entanglement, circuit complexity, and quantum magic on small subsystems with constant sample complexity via local Pauli measurements.
-
Generating logical magic states with the aid of non-Abelian topological order
A new protocol uses gauging and anyon condensation through the D4 quantum double model to produce a logical magic state in the Z2 surface code from a Clifford state in the Z4 surface code.
-
Reconstructing non-Abelian braiding and fusion without anyon transport
A compact two-qutrit measurement-only protocol on a trapped-ion processor reconstructs the squared braiding phases and fusion amplitudes of D(S3) anyons with average output-state fidelities above 0.998.
-
A conditional no-go for resource-free magic-axis measurement on a static surface code
Under three stated assumptions, a resource-free static surface-code patch cannot sharply measure the magic axis at polynomial acceptance; it must pay with a resource, leave the dilute regime, or accept exponentially rarely.
-
Spacetime duality between sequential and measurement-feedback circuits
Sequential unitary and measurement-feedback circuits for preparing GHZ, topological, and fractal states are spacetime-dual, linking Kramers-Wannier duality to Z2 gauging and enabling constant-qubit order measurements.
-
Non-Clifford gates between stabilizer codes via non-Abelian topological order
A protocol uses the non-Abelian S3 quantum double as an intermediate to implement a controlled charge-conjugation (CC) gate between qubit and qutrit surface codes.
-
Quantum circuit lower bounds in the magic hierarchy
A Clifford circuit followed by a shallow two-qubit circuit cannot prepare several explicit entangled states, including some topological ground states and quantum codes.
-
Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
Adaptive circuits with unary encoding prepare sparse states, Slater determinant sums, and Bethe wavefunctions in logarithmic or constant depth, trading circuit depth for extra width.
-
Learning Feedback Mechanisms for Measurement-Based Variational Quantum State Preparation
A variational protocol that learns measurement-and-feedback strategies prepares AKLT states with less pre-measurement entanglement than the analytic Smith et al. protocol and discovers a protocol for a specific AKLT e...
-
A Universal Circuit Set Using the $S_3$ Quantum Double
A complete circuit-level blueprint for universal quantum computation using the D(S3) quantum double, with anyon interferometry and a concatenated local error-correcting code.
Discussion (0). Continue with ORCID to comment.