Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 5verdicts
UNVERDICTED 5roles
background 2polarities
background 2representative citing papers
Equivariant sp-QCNN encodes general symmetries with group theory, splits circuits at pooling layers to preserve symmetry while enabling parallel measurements, and shows improved efficiency and trainability over standard equivariant QCNNs in noisy quantum data classification.
QCNNs are classically simulable via Pauli shadows on low-bodyness subspaces of locally-easy datasets, with explicit simulation demonstrated up to 1024 qubits for phases of matter classification.
New criteria reveal VQE needs fault-tolerant quantum computers due to decoherence and QPE has exponentially suppressed success probability from orthogonality catastrophe in classical input states.
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.
citing papers explorer
-
Feasibility of performing quantum chemistry calculations on quantum computers
New criteria reveal VQE needs fault-tolerant quantum computers due to decoherence and QPE has exponentially suppressed success probability from orthogonality catastrophe in classical input states.