Develops an operator-algebraic framework proving that layered quantum protocols for singularly perturbed open systems converge uniformly to slow dynamics with stiffness-independent error bounds O(εΔt + Δt²).
Watrous,The Theory of Quantum Information(Cambridge University Press, 2018)
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Parity-oblivious random exclusion codes allow qubits to exceed tight noncontextual bounds for prime symbol sizes, unlike parity-oblivious retrieval, and enable semi-device-independent dimension certification.
Pauli propagation with tailored truncation enables efficient classical simulation of expectation values for most quantum circuits under any local noise, with high probability and logarithmic effective depth.
An algorithm leveraging the Clifford group and graph representation to find symmetries in many-body Hamiltonians, demonstrated on random and physical instances up to 1000 qubits.
citing papers explorer
-
Operator-Algebraic Methods for Asymptotic-Preserving Quantum Simulation of Open Systems
Develops an operator-algebraic framework proving that layered quantum protocols for singularly perturbed open systems converge uniformly to slow dynamics with stiffness-independent error bounds O(εΔt + Δt²).
-
Exclusion reshapes the operational manifestation of preparation contextuality
Parity-oblivious random exclusion codes allow qubits to exceed tight noncontextual bounds for prime symbol sizes, unlike parity-oblivious retrieval, and enable semi-device-independent dimension certification.
-
Simulating quantum circuits with arbitrary local noise using Pauli Propagation
Pauli propagation with tailored truncation enables efficient classical simulation of expectation values for most quantum circuits under any local noise, with high probability and logarithmic effective depth.
-
Clifford symmetries in quantum many-body systems
An algorithm leveraging the Clifford group and graph representation to find symmetries in many-body Hamiltonians, demonstrated on random and physical instances up to 1000 qubits.