A technique extracts k-local conserved operators from iPEPS by identifying vanishing fidelity susceptibility in a quantum geometry of parameter-deformed states, yielding improved parent Hamiltonians for RVB and deformed toric code states.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
fields
quant-ph 5verdicts
UNVERDICTED 5representative citing papers
Constructs boundary-consistent weakly relativistic lattice Hamiltonians for 1D first-quantized simulation by reconstructing momentum moments from cyclic translations (PBC) or finite differences (DBC), validated on benchmark potentials.
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
Provides component-wise energy estimates for Rydberg quantum computers and reports a potential energy advantage over classical DFT execution for the Quantum Fourier Transform under ideal error-free conditions.
Classical simulation of quantum annealing for the 1D Hubbard model up to 40 qubits reports substantial speed-up over Bethe-ansatz methods for half-filled cases.
citing papers explorer
-
Extracting conserved operators from a projected entangled pair state
A technique extracts k-local conserved operators from iPEPS by identifying vanishing fidelity susceptibility in a quantum geometry of parameter-deformed states, yielding improved parent Hamiltonians for RVB and deformed toric code states.
-
First-Quantized Relativistic Quantum Simulation with Periodic and Dirichlet Boundary Conditions
Constructs boundary-consistent weakly relativistic lattice Hamiltonians for 1D first-quantized simulation by reconstructing momentum moments from cyclic translations (PBC) or finite differences (DBC), validated on benchmark potentials.
-
Quantum algorithms based on quantum trajectories
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
-
Energetics of Rydberg-atom Quantum Computing
Provides component-wise energy estimates for Rydberg quantum computers and reports a potential energy advantage over classical DFT execution for the Quantum Fourier Transform under ideal error-free conditions.
-
Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing
Classical simulation of quantum annealing for the 1D Hubbard model up to 40 qubits reports substantial speed-up over Bethe-ansatz methods for half-filled cases.