arXiv subjects

Alexey V. Gorshkov

Publications and source records attributed to Alexey V. Gorshkov.

At least 37 records · Page 2Linked to original sources

arXiv2026

Unconventional entanglement scaling and quantum criticality in the long-range spin-one Heisenberg chain with single-ion anisotropy

Long-range interactions can fundamentally reshape the low-energy properties of low-dimensional quantum matter, altering both continuous symmetry breaking and topological phenomena. However, their impact on the quantum criticality separating these regimes remains poorly understood. We determine the ground-state phase diagram and critical properties of the spin-one Heisenberg chain with single-ion anisotropy and staggered antiferromagnetic power-law interactions, using matrix-product state (MPS) calculations complemented by high-order series expansions (pCUT+MC). Such long-range, non-frustrated interactions circumvent the Hohenberg-Mermin-Wagner theorem, thereby stabilizing continuous symmetry breaking (CSB) phases in direct competition with the Haldane phase. We map out the resulting phase diagram and analyze the entanglement entropy scaling behavior in the U(1) and SU(2) CSB phases, finding logarithmic corrections beyond the short-range, universal contributions expected from linearly dispersed Goldstone modes. We further characterize all critical boundaries through finite-size scaling of either the entanglement entropy or the staggered magnetization. In particular, the large-D-to-U(1)-CSB transition exhibits unconventional, continuously varying critical exponents as a function of the long-range decay exponent with a strong dependence on the imposed boundary conditions leading to distinct finite-size scalings for sufficiently long-range potentials. Remarkably, the Haldane-to-U(1)-CSB transition likewise displays unconventional quantum criticality with distinct continuously varying critical exponents. Our work positions this model as a target for near-term atomic platforms with tunable long-range couplings and exhibiting natural single-ion anisotropy, offering a minimal playground for exploring the interplay between long-range interactions, continuous symmetry breaking, and topology.

cond-mat.str-el↗

arXiv2026

Cycle-Structure Generating Functions for Special Breakpoint Graphs

Breakpoint graphs originate in comparative genomics, where their alternating cycles encode relationships between genomes. We study a constrained class of three-colored breakpoint graphs associated with permutations and develop cycle-refined generating functions for two extremal families. These families have a natural topological interpretation: their canonical surfaces are, respectively, the sphere and the projective plane. The spherical family is characterized by noncrossing configurations, while the projective-plane family admits a different decomposition involving a distinguished family of Möbius ladders. The resulting generating-function equations retain the full cycle structure but nevertheless admit substantial reductions. This leads to explicit Catalan-weighted evaluations, polynomiality results for refined cycle statistics, and a connection between a natural diagonal specialization and noncrossing trees. The two topological families exhibit markedly different combinatorial mechanisms, providing complementary examples of how local transformations of breakpoint graphs can control refined permutation enumerations. As a further application, the same Catalan-weighted sums arise in asymptotic unitary-Weingarten expansions for entanglement of random Gaussian states in linear optics. The combinatorial results determine the leading and constant-order moment polynomials entering the Rényi entropy expansion, with the projective-plane contribution giving the finite-size constant correction.

math.CO↗

arXiv2026

Higher moment theory and learnability of bosonic states

We present a sample- and time-efficient algorithm to learn any bosonic Fock state acted upon by an arbitrary Gaussian unitary. As a special case, this algorithm efficiently learns states produced in Fock state BosonSampling, thus resolving an open question put forth by Aaronson and Grewal (Aaronson, Grewal 2023). We further study a hierarchy of classes of states beyond Gaussian states that are specified by a finite number of their higher moments. Using the higher moments, we find a full spectrum of invariants under Gaussian unitaries, thereby providing necessary conditions for two states to be related by an arbitrary (including active, e.g. beyond linear optics) Gaussian unitary.

quant-ph↗

arXiv2026

Anticoncentration and entanglement in Gaussian boson sampling

Anticoncentration and entanglement are two properties used to study classical hardness or easiness of Gaussian boson sampling in varying regimes. In this paper, we consider three directions concerning anticoncentration and entanglement in Gaussian boson sampling: (1) We derive closed-form expressions for the second moment of hafnians of symmetric Gaussian products, and use this to precisely locate the anticoncentration transition as a function of the number of squeezed input modes. (2) We derive closed-form expressions for the Rényi-$α$ Page curves for Gaussian boson sampling. (3) We study unequal input squeezing parameters $(s_i)_i$, and prove estimates as well as monotonicity of the average-case Rényi-2 entropy Page curve in terms of the magnitudes $|s_i|$, which allow for extending equal squeezing results to unequal squeezing.

quant-ph↗

arXiv2026

Fast GHZ encoding with $1-o(1)$ fidelity

We prove that $(1-o(1))$-fidelity $N$-qubit Greenberger--Horne--Zeilinger (GHZ) encoding can be performed in time $O(\log N/N)$ using all-to-all 2-local Hamiltonians with bounded 2-qubit interaction terms. This saturates the theoretical lower bound $Ω(\log N/N)$, and by rescaling, also saturates the lower bound on signaling time for Hamiltonians with power-law interaction strengths $1/r^γ$, $γ<d$ in dimension $d$. The protocol uses spin-squeezing dynamics combined with quantum signal processing.

quant-ph↗

arXiv2026

Proof of the hiding conjecture for Gaussian boson sampling with an arbitrary number of squeezed input modes

Gaussian boson sampling (GBS) is a sampling task proposed to demonstrate quantum advantage. We consider Gaussian boson sampling on $M$ optical modes, with $K$ equally squeezed input modes and $N$ observed photon counts. We complete the proof of the hiding conjecture for Gaussian boson sampling with an arbitrary number of squeezers $K$, which is a part of the argument for classical hardness of GBS. In particular, we show that for any $K$ and $N=o(\sqrt{K})$, the symmetric product $MK^{-1/2}U_{NK}U_{NK}^T$, for $U_{NK}$ the top left $N\times K$ submatrix of an $M\times M$ Haar random unitary $U$, is close in total variation distance to both an $N\times N$ symmetric complex Gaussian matrix $\mathbf G$ with independent entries, and the symmetric product $GG^T/\sqrt{K}$ for $G$ an $N\times K$ matrix of iid standard complex Gaussians. We show however that the density-based instance generating method of [Aaronson and Arkhipov, Theory Comput. 9, 143 (2013), Lemma 5.8] used to efficiently implement a hiding procedure fails for Gaussian boson sampling with $K=cM$ if $c<1/2$. Instead we use approximate instance generating to implement the hiding for the usual classical hardness reduction.

quant-ph↗

arXiv2026

Thermal Throttling of Quantum State Transfer

Quantum state transfer on qubit lattices is a crucial step in a panoply of quantum information processing tasks. Understanding its fundamental limits in the presence of practical imperfections remains a pressing open question. In particular, it is unclear how thermal noise in the intermediate ancilla sites impedes transfer. In this work, we derive tight lower bounds on the necessary growth of commutator norms to achieve approximate state transfer. Specializing to 1D power-law systems with thermal ancilla states, we demonstrate that state transfer runtimes depend sensitively on the scaling of temperature with system size, improving logarithmic bounds to algebraic ones. Our work extends previous results on exact state transfer to the qualitatively different and more practically relevant regime of approximate state transfer.

quant-ph↗

arXiv2026

Measurement-induced entanglement in noisy 2D random circuits

We study measurement-induced entanglement (MIE) generated by column-by-column sampling of noisy 2D random circuits of size $N$ and depth $T$. Focusing primarily on Clifford circuits and using the operator entanglement $S_{\rm op}$ of the sampling-induced boundary state as a proxy for computational complexity, first, we reproduce in the noiseless limit a finite-depth transition from area- to volume-law scaling at a threshold depth $T_c=6$. In contrast, in the presence of single-qubit depolarizing noise at any constant rate $p>0$, we find that the operator entanglement $S_{\rm op}$ obeys an area law, with its maximum value scaling approximately linearly with $T/p$ in the regime $T>T_c$. By analyzing the spatial distribution of stabilizer generators, we observe exponential localization of stabilizer generators; this both accounts for the scaling of the maximal $S_{\rm op}$ and implies an exponential decay of conditional mutual information across buffered tripartitions, which we also confirm numerically. Together, these results indicate that constant local noise destroys long-range MIE in 2D random Clifford circuits, and that a tensor-network based algorithm can efficiently sample from noisy 2D random Clifford circuits (i) at sub-logarithmic depths $T = o(\log N)$ for any constant noise rate $p = Ω(1)$, and (ii) at constant depths $T = O(1)$ for noise rates $p = Ω(\log^{-1}N)$. Finally, we turn to depth $T=4$ Haar-random and measurement-based quantum computing-type circuits, providing evidence that MIE in noisy 2D Haar-random circuits exhibits the same qualitative behavior as in random Clifford circuits, and that noise destroys the volume-law scaling of MIE in non-Clifford circuits.

quant-ph↗

arXiv2026

Fault-Tolerant Heisenberg-Limited Quantum Sensing

Quantum sensors hold great promise for achieving better sensitivity in the measurement of physical quantities compared to their classical counterparts. However, the conditions under which quantum advantage in sensing can be achieved are rather restrictive, and most quantum enhancements in sensing are lost in the presence of noise, errors, or a poorly calibrated system. To overcome these limitations, we are motivated to import ideas from fault-tolerant quantum computing to quantum sensing. Specifically, we consider a qubit noise model where the probability of phase-flip errors is exponentially smaller (in qubit number) compared to the probability of bit-flip errors that occur with probability $p$. For this noise structure, we demonstrate that, given a total sensing time $T$, Heisenberg scaling can be attained for times up to $T\propto 1/p^{(N+1)/2}$ for a $N$-qubit repetition code, in contrast with $T\propto 1/p$ without using a fault-tolerant sensing protocol.

quant-ph↗

arXiv2026

Anomalous Boundary Modes in a Floquet Hyperbolic System

We construct an anomalous Floquet topological phase on a negatively curved hyperbolic lattice. The model is a tight-binding Hamiltonian with a periodically repeated four-color edge-hopping sequence and a sublattice-staggered onsite potential step. The topological regime is reached near the limit in which a single hopping step transfers amplitude completely across an active edge, while the trivial regime is reached near the point where two full hops occur along an active edge during a single hopping step, returning the amplitude to its starting site. In finite open patches, the topological regime is characterized by bulk quasienergy gaps at $0$ and $π$ that are populated by in-gap states, in contrast to a trivial regime where these gaps remain empty. Using compact periodic lattices, we map the bulk $0$ and $π$ quasienergy gaps and identify the gapped regions connected to the trivial and anomalous open-boundary spectra. We diagnose the in-gap states as chiral boundary modes by their real-space dynamics. Finally, we introduce a small-boundary spectral-flow diagnostic based on punctured periodic hyperbolic lattices, which avoids the ambiguity associated with the extensive outer boundary of finite hyperbolic patches. This puncture-based diagnostic should be useful for studying other topological hyperbolic systems.

cond-mat.mes-hall↗

arXiv2026

Fock-state preparation based on amplitude amplification in cavity QED

In this work, we develop a coherent control technique for cavity QED based on amplitude amplification. We consider two physical platforms. In the first setting, we study a three-level quantum emitter coupled to a single mode of an optical cavity and introduce a protocol for producing traveling single photons based on oblivious amplitude amplification. As the key ingredient of our protocol, we propose an extension of oblivious amplitude amplification which uses reflection unitaries solely on the signal qubit, along with $U$ and $U^\dagger$, where the unitary $U$ prepares the initial state. Our approach improves the scaling of the single-photon-generation protocol length from $N\sim 1/p$ to $N\sim 1/\sqrt{p}$, with $p$ denoting the success probability of obtaining a short single photon from a single application of the weak control pulse. Furthermore, our protocol also reduces the error from intrinsic cavity loss compared to protocols using a single strong control pulse in various experimentally relevant regimes, suggesting the application of our methods for error reduction. In the second setting, we consider a superconducting qubit coupled to a single bosonic mode of a microwave cavity in a circuit QED architecture in the dispersive regime for preparing Fock states. Using fixed-point amplitude amplification, we obtain a protocol for preparing Fock states whose length scales as $O(n^{1/4})$, where $n$ is the number of photons. Additionally, as an application of our methods for state preparation, we describe a protocol for preparing NOON states.

quant-ph↗

arXiv2026

Differentially private quantum sensor networks

Quantum sensing is a promising technology capable of demonstrating clear advantage over comparable classical techniques for precise measurement. One application of quantum sensing is in function estimation, which can be done using a network of entangled quantum sensors, allowing for measurements with greater optimal sensitivity than unentangled sensing protocols. In cases where quantum sensor networks will be used to measure data that should remain private (e.g., biomedical data), it is imperative that these protocols include a privacy mechanism to hide sensitive information. In this work, we show that entangled sensor networks are vulnerable to certain privacy-violating attacks. To mitigate these attacks, we introduce secure sensing protocols endowed with differential privacy. We reconcile differential privacy with retaining Heisenberg-limited scaling, and introduce several protocols achieving varying balances between the two. We show that our main protocol, an $n$-node network sensing protocol that injects noise directly into the sensing Hamiltonian, exhibits a tradeoff between the desirable $O(1/n^2)$ Heisenberg scaling of the mean-squared error of the function estimate and the level of privacy attainable. Under assumptions on the network (a common source of randomness and a constant fraction of honest parties), we show that this protocol is locally implementable and achieves $(O(1), δ)$-differential privacy for arbitrarily small $δ$ while retaining Heisenberg scaling of the mean-squared error. We prove that our protocols are resilient to attacks by broad classes of classical and quantum adversaries, and find advantages in the privacy-utility tradeoff when using quantum techniques.

quant-ph↗

arXiv2026

An efficient Pauli decomposition algorithm for structured matrices

Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only $k = \mathsf{poly}(n)$ Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in $n$. We present a randomized classical algorithm that does take advantage of this sparsity and recovers the exact Pauli decomposition with success probability at least $1 - δ$, for any $δ$. Under the stated access model, the algorithm executes with query and runtime complexity that is polynomial in $n$, $k$, and $\log(1/δ)$. These results show that, even though finding the Pauli decomposition is exponentially hard for general matrices, it becomes efficiently solvable for matrices that are known to be sparse in the Pauli basis, a regime that is relevant to near-term quantum algorithms operating on structured classical input.

quant-ph↗

arXiv2026

Butterfly Echo Protocol for Axis-Agnostic Heisenberg-Limited Metrology

The extreme sensitivity of chaotic systems to external perturbations makes them natural candidates for sensing applications. We propose a single-shot echo-based protocol for estimating small rotations about an unknown axis that leverages random symmetric probe states prepared via chaotic dynamics. In contrast to previous protocols for this axis-agnostic rotation sensing problem that depend on difficult-to-prepare anticoherent states, the random probe states used in our protocol can be prepared via constant-depth chaotic circuits composed of random one-axis twisting pulses. Further, the signal of interest can be extracted simply by measuring the total spin polarization. We demonstrate analytically that our protocol achieves Heisenberg scaling relative to an arbitrary rotation axis that need not be a priori known. We also investigate the effects of collective and single-particle dephasing in our protocol using analytical and numerical tools. While the requirements on dephasing rates to maintain Heisenberg sensitivity are strict, they are achievable in near-term experiments, for instance, in magnetometric rotosensing with high-spin lanthanide atoms such as dysprosium-164.

quant-ph↗

arXiv2026

String-Breaking Dynamics in Quantum Adiabatic and Diabatic Processes

Confinement prohibits isolation of color charges, e.g., quarks, in nature via a process called string breaking: the separation of two charges results in an increase in the energy of a color flux, visualized as a string, connecting those charges. Eventually, creating additional charges is energetically favored, hence breaking the string. Such a phenomenon can be probed in simpler models, including quantum spin chains, enabling enhanced understanding of string-breaking dynamics. A challenging task is to understand how string breaking occurs as time elapses, in an out-of-equilibrium setting. This work establishes the phenomenology of dynamical string breaking induced by a gradual increase of string tension over time. It, thus, goes beyond instantaneous quench processes and enables tracking the real-time evolution of strings in a more controlled setting. We focus on domain-wall confinement in a family of quantum Ising chains. Our results indicate that, for sufficiently short strings and slow evolution, string breaking can be described by the transition dynamics of a two-state quantum system akin to a Landau-Zener process. For longer strings, a more intricate spatiotemporal pattern emerges: the string breaks by forming a superposition of bubbles (domains of flipped spins of varying sizes), which involve highly excited states. We finally demonstrate that string breaking driven only by quantum fluctuations can be realized in the presence of sufficiently long-ranged interactions. This work holds immediate relevance for studying string breaking in quantum-simulation experiments.

quant-ph↗

arXiv2026

Quantum Algorithms for Simulating Nuclear Effective Field Theories

Quantum computers offer the potential to simulate nuclear processes that are classically intractable. With the goal of understanding the necessary quantum resources to realize this potential, we employ state-of-the-art Hamiltonian-simulation methods, and conduct a thorough algorithmic analysis, to estimate the qubit and gate costs to simulate low-energy effective field theories (EFTs) of nuclear physics. Within the framework of nuclear lattice EFT, we obtain simulation costs for the leading-order pionless and pionful EFTs. For the latter, we consider both static pions represented by a one-pion-exchange potential between the nucleons, and dynamical pions represented by relativistic bosonic fields coupled to non-relativistic nucleons. Within these models, we examine the resource costs for the tasks of time evolution and energy estimation for physically relevant scales. We account for model errors associated with truncating either long-range interactions in the one-pion-exchange EFT or the pionic Hilbert space in the dynamical-pion EFT, and for algorithmic errors associated with product-formula approximations and quantum phase estimation. We find that the pionless EFT is the least costly to simulate, followed by the one-pion-exchange theory, then the dynamical-pion theory. We demonstrate how symmetries of the low-energy nuclear Hamiltonians can be utilized to obtain tighter error bounds. By retaining the locality of nucleonic interactions when mapped to qubits, we achieve reduced circuit depth and substantial parallelization. In the process, we develop new methods to bound the algorithmic error for classes of fermionic number-preserving Hamiltonians, and obtain tighter Trotter error bounds by explicitly computing nested commutators of Hamiltonian terms. Compared to previous estimates for the pionless EFT, our results represent an improvement by several orders of magnitude.

quant-ph↗

arXiv2026

Multiparameter function estimation for general Hamiltonians

Estimation of physical parameters encoded in a Hamiltonian is a central task in quantum sensing and learning. While the ultimate precision limit for estimating a single parameter coupled to a single generator is well established, the corresponding bound for estimating a function of multiple parameters-each coupled to distinct and possibly non-commuting generators-remains unknown in general. Here, we derive the ultimate quantum limit and present an estimation protocol for any function of parameters in a general Hamiltonian that attains this bound. We show that, although the task is fundamentally a multiparameter problem, our tight bound reduces to an optimized single-parameter quantum Cramér-Rao bound, even for arbitrary generator sets. Our result unifies and extends previous works, providing a general framework for optimal function estimation in quantum systems.

quant-ph↗

arXiv2026

Multimode Strong-Coupling Processes in Circuit QED Lattices

Circuit QED systems provide an ideal platform for exploring the strong-coupling regime of multimode cavity QED. Here we present two new phenomena from multimode strong coupling: a circuit Lagrangian analysis which captures beyond tight-binding effects of strong photon-photon coupling and experimental observation of strong wave-mixing resonances in the qubit response. Our circuit analysis reveals qualitatively new features such as emergent band gaps, lifted degeneracies, broadened flat bands, and frequency-dependent hopping. Within the multimode photon environment, strong qubit-photon coupling in turn gives rise to multiphoton processes involving multiple normal modes. We demonstrate a strong four-wave-mixing process involving excitation of a qubit and simultaneous frequency conversion between modes. Notably, this wave-mixing process is dominated by localized flat-band modes of the photonic lattice, which exhibit the strongest coupling to the transmon qubit.

quant-ph↗