Searcharxiv⌕ Search

arXiv subjects

Alexey V. Gorshkov

Publications and source records attributed to Alexey V. Gorshkov.

At least 19 recordsLinked to original sources
arXiv2026

Quantum-optimized phase closure for robust interferometric imaging

Closure phase enables imaging with ground-based interferometric arrays by canceling telescope-dependent phase errors due to atmospheric fluctuations. It can be obtained by measuring fringe phases on individual baselines forming a triangle and summing them. We show that closure phases can be measured more accurately with fewer photons by performing joint measurements on multiple photons. We first establish that at least three photons from the same atmospheric temporal phase-stability window are required for closure-phase information to survive the unknown telescope-dependent phase noise, and show that joint three-photon measurements already provide an advantage over single-photon measurements in the minimal three-telescope setting. We then turn to large arrays and consider estimating all bispectra---complex quantities whose phases are the closure phases---under a global mean-square error criterion. Although an $m$-telescope array contains $Θ(m^2)$ independent triangle bispectra, we show that physical constraints on the visibilities make the total information content grow only nearly linearly with $m$ at fixed accuracy. Exploiting this structure, we construct an efficient protocol using at most three-photon joint measurements with photon cost $\tilde{O}(m)$, whereas any sequential single-photon protocol requires $Ω(m^2)$ photons. When the number of detected photons per temporal stability window scales linearly with the array size, this allows the required exposure time to remain independent of $m$ up to logarithmic factors. We further analyze the complementary high-precision regime using multiparameter quantum metrology and find a similar advantage for collective measurements. Overall, our results show that quantum information processing techniques can substantially improve the sensitivity and robustness of optical interferometry.

quant-ph↗
arXiv2026

Pricing of graph-based quantum portfolios from first principles

A central topic in economics and finance is the valuation of strategic games and bets, of investments providing uncertain future cashflows, and of other asset-like structures and contracts. Often, such valuation involves a probabilistic model, random variables, and computing expectation values of complex payoffs. Extending beyond this classical framework, a scenario emerges where assets are non-commuting operators and the inherent uncertainty is described by quantum states. In this work, we combine such notions of quantum finance with a graph-theoretic framework and ideas from contextuality. We discuss exclusive quantum assets and introduce scenarios when holding such assets can provide advantages over holding classical assets. In particular, we consider a "quantum market" based on nonlocal games such as the CHSH game and demonstrate that this setting can function as a market with well-defined financial structures. We provide upper bounds on the fair prices of the quantum assets based on graph-theoretic quantities like the independence number and the Lovász theta number. Our insights into markets of non-commuting assets help to elucidate what a financial system in a world filled with quantum technology could look like.

quant-ph↗
arXiv2026

Super-Exponential Advantage of Squeezed Light in Phase Estimation under Discrete Phase Randomisation

A paradigmatic task in quantum metrology is that of phase estimation. For this task it is commonly believed, under reasonable assumptions about prior information, that a quadratic advantage in sensitivity is the maximum possible advantage offered by the use of quantum resources. In this work, we consider a channel that implements a phase shift by an angle $2πk/M$, where $k$ is a uniformly random unknown integer, in addition to a small unknown phase shift of interest. We show that, subject to a constraint on the mean photon number per channel use, there is a super-exponential separation between the quantum Fisher information (QFI) attainable using a squeezed vacuum state and that attainable using coherent states. This advantage holds over any state obtained from a coherent state via phase covariant channels. Specifically, when the mean photon number per channel use is 1, the ratio of their QFI grows as $Ω[(M/\sqrt{2}e)^M]$. For a mean photon number per channel use of $M/\log(M)$, the squeezed vacuum QFI is $Ω(M^{3/2}/\sqrt{\log(M)})$, whereas for a coherent state it is at most $\exp[-M\log\log(M)+O(M)]$. We complement this QFI analysis with non-asymptotic estimation results. For a mean photon number per channel use of $M/\log M$, an explicit squeezed-vacuum protocol estimates the phase to accuracy $O(1/M)$ using $O(\sqrt{M\log M})$ channel uses, whereas every coherent state protocol requires at least $\exp[M\log\log M-O(M)]$ channel uses. We consider the effects of noise and show that the ratio of their QFIs can still grow super-exponentially in $M$. Finally, under fixed optical loss and thermal noise, choosing $\bar n=M^2/(\log M)^{3/2}$ allows squeezed vacuum with heterodyne detection to achieve accuracy $O(1/M)$ using sub-polynomially many channel uses, whereas every protocol in the specified classical family requires super-polynomially many.

quant-ph↗
arXiv2026

Ordering-Aware Theory of Trotter Error

Product formulas are a basic tool for simulating quantum many-body dynamics, but a fundamental degree of freedom in their application---the ordering of Hamiltonian terms---has remained largely unexplored. Here we systematically study such ordering effects, quantifying their impact on simulation accuracy and exploiting them to design more accurate product-formula simulations. We develop an efficiently computable, ordering-sensitive bound on the finite-step-size Trotter error for geometrically local Hamiltonians for arbitrarily high-order product formulas. For translation-invariant one-dimensional chains, our bounds are close to exact second-, fourth-, and sixth-order Trotter errors in small-system tests, while on large-scale systems they improve on previous higher-order analytical bounds by orders of magnitude. We further use the local structure of the error bounds and estimates to optimize ordering efficiently, reducing the long-chain problem to a minimum-mean-weight-cycle problem on a weighted de Bruijn graph. For random translation-invariant chains, sequential (staircase-like) orderings consistently outperform standard brickwall circuits; when circuit depth is restricted, the optimizer instead favors wave-like parallel-sequential orderings, which preserve much of the accuracy advantage over brickwall circuits. These results establish ordering as a useful degree of freedom for both understanding and improving product-formula simulation.

quant-ph↗
arXiv2026

Function-like pseudorandom unitaries generate pseudorandom quantum processes

Haar-random unitaries provide a canonical model of generic random quantum evolution, but they typically have exponential description and circuit complexity. Although pseudorandom unitaries efficiently emulate a single Haar-random unitary, many tasks require an entire reusable family of independently random-looking operations. We introduce pseudorandom function-like unitaries (PRFU), which generate such a family indexed by public labels using only a single short key. We distinguish classical- and coherent-label access and establish security under adaptive quantum queries. For classical labels, we provide a generic construction from a post-quantum pseudorandom function and a pseudorandom unitary. For coherent labels, we use an indexed path-recording framework to analyze interference across labels and prove security of a construction based on quantum-secure function and permutation primitives. We further show that PRFUs generate pseudorandom channels and quantum combs with private memory, which are secure against adaptive interventions and concurrent sessions. Combining PRFUs with unitary gluing yields a one-key family of pseudorandom unitaries whose supported register widths can be chosen after key generation. Further applications include nonce-resolved quantum authentication, coherently masked QRAM queries, and efficient emulation of random multi-time dynamics. Our results extend quantum pseudorandomness from individual operations to efficiently generated families of random-looking quantum dynamics.

quant-ph↗
arXiv2026

Learning Many-Body Hamiltonians Using a Local Probe

Hamiltonian learning provides a systematic framework for reconstructing unknown quantum dynamics. However, existing protocols typically assume direct measurement access to the entire system. With fast single-qubit control and a connected reference backbone, we show that a single measurable qubit suffices to learn all $O(N)$ independent parameters of a bounded-degree two-body Hamiltonian on $N$ qubits at the Heisenberg limit. Crucially, our protocol uses robust SWAP gates synthesized by quantum signal processing, enabling coherent transfer of states evolving under distant Hamiltonian parameters to the measurable qubit. This transfer requires no prior calibration of the Hamiltonian parameters of the intermediate links. A parallel learning architecture achieves total query time $\widetilde{O}(N)$ for an $N$-qubit chain, while retaining Heisenberg-limited precision scaling. On the chain, these scalings match the fundamental precision and information-propagation lower bounds up to logarithmic factors. The framework further extends to arbitrary bounded-degree interaction graphs. Our results establish a scalable route to learning an extensive number of many-body Hamiltonian parameters through only a local measurement interface.

quant-ph↗
arXiv2026

Mixed-state phases induced by power-law quantum channels

Open quantum systems can exhibit inherently mixed quantum orders, such as strong-to-weak spontaneous symmetry breaking (SW-SSB), which have no analogue in pure states. It is generally expected that a finite-depth local quantum channel cannot induce a phase transition to SW-SSB in one spatial dimension. We circumvent this obstruction by introducing a long-range quantum channel, which implements two-body dephasing on pairs of sites with probability falling off according to a power-law in the site separation. Applying this channel to a one-parameter family of matrix product states interpolating between trivial and symmetry-protected topological (SPT) phases, we construct a phase diagram that hosts trivial, mixed SPT, and SW-SSB phases with respect to Rényi-2 diagnostics. Notably, the mixed SPT phase is distinct from previously studied decohered SPT phases: it hosts two logical qubits and exhibits nonvanishing Rényi-2 string order, despite vanishing conventional string order. Through a series of mappings to a classical statistical mechanics model, we establish a direct connection between the loss of logical information and the onset of SW-SSB in this model. Finally, we consider the feasibility of experimental realization of the phenomena we have studied. We emphasize that our family of mixed states can be tuned to regimes of high purity, substantially reducing measurement overhead and enabling their experimental realization and detection on near-term quantum hardware.

quant-ph↗
arXiv2026

Deciding the Attainability of the Multiparameter Quantum Fisher Information is NP-Hard

The quantum Fisher information (QFI) sets a fundamental bound on the attainable precision when estimating multiple parameters simultaneously. Incompatibility among the individually optimal measurements can, in some cases, imply that the precision limit set by the QFI is not attainable. In certain special cases, including pure states and full-rank states, the exact conditions for when the precision limit set by the QFI can be saturated are known. However, general conditions for the attainability of the QFI with measurements on individual copies of the quantum state have long been sought. Indeed, this was recently stated as one of the five problems in quantum information theory highlighted by [P. Horodecki et al, PRX Quantum 3, 010101 (2022)]. In this work we prove that exact attainability with individual measurements is NP-hard to decide, even for a restricted set of real, constant-rank quantum models. The source problem for our proof is the NP-hard problem of deciding whether a given bipartite density matrix is separable or not. Our result shows that the longstanding difficulty in obtaining general conditions for QFI attainability reflects a fundamental computational obstruction, rather than merely a limitation of existing mathematical techniques: unless P=NP, no efficiently computable necessary-and-sufficient criterion can exist in general.

quant-ph↗
arXiv2026

A constructive violation of additivity of minimum output von Neumann entropy

We give an explicit non-random example of nonadditivity of minimum output von Neumann entropy. The proof uses a finite-dimensional construction which imitates free Haar unitary behavior. The same channel gives a violation of additivity for the minimum output Rényi-$p$ entropy for any $p\in[1,\infty]$. Additionally, given any $p_0>0$ and $\mathfrak g>0$, we extend the construction to obtain an explicit non-random channel which has entropy gap $\ge\mathfrak g$ uniformly over $p\in[p_0,\infty]$.

quant-ph↗
arXiv2026

Optimal noisy sequential multiparameter quantum sensing

The most general strategy for estimating parameters of a quantum channel is to probe the channel many times sequentially with the help of coherent ancillary systems. However, finding the strategy that minimizes the mean-squared error (MSE) is a notoriously hard problem, requiring optimization over the initial probe state, intermediate evolutions, final measurement, and classical postprocessing. In this work, we study how the minimum attainable MSE can be bounded from below in this setting. We propose a lower bound for the MSE of any physically implementable sequential sensing strategy that applies to estimating parameters of any physical quantum evolution, including quantum channels probed over multiple time steps under temporally correlated noise and general temporally correlated quantum processes. We show that this lower bound can be formulated as a semidefinite program (SDP). Our bound generalizes the Nagaoka-Hayashi lower bound (that applies to parameter estimation tasks with separable measurements) to the regime where the quantum channel can be accessed sequentially multiple times. For regular finite-dimensional single-parameter sequential estimation tasks admitting an optimal strategy, we show that our SDP bound is tight and provide a procedure to obtain a locally optimal strategy from the SDP optimizer. Using our optimization bound, we compute the MSE lower bound and derive new protocols for several other physically motivated problems including error-corrected quantum sensing under an unknown correlated noise model, multiparameter estimation, and estimation with qudit systems.

quant-ph↗
arXiv2026

Mediating gates between polar molecules using microwave-dressed Rydberg atoms

We propose a scheme for mediating many simultaneous, fast entangling gates between pairs of polar molecules using Rydberg atoms. By using microwave drives, the dipolar interactions between Rydberg atoms are nullified. Using the freedom left in the microwave dressing parameters, the Rydberg van der Waals interactions are minimized and the Rydberg-molecule interaction is tuned into resonance, allowing for the mediation of a modified iSWAP gate between molecules. In the example of mediating gates between $\rm{{}^{23}Na {}^{133}Cs}$ molecules with $\rm {}^{133}Cs$ atoms, the gate is more than two orders of magnitude faster than an equivalent direct molecule-molecule gate. We model the decay of the dressed Rydberg states and the motion of the atom and molecules and obtain a leading-order estimate of the resulting gate infidelities. Finally, we show that by detecting the state of the Rydberg atom after a gate, a subset of gate errors can be converted into erasure errors and mitigated by post-selection or quantum error-correction.

quant-ph↗
arXiv2026

Monolithic Quantum Error Correction in the Presence of Distinguishability

Quantum error-correcting codes require that the environment cannot distinguish relevant error processes acting on different codewords. In practice, residual Zeeman, Stark, or anharmonic interactions shift the underlying states, making errors distinguishable and weakening the conditions for perfect recovery. We study this effect with an analytically solvable four-level model and a canonical spontaneous-emission noise model for atoms and molecules. Distinguishability raises the effective Kraus rank of the noise channel, lowers the recovered fidelity, and sets an operational checking time that shortens as the frequency separation between the emitted photons increases. We find that rapid syndrome checking suppresses the buildup of distinguishability and quantify how fast one needs to check to restore near-perfect recovery. Error distinguishability is thus a practical limitation of monolithic error correction, and our analysis identifies fast syndrome extraction as a route to mitigating it.

quant-ph↗
arXiv2026

Error-corrected function estimation advantage in multiparameter Hamiltonians

We establish the ultimate precision limits for estimating a function of multiple Hamiltonian parameters in the presence of Markovian noise. By reducing multiparameter function estimation to an optimization over effective single-parameter embeddings, we derive tight bounds on the quantum Fisher information. We identify a necessary and sufficient functional Hamiltonian-not-in-Lindblad-span condition for Heisenberg-limited scaling in time. When this condition holds, we construct a code that simultaneously removes the noise and nuisance Hamiltonian parameters while preserving the target signal. When it fails, we derive the optimal standard quantum-limit coefficient and show that it is asymptotically attainable using approximate quantum error correction. Finally, we demonstrate that direct function estimation can substantially outperform estimating all parameters individually and subsequently evaluating the function. This advantage can scale with both the evolution time and the number of parameters.

quant-ph↗
arXiv2026

Log-depth entanglement transition in hypercube Gaussian boson sampling

We study an entanglement transition at logarithmic depth in random hypercube linear optical networks. Starting from an initial Gaussian state with all modes squeezed, we prove that random hypercube linear optical networks on $n$ modes generate ensemble-averaged subsystem entanglement within a constant factor of its maximum in all subsystems at circuit depth $Θ(\log n)$. Below depth $\log_2n$, there is an extensive subsystem with no entanglement. The entanglement generation in logarithmic depth can be compared to recent progress towards $O(\log n)$ depth average-case sampling hardness for Gaussian boson sampling in a hypercube network.

quant-ph↗
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↗