Boundary-rank obstructions and measurement-assisted recovery in dissipative flat-band preparation

Mingdi Xu

Home/Archive/arXiv

arXiv · 2609.38933

Boundary-rank obstructions and measurement-assisted recovery in dissipative flat-band preparation

Mingdi Xu

View original source ↗Read source document ↗Export metadata ↓

Abstract

Number-conserving cooling can fail to prepare an interacting flat-band target when Pauli exclusion blocks its transfer destinations. We study this failure on vertex-edge decorated graphs at one particle per flat orbital. The rank of a cut block of the flat-orbital Gram matrix bounds the number of residual source directions that can remain flat. For sublinear-range cooling with no Hamiltonian term, separated spin domains on periodic decorated hypercubic lattices support exponentially many stationary states with a nonzero bright-particle density. For a chain with fixed finite cooling range, we construct a physical Fock initial state whose overlap with a wrong dark state is independent of system size. This gives fidelity and bright-density bounds valid at every time. In higher dimensions, the bare overlap decays with boundary area, while local boundary rotations prepare states with a finite failure weight in constant circuit depth. Dephasing the occupations of all compact bright modes restores global attraction to the ferromagnetic target when the graph and cooling destinations satisfy the stated conditions. The result allows Hamiltonians that preserve the target. The compressed dynamics in the strong-dephasing limit also remains attractive and has a positive gap at each fixed size. Gram calculations, finite-system dynamics, and Liouvillian spectra test the analytic results. Weak-dephasing and particle-transport bounds constrain the preparation time despite eventual convergence.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Mingdi Xu. 2026-10-01. Boundary-rank obstructions and measurement-assisted recovery in dissipative flat-band preparation. https://arxiv.org/abs/2609.38933

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quantum squeezing cannot beat the standard quantum limit

Quantum entanglement between particles is expected to allow one to perform tasks that would otherwise be impossible. In quantum sensing and metrology, entanglement is often claimed to enable a measurement precision that cannot be attained with the same number of particles and time, forgoing entanglement. Two distinct approaches exist: creation of entangled states that either i) respond quicker to the signal, or ii) are associated with lower noise and uncertainty. The second class of states are generally called squeezed states. Here we show that if our definition of success is a precision that is impossible to achieve using the same resources but without entanglement then squeezed states cannot succeed. In doing so we show that a single non-separable squeezed state provides fundamentally no better precision, per unit time, than a single particle.

quant-ph↗

arXiv2026

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding

Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a transformative change for many industries. In a recent breakthrough [Liu et al., PNAS 2021], the first efficient quantum algorithm for solving nonlinear differential equations was constructed, based on a single condition $R<1$, where $R$ characterizes the ratio of nonlinearity to dissipation. This result, however, is limited to the class of purely dissipative systems with negative log-norm, which excludes application to many important problems. In this work, we correct technical issues with this and other prior analysis, and substantially extend the scope of nonlinear dynamical systems that can be efficiently simulated on a quantum computer in a number of ways. Firstly, we extend the existing results from purely dissipative systems to a much broader class of stable systems, and show that every quadratic Lyapunov function for the linearized system corresponds to an independent $R$-number criterion for the convergence of the Carlemen scheme. Secondly, we extend our stable system results to physically relevant settings where conserved polynomial quantities exist. Finally, we provide extensive results for the class of non-resonant systems. With this, we are able to show that efficient quantum algorithms exist for a much wider class of nonlinear systems than previously known, and prove the BQP-completeness of nonlinear oscillator problems of exponential size. In our analysis, we also obtain several results related to the Poincaré-Dulac theorem and diagonalization of the Carleman matrix, which could be of independent interest.

quant-ph↗

arXiv2026

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization

We introduce SamBa-GQW, a novel quantum algorithm for solving binary combinatorial optimization problems of arbitrary degree with no use of any classical optimizer. The algorithm is based on a continuous-time quantum walk on the solution space represented as a graph. The walker explores the solution space to find its way to vertices that minimize the cost function of the optimization problem. The key novelty of our algorithm is an offline classical sampling protocol that gives information about the spectrum of the problem Hamiltonian. Then, the extracted information is used to guide the walker to high quality solutions via a quantum walk with a time-dependent hopping rate. We investigate the performance of SamBa-GQW on several quadratic problems, namely MaxCut, maximum independent set, portfolio optimization, and higher-order polynomial problems such as LABS, MAX-$k$-SAT and a quartic reformulation of the travelling salesperson problem. We empirically demonstrate that SamBa-GQW finds high quality approximate solutions on problems up to a size of $n=30$ qubits by only sampling poly($n$) states among $2^n$ possible decisions. Furthermore, SamBa-GQW compares in par with classically optimized variational approaches, such as the variational guided quantum walk and QAOA (the latter when run on deep circuits). This places Samba-GQW as a promising heuristic to tackle combinatorial problems beyond the NISQ regime.

quant-ph↗