Nielsen quantum circuit complexity is positioned as a topological distance for unsupervised learning of topological order, with theorems linking it to Bures distance and entanglement to yield practical fidelity- and entanglement-based kernels demonstrated on XXZ chains and toric code.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
Extends qubit-channel metrology to spectator noise, supplying algebraic tests that decide when correlated n-qubit inputs beat single-qubit inputs under different noise types.
Review of formalizations of non-Markovian dynamics and memory kernels in open quantum systems, contrasting with classical stochastic processes.
citing papers explorer
-
Quantum circuit complexity and unsupervised machine learning of topological order
Nielsen quantum circuit complexity is positioned as a topological distance for unsupervised learning of topological order, with theorems linking it to Bures distance and entanglement to yield practical fidelity- and entanglement-based kernels demonstrated on XXZ chains and toric code.
-
Noisy initial-state qubit-channel metrology with additional undesirable noisy evolution
Extends qubit-channel metrology to spectator noise, supplying algebraic tests that decide when correlated n-qubit inputs beat single-qubit inputs under different noise types.
-
Frontiers of open quantum system dynamics
Review of formalizations of non-Markovian dynamics and memory kernels in open quantum systems, contrasting with classical stochastic processes.