Sparse power-of-two circuit connectivity provides task-dependent advantages for variational quantum learning, and a Monna-map qubit reordering enables short-range circuits to solve long-range problems.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
representative citing papers
A linear MPS tangent-space method for open-boundary systems is derived, and a particle-resolved rank tomography is introduced to diagnose the tangent space's expressivity limits.
Optimized non-uniform shot allocation guided by an equation-of-motion error cost function reduces measurement overhead by >2x and improves fidelity in noisy imaginary-time VQDS for 1D Ising ground states.
HAVQDS achieves higher approximation ratios on 6-14 qubit SK instances than adiabatic or CD methods while cutting CNOT counts by 1-2 orders of magnitude.
DDQN reinforcement learning automates VITE circuit design, producing circuits with ~37% fewer gates and ~43% less depth than hardware-efficient ansatze for Max-Cut while reaching Full-CI for H2 with shallower depth.
Presents a Neural Galerkin method that solves quantum dynamics globally via variational minimization of a Schrödinger loss, demonstrated on 1D/2D transverse-field Ising quenches showing non-thermalization in 2D.
citing papers explorer
-
Variational Learning with Sparse Long-range Entangling Gates
Sparse power-of-two circuit connectivity provides task-dependent advantages for variational quantum learning, and a Monna-map qubit reordering enables short-range circuits to solve long-range problems.
-
Excitation spectra and rank tomography of linear matrix product tangent spaces
A linear MPS tangent-space method for open-boundary systems is derived, and a particle-resolved rank tomography is introduced to diagnose the tangent space's expressivity limits.
-
Sampling Noise and Optimized Measurement Distribution in Imaginary-Time Quantum Dynamics Simulations
Optimized non-uniform shot allocation guided by an equation-of-motion error cost function reduces measurement overhead by >2x and improves fidelity in noisy imaginary-time VQDS for 1D Ising ground states.
-
Hybrid Real-Imaginary Time Evolution for Low-Depth Hamiltonian Simulation in Quantum Optimization
HAVQDS achieves higher approximation ratios on 6-14 qubit SK instances than adiabatic or CD methods while cutting CNOT counts by 1-2 orders of magnitude.
-
Investigation of Automated Design of Quantum Circuits for Imaginary Time Evolution Methods Using Deep Reinforcement Learning
DDQN reinforcement learning automates VITE circuit design, producing circuits with ~37% fewer gates and ~43% less depth than hardware-efficient ansatze for Max-Cut while reaching Full-CI for H2 with shallower depth.
-
Time-dependent Neural Galerkin Method for Quantum Dynamics
Presents a Neural Galerkin method that solves quantum dynamics globally via variational minimization of a Schrödinger loss, demonstrated on 1D/2D transverse-field Ising quenches showing non-thermalization in 2D.