Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
Showcasing a barren plateau theory beyond the dynamical lie algebra
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 7verdicts
UNVERDICTED 7roles
background 2representative citing papers
Structural f-divergence yields tight trade-off inequalities bounding gradient magnitudes and cost moments in parameterized quantum circuits, with equality for a minimal one-qubit ansatz.
Hybrid quantum walks with optimal dynamical coin operators outperform QAOA on Max-Cut and MIS by accessing a strictly larger Jordan-Lie algebra that enables faster convergence and higher accuracy.
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
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.
A literature review of VQAs covering ansatz design, classical optimization, barren plateaus, error mitigation strategies, and theoretical adaptations for fault-tolerant quantum computing.
citing papers explorer
-
Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
-
Structural $f$-divergence: Tight universal bounds for cost function moments and gradients in parameterized quantum circuits
Structural f-divergence yields tight trade-off inequalities bounding gradient magnitudes and cost moments in parameterized quantum circuits, with equality for a minimal one-qubit ansatz.
-
Beyond Single Trajectories: Optimal Control and Jordan-Lie Algebra in Hybrid Quantum Walks for Combinatorial Optimization
Hybrid quantum walks with optimal dynamical coin operators outperform QAOA on Max-Cut and MIS by accessing a strictly larger Jordan-Lie algebra that enables faster convergence and higher accuracy.
-
Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.
-
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
-
Quantum Convolutional Neural Networks are Effectively Classically Simulable
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.
-
A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing
A literature review of VQAs covering ansatz design, classical optimization, barren plateaus, error mitigation strategies, and theoretical adaptations for fault-tolerant quantum computing.