Introduces factorized graph-preserving Clifford operations organized over local-complementation orbits to optimize finite-size multipartite graph-state purification circuits that outperform recurrence protocols under realistic noise.
Efficient Preparation of Resource States for Hamiltonian Simulation and Universal Quantum Computation
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
QPatLib v1.0 releases benchmark measurement patterns for measurement-based quantum simulation of Pauli-string unitaries, with scalable conventions for commuting subsets.
citing papers explorer
-
Efficient Graph State Purification with Factorized Graph-Preserving Operations across Local Clifford Orbits
Introduces factorized graph-preserving Clifford operations organized over local-complementation orbits to optimize finite-size multipartite graph-state purification circuits that outperform recurrence protocols under realistic noise.
-
Scalable Measurement-Based Quantum Simulation Patterns for Benchmarking
QPatLib v1.0 releases benchmark measurement patterns for measurement-based quantum simulation of Pauli-string unitaries, with scalable conventions for commuting subsets.