Quantum algorithms achieve polynomial advantage for synchronization estimation and super-polynomial advantage for no-phase-locking certification in higher-order simplicial Kuramoto models under stated assumptions.
Title resolution pending
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 8verdicts
UNVERDICTED 8roles
method 1polarities
use method 1representative citing papers
Thermodynamic recycling of algorithmic failure branches enables information erasure with heat dissipation below the Landauer limit on a quantum processor.
New scalable QRAM simulator reveals post-selection constraints on error filtration and produces refined near-deterministic performance criteria.
An adiabatic protocol for quantum phase estimation that reaches optimal scaling T = O(1/ε log(1/δ)) by encoding eigenvalues in computational basis populations rather than phases.
Orthogonal FDM with rectangular pulses suppresses interference to enable high-fidelity simultaneous gates on multiple qubits via a single microwave line.
A quantum solver for PDEs is introduced via flexible matrix product operator representations with mid-circuit measurements and state-dependent norm correction to handle non-unitary dynamics.
Modified Quantum Volume test uses restricted universal circuits to directly determine heavy outputs without exponential classical simulation cost.
A symplectic framework links quantum evolution to classical Hamiltonian dynamics on Kähler manifolds, yielding exponentially compressed quantum representations for integrable systems and approximate versions for others via perturbation theory.
citing papers explorer
-
Efficient Quantum Algorithms for Higher-Order Coupled Oscillators
Quantum algorithms achieve polynomial advantage for synchronization estimation and super-polynomial advantage for no-phase-locking certification in higher-order simplicial Kuramoto models under stated assumptions.
-
Thermodynamic Recycling of Algorithmic Failure Branches: Quantum-Computer Demonstration with Quantum Error Correction
Thermodynamic recycling of algorithmic failure branches enables information erasure with heat dissipation below the Landauer limit on a quantum processor.
-
Refined Criteria for QRAM Error Suppression via Efficient Large-Scale QRAM Simulator
New scalable QRAM simulator reveals post-selection constraints on error filtration and produces refined near-deterministic performance criteria.
-
Adiabatic Quantum Phase Estimation
An adiabatic protocol for quantum phase estimation that reaches optimal scaling T = O(1/ε log(1/δ)) by encoding eigenvalues in computational basis populations rather than phases.
-
Orthogonal frequency-division multiplexing for simultaneous gate operations on multiple qubits via a shared control line
Orthogonal FDM with rectangular pulses suppresses interference to enable high-fidelity simultaneous gates on multiple qubits via a single microwave line.
-
Tensor-Programmable Quantum Circuits for Solving Differential Equations
A quantum solver for PDEs is introduced via flexible matrix product operator representations with mid-circuit measurements and state-dependent norm correction to handle non-unitary dynamics.
-
Benchmarking quantum devices beyond classical capabilities
Modified Quantum Volume test uses restricted universal circuits to directly determine heavy outputs without exponential classical simulation cost.
-
Symplectic perspective to quantum computing for Hamiltonian systems
A symplectic framework links quantum evolution to classical Hamiltonian dynamics on Kähler manifolds, yielding exponentially compressed quantum representations for integrable systems and approximate versions for others via perturbation theory.