First experimental realization of reference-state-dependent Petz recovery maps for single-qubit amplitude and phase damping on an NMR processor via duality quantum computing, with results matching theory.
Title resolution pending
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
fields
quant-ph 7representative citing papers
A graph-based bounded distance decoder corrects all errors up to a chosen weight in arbitrary stabilizer codes by representing stabilizers and syndromes as graphs and pruning the search space with a feed-forward structure.
Local NOT operations convert entanglement sudden death to asymptotic decay for genuine multipartite concurrence in small multipartite systems under amplitude damping, while teleportation fidelity preservation requires flipping all qubits in some cases and allows use of biseparable states in GHZ CQT.
Programmable nonlinear bosonic circuits can deterministically produce phased-comb states that serve as a scalable bosonic quantum error-correcting code with near-optimal performance against boson loss.
Dynamical control schemes for dual-rail erasure qubits suppress transmon-induced noise, reducing erasure check errors by three orders of magnitude and logical two-qubit gate infidelities by up to three orders of magnitude.
A systematic graph-state protocol yields a family of [[n,1,3]] non-CSS codes that preserve bare-ancilla fault tolerance against hook errors and includes one code with higher rate than prior examples under depolarizing noise.
Clifford-deformed elongated compass codes exhibit bias-dependent thresholds and outperform the XZZX surface code at moderate dephasing biases under code capacity noise.
citing papers explorer
-
Realizing the Petz Recovery Map on an NMR Quantum Processor
First experimental realization of reference-state-dependent Petz recovery maps for single-qubit amplitude and phase damping on an NMR processor via duality quantum computing, with results matching theory.
-
A graph-aware bounded distance decoder for all stabilizer codes
A graph-based bounded distance decoder corrects all errors up to a chosen weight in arbitrary stabilizer codes by representing stabilizers and syndromes as graphs and pruning the search space with a feed-forward structure.
-
Decoherence Mitigation with Local NOT Gates in Multipartite Systems
Local NOT operations convert entanglement sudden death to asymptotic decay for genuine multipartite concurrence in small multipartite systems under amplitude damping, while teleportation fidelity preservation requires flipping all qubits in some cases and allows use of biseparable states in GHZ CQT.
-
Deterministic generation of grid states with programmable nonlinear bosonic circuits
Programmable nonlinear bosonic circuits can deterministically produce phased-comb states that serve as a scalable bosonic quantum error-correcting code with near-optimal performance against boson loss.
-
Dynamical error reshaping for dual-rail erasure qubits
Dynamical control schemes for dual-rail erasure qubits suppress transmon-induced noise, reducing erasure check errors by three orders of magnitude and logical two-qubit gate infidelities by up to three orders of magnitude.
-
Fault-tolerant syndrome extraction in [[n,1,3]] non-CSS code family generated using measurements on graph states
A systematic graph-state protocol yields a family of [[n,1,3]] non-CSS codes that preserve bare-ancilla fault tolerance against hook errors and includes one code with higher rate than prior examples under depolarizing noise.
-
Clifford-Deformed Compass Codes
Clifford-deformed elongated compass codes exhibit bias-dependent thresholds and outperform the XZZX surface code at moderate dephasing biases under code capacity noise.