REVIEW 98 cited by
Quantum Computation by Adiabatic Evolution
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are unable to estimate this gap in general. We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.
Forward citations
Showing 60 of 98 Pith papers that cite this
-
Time-Dependent Hamiltonian Simulation with Optimal Query Complexity
For Lipschitz time-dependent Hamiltonians, the new algorithm uses O(alpha T + log(1/epsilon)/log(e + log(1/epsilon)/(alpha T))) HAM-T queries, matching the lower bound for time-independent simulation.
-
Universal energy-space localization and stable quantum phases against time-dependent perturbations
For q-local Hamiltonians with bounded change, an initial eigenstate remains exponentially concentrated in a macroscopic energy window under arbitrary time-dependent perturbations.
-
Quantum Glassiness From Efficient Learning
Efficient learning algorithms for energy estimation imply that stable quantum algorithms cannot prepare low-energy states in systems exhibiting the quantum overlap gap property, as proven for a sparsified quantum p-sp...
-
Non-Hermitian Quantum Adiabatic Algorithm
A history-decoupled Hamiltonian mapping makes non-Hermitian adiabatic quantum optimization pseudospectrally stable, achieving polynomial-time (per configuration) evolution on the CK maximum-independent-set benchmarks.
-
Reshaping quantum annealing landscapes with diagonal catalysts
Catalysts built from sign-propagated path patterns reshape the Hamming-distance structure of Ising landscapes and increase near-solution probability in quantum annealing simulations.
-
Dissipation-Induced Deviations from Kibble-Zurek Scaling in Non-Hermitian Quantum Annealing
In the non-Hermitian transverse-field Ising model, dissipation causes defect density to exhibit Kibble-Zurek, anti-Kibble-Zurek, or super-Kibble-Zurek scaling due to excitations across broad momentum sectors rather th...
-
Towards a Control interpretation of Quantum Advantage
The paper proposes identifying quantum advantage with the existence of a polynomial-in-n upper bound on the minimal time to achieve operator controllability for bilinear quantum control systems on SU(N).
-
Engineered dissipation for faster adiabatic state preparation
Engineered dissipation via a filtered reservoir relaxes leaked population during adiabatic state preparation, improving runtime scaling from O(Δ^{-2}) to O(Δ^{-1}) when relaxation strength greatly exceeds the minimum gap.
-
Spatial Search by Nonlinear Quantum Walk
Nonlinear quantum walks achieve speedups for spatial search on sufficiently complete graphs such as Paley graphs and complete bipartite graphs, and on high-dimensional lattices.
-
Multivariate Decoded Quantum Interferometry for Weighted Optimization
The work develops multivariate DQI states for weighted Max-LINSAT over prime fields, derives closed-form asymptotic expressions for expectation values and concentration, provides an explicit single-decoder preparation...
-
Multi-Mode Quantum Annealing for Generative Representation Learning with Boltzmann Priors
A multi-mode quantum annealing approach enables VAEs with Boltzmann priors, showing faster training and better generation than Gaussian-prior VAEs on MNIST, Fashion-MNIST, and CelebA plus improved out-of-distribution ...
-
Bundling of bipartite entanglement
A proposed condition for equal entanglement spectra across bipartitions is invalid as stated; crossed quotient equality provides a counterexample, though an ordered version might repair the approach.
-
Phase Estimation with Compressed Controlled Time Evolution
A compression protocol for controlled time evolution of local translationally invariant Hamiltonians achieves O(t polylog(t N/ε)) circuit depth with additive control overhead, demonstrated via 414 CNOT gates for itera...
-
Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedup...
-
Continuous measurement-based holonomic quantum computation
Repeated measurements of slowly rotated stabilizer generators confine a code state to a moving code space and apply a logical unitary holonomy, with derived success probabilities and a path-correction method.
-
Toward Minimum Graphic Parity Networks
The minimum size of a graphic parity network for a connected graph is at least m+n-1, rising to m+Omega(n^1.5) for graphs with no short cycles, and a randomized construction achieves m+O(n^1.5 sqrt(log n)).
-
High-order Magnus Expansion for Hamiltonian Simulation
Arbitrary-order Magnus expansion is shown to have commutator-scaling error bounds and a polynomial-cost quantum circuit, yielding a time-dependent Hamiltonian simulation algorithm with O~(αbar^{1+1/p} T^{1+1/p}/ε^{1/p...
-
Large time-step discretisation of adiabatic quantum dynamics
A discrete adiabatic theorem viewpoint shows that first-order and higher-order Trotter or exponential-integrator discretizations of adiabatic quantum dynamics admit O(1) time steps, and under boundary cancellation may...
-
A More Convex Ising Formulation of Max-3-Cut Using Higher-Order Spin Interactions
A four-spin Ising formulation for Max-3-Cut removes the energy barriers of one-hot encoding and is about 2.75x faster than a rescaled quadratic baseline on an analog Ising simulator.
-
Magnetic Hysteresis Experiments Performed on Quantum Annealers
The paper introduces the first general protocol for magnetic hysteresis on programmable quantum annealers and reports non-monotonic dependence of loop area on quantum fluctuations along with disorder-induced steps.
-
Accelerated spin-adapted ground state preparation with non-variational quantum algorithms
A two-step penalty and post-processing scheme cuts the gate complexity of non-variational spin-adapted ground state preparation from quartic to quadratic scaling for spin-rotationally symmetric Hamiltonians.
-
Robust quantification of spectral transitions in perturbed quantum systems
For H = γH0 + V with spectral gap η and bounded V, the eternal leakage between coarse-grained spectral components is bounded by (1 - 4π∥V∥/(γη))^{-1/2} - 1.
-
The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
The paper decomposes dynamical Lie algebras of XY-mixer topologies and demonstrates warm-starting QAOA via pre-training on restricted generators to improve convergence on constrained optimization problems.
-
Adiabatic quantum unstructured search in parallel
A new adiabatic schedule for unstructured search gives a marked-state probability that grows linearly with time in the ideal limit and guarantees probability p in O(√N(1+p/ε)) time.
-
Elevating Variational Quantum Semidefinite Programs for Polynomial Objectives
Product-State Lifting (PSL) upgrades any basis-state vQSDP to k-degree polynomial optimization via product-register encoding, with linear resource scaling and k-independent constraints.
-
Proof of avoidability of the quantum first-order transition in transverse magnetization in quantum annealing of finite-dimensional spin glasses
Rigorous proof that appropriate quantum annealing avoids quantum first-order transitions in transverse magnetization for all finite-dimensional spin systems.
-
Controlled Gate Networks: Theory and Application to Eigenvalue Estimation
Controlled gate networks reduce two-qubit gate counts for linear combinations of unitary operators in quantum circuits, shown in variational calculations, rodeo eigenvalue estimation, and lattice nucleon evolution on ...
-
Resource-efficient quantum-selected configuration interaction for molecular properties
A heuristic Pauli-term screening cuts QSCI Hamiltonian resources by ~98% and reproduces CASCI energies and dipole moments for Group IIIA monofluorides in simulation and on 20-qubit IBM hardware.
-
Digital techniques for the frustrated Ising ring: the role of counter-diabatic terms
On a frustrated Ising ring, CRAB-optimized DC-QAOA with variational counter-diabatic terms gives lower residual energy than analytical CD, optimized schedules, and plain QAOA.
-
Chiral Entangled-State Generation through Dissipative Quantum Dynamics
Encircling a parameter loop clockwise versus counterclockwise in a dissipative two-qubit photonic system prepares different Bell states, with extension to three-qubit GHZ states.
-
Universal Parent Hamiltonians for Adiabatic Warm Starts
A quantum algorithm framework that converts any circuit-prepared state into an initial Hamiltonian for adiabatic state preparation, with numerical evidence that same-phase MPS warm starts improve adiabatic gaps.
-
A Geometric Theory of Fermion-to-Qubit Encodings
The paper proposes that Bravyi–Kitaev and Xia–Bian–Kais encoded Hamiltonians carry geometric structure whose spectral and transport descriptors reflect interaction-driven reorganization, but the strongest "exact" clai...
-
Worldline-Susceptibility Scheduling for Quantum Annealing Beyond Local-Adiabatic Evolution
A quantum-annealing schedule built from worldline susceptibility fluctuations measured during simulated annealing outperforms linear and often gap-based schedules on small Sherrington–Kirkpatrick instances.
-
Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data
qReduMIS, using QAOA frozen-node signals plus classical reductions, solves real market MIS portfolio instances up to 225 assets on Helios with far better success and TTS scaling than standalone QAOA.
-
Leveraging Landau-Zener-St\"uckelberg interference for accelerating diabatic quantum annealing
Landau-Zener-Stückelberg interference enables a reduced-parameter variational ansatz for diabatic quantum annealing that permits polynomial-time classical schedule optimization and yields numerical speedups over adiab...
-
Projector Quantum Variational Ansatz
The Projector Variational Ansatz (PVA) is a new VQE ansatz that can match ISQ-QSP or ADAPT-VQE structures and converges with shallower circuits than standard ADAPT-VQE in experiments.
-
Continuous-variable ADAPT-VQE for bosonic lattice models
CV-ADAPT-VQE with tailored symmetry-preserving pools achieves significantly shallower circuits than Hamiltonian-based VQE for bosonic lattice models in GPU classical simulations.
-
Quantum annealing for materials
Presents a path-integral molecular dynamics implementation of quantum annealing for global optimization of atomic structures using empirical or machine-learned potentials.
-
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.
-
Quantum circuit design via dynamic Pauli constraints
Introduces Motte model proving equivalence between Pauli-constraint quantum circuits with tomography and coupling-graph-restricted circuits, yielding BQP universality with O(D² N log N) overhead and robustness to tomo...
-
Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression
A recipe for initial points in variational compression of quantum time-evolution operators that provably converges to near-optimal O(N t polylog(N t/ε)) gate complexity for local translationally invariant Hamiltonians.
-
Efficient Hamiltonian Engineering for Adiabatic MIS Algorithms
Local degree-dependent controls in Rydberg adiabatic MIS algorithms accelerate convergence and reduce fidelity decay by 25% compared to global controls in numerical simulations.
-
Quantum End-to-End Learning for Contextual Combinatorial Optimization
QEL is the first quantum end-to-end learning framework for contextual combinatorial optimization using QAOA with a context re-uploading phase-separator, achieving competitive performance with fewer parameters.
-
CVaR-Assisted Custom Penalty Function for Constrained Optimization
A slack-free step-penalty combined with CVaR tail sampling improves VQE optimality gaps on multi-dimensional knapsack benchmarks versus slack-based QUBO.
-
Factorization Machine with Quadratic-Optimization Annealing for RNA Inverse Folding and Evaluation of Binary-Integer Encoding and Nucleotide Assignment
In RNA inverse folding, FMQA with one-hot or domain-wall encoding finds lower-defect sequences with fewer evaluations than binary/unary encodings and than TPE, GA, and random search on the tested benchmarks.
-
Variational matrix product states for combinatorial optimization
Quantum-inspired product/matrix-product-state annealing embedded in iterated local search reports better MaxCut approximations than the ILS, LQA, GCS, and QAOA baselines tested, on graphs up to 50,000 vertices.
-
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.
-
Programmable Rapid Adiabatic Passage laser pulses for Ultra-fast Gates on trapped ions
Using STIRAP-shaped pulses from a programmable CW laser source, ultrafast trapped-ion entangling gates can stay above 99.99% fidelity despite intensity and detuning fluctuations.
-
A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization
Random samples of a compressible combinatorial objective, converted to moment sketches and decoded by matching pursuit, can recover the optimum with far fewer function calls than brute force.
-
Singularity-free dynamical invariants-based quantum control
Invariant-based qubit control is made singularity-free by trajectory splitting, and the pulse family is optimized against non-Markovian noise via whitebox or graybox models.
-
Frustration-Enhanced Quantum Annealing Correction Models with Additional Inter-replica Interactions
On the frustrated ring benchmark, antiferromagnetic inter-replica coupling in the periodic-boundary stacked model boosts success probability at short annealing times because many low-lying excited states decode to the...
-
Quantum algorithms for equational reasoning
Presents a quantum Hamiltonian whose ground state encodes equivalence classes of expressions, enabling verification, counting, and structural queries on instances far beyond classical reach.
-
Preparation of cat states in many-body eigenbasis via non-local measurement
Periodically checking that a spin-1 XY chain is not in a chosen product state leaves a dark manifold of resonantly degenerate eigenstates, producing GHZ-like and time-oscillating cat states at long times.
-
Ground-state reachability for variational quantum eigensolvers: a Rydberg-atom case study
For Rydberg-atom VQE with global controls, a symmetry analysis of invariant subspaces predicts when the ground state is unreachable; the necessary condition matches simulations for Ising and Heisenberg targets up to t...
-
State-Based Quantum Simulation of Imaginary-Time Evolution
A postselected controlled-SWAP protocol implements imaginary time evolution by decomposing the Hamiltonian into quantum states.
-
Quantum computation of hadron scattering in a lattice gauge theory
On a trapped-ion quantum computer, the authors prepared multiple meson wave packets and simulated their early-time collisions in a 1+1D Z2 lattice gauge theory.
-
Truncated Variational Hamiltonian Ansatz: efficient quantum circuit design for quantum chemistry and material science
tVHA truncates a Hamiltonian variational ansatz by discarding small non-Coulomb two-body terms, reducing CNOT counts by factors of 2 to 5 on LiH, H2, H4, and CH2 test systems while often staying close to chemical accuracy.
-
Evaluating the performance of quantum processing units at large width and depth
A cross-vendor benchmark using fixed-parameter QAOA ranks 24 quantum processors by how well they preserve algorithmic signal at extreme circuit depth and width.
-
Distributed Quantum Dynamics on Near-Term Quantum Processors
dp-VQD combines projected variational quantum dynamics with wire cutting to run Hamiltonian evolution on more qubits than a single device has, using cuttable ansatze and a sliced Trotter step.
-
Left-Deep Join Order Selection with Higher-Order Unconstrained Binary Optimization on Quantum Computers
A HUBO-based encoding of left-deep join order selection claims DP-equivalent optimality and greedy-level guarantees with fewer variables, but the formal proof and validity constraints are incomplete.
Discussion (0). Continue with ORCID to comment.