arXiv subjects

Valery Shchesnovich

Publications and source records attributed to Valery Shchesnovich.

16 recordsLinked to original sources

arXiv2026

Indistinguishability Theory for Identical Particles with Invariant Degrees of Freedom

Identical particles have dynamically invariant labels in all setups where their degrees of freedom can be partitioned into two parts, which we call internal and visible, with the visible part subject to unitary evolution, while the dynamically invariant internal part accounts for the partial distinguishability of particles. We give the explicit form of the visible state in terms of the indistinguishability function, generalizing the standard symmetrization/antisymmetrization postulate for bosons/fermions with internal modes. The indistinguishability function on the symmetric group accounts for the permutation symmetry of the dynamically invariant label state and gives a self-contained description of the symmetry spectrum of the visible state. It is shown that the indistinguishability of single particles emitted independently from a stable source is completely characterized by the projective measures on the symmetry spectrum. We reveal a hierarchy of successive upper bounds on the projective measure of indistinguishability in terms of marginal projective measures. We point out an experimentally feasible way to get the upper bounds on the indistinguishability of an arbitrarily large number of single photons by direct experimental readout of their marginal projective measures. We also analyze the indistinguishability of coherent superpositions and convex mixtures and resolve a recently posed problem.

quant-ph↗

arXiv2026

Intrinsic Indistinguishability of Identical Particles and How Particle Labels Affect It

We investigate indistinguishability of identical bosons and fermions undergoing arbitrary particle-number-preserving evolutions of their visible degrees of freedom. For the projective indistinguishability measure, defined by the projection of the visible state onto the symmetric/anti-symmetric subspace, we derive an equivalent expression in terms of the dynamically invariant internal state. We further generalize the textbook symmetrization/anti-symmetrization framework for bosons and fermions to arbitrary partial distinguishability by deriving an explicit reconstruction formula for the multiparticle visible state in terms of the indistinguishability function encoding the dynamical invariants. We give complete characterization of the class-functions of indistinguishability by projective measures on generalized symmetries. Finally, we reveal a strikingly counterintuitive effect: introducing additional particle label states can increase the multiparticle indistinguishability of identical particles. The effect originates from the cancellation of collective multiparticle phases.

quant-ph↗

arXiv2026

Exact State Evolution and Energy Spectrum in Solvable Bosonic Models

Solvable bosonic models provide a fundamental framework for describing light propagation in nonlinear media, including optical down-conversion processes that generate squeezed states of light and their higher-order generalizations. In quantum optics a central objective is to determine the time evolution of a given initial state. Exact analytic solution to the state-evolution problem is presented, applicable to a broad class of solvable bosonic models and arbitrary initial states. Moreover, the characteristic equation governing the energy spectrum is derived and the eigenstates are found in the form of continued fractions and as the principal minors of the associated Jacobi matrix. The results provide a solid analytical framework for discussion of exactly solvable bosonic models.

quant-ph↗

arXiv2026

A generating-function approach to the interference of squeezed states with partial distinguishability

Photon distinguishability is a fundamental property manifested in multiphoton interference and one of the main sources of noise in any photonic quantum information processing. In this work, rather than relying on first-quantization methods, we build on a generating-function framework based on the phase-space formalism to characterize the effects of partial distinguishability on the interference of single-mode squeezed states. Our approach goes beyond commonly used models that represent distinguishability via additional noninterfering modes and captures genuine multiphoton interference effects induced by the overlap of the internal state of the photons. This description provides a clear physical account of how distinguishability gives rise to effective noise in Gaussian boson sampling protocols while enabling a systematic investigation of phase effects arising from the overlap of the internal states.

quant-ph↗

arXiv2025

Exact solution for a class of quantum models of interacting bosons

Quantum models of interacting bosons have a wide range of applications, including the propagation of optical modes in nonlinear media, such as the $k$-photon down-conversion. Many of these models are related to nonlinear deformations of finite group algebras and, in this sense, are exactly solvable. While advanced group-theoretic methods were developed to study the eigenvalue spectrum, in quantum optics, the primary focus is not on the spectrum of the Hamiltonian but rather on the evolution of an initial state -- such as the generation of optical signal modes by a strong pump mode propagating through a nonlinear medium. I propose a simple and general method to solve the state evolution problem, applicable to a broad class of quantum models of interacting bosons. For the k-photon down-conversion model and its generalizations, the solution to the state evolution problem is expressed as an infinite series expansion in powers of the propagation time, with coefficients determined by a recursion relation involving only a single polynomial function. This polynomial function is unique to each nonlinear model. As an application, I compare the exact solution of the parametric down-conversion process with the semiclassical parametric approximation.

quant-ph↗

arXiv2023

Classical sampling from noisy Boson Sampling and the negative probabilities

It is known that, by accounting for the multiboson interferences up to a finite order, the output distribution of noisy Boson Sampling, with distinguishability of bosons serving as noise, can be approximately sampled from in a time polynomial in the total number of bosons. The drawback of this approach is that the joint probabilities of completely distinguishable bosons, i.e., those that do not interfere at all, have to be computed also. In trying to restore the ability to sample from the distinguishable bosons with computation of only the single-boson probabilities, one faces the following issue: the quantum probability factors in a convex-sum expression, if truncated to a finite order of multiboson interference, have, on average, a finite amount of negativity in a random interferometer. The truncated distribution does become a proper one, while allowing for sampling from it in a polynomial time, only in a vanishing domain close to the completely distinguishable bosons. Nevertheless, the conclusion that the negativity issue is inherent to all efficient classical approximations to noisy Boson Sampling may be premature. I outline the direction for a whole new program, which seem to point to a solution. However its success depends on the asymptotic behavior of the symmetric group characters, which is not known.

quant-ph↗

arXiv2023

Families of bosonic suppression laws beyond the permutation symmetry principle

Exact cancellation of quantum amplitudes in multiphoton interferences with Fock states at input, the so-called suppression or zero transmission laws generalizing the Hong-Ou-Mandel dip, are useful tool in quantum information and computation. It was recently suggested that all bosonic suppression laws follow from a common permutation symmetry in the input quantum state and the unitary matrix of interferometer. By using the recurrence relations for interference of Fock states, we find a wealth of suppression laws on the beamsplitter and tritter which are not explained by the permutation symmetry principle. Our results reveal that in interference with Fock states on unitary multiports there are whole families of suppression laws for arbitrary total number of bosons even on asymmetric unitary multiports, beyond the previously formulated permutation symmetry principle.

quant-ph↗

arXiv2022

Distinguishability in quantum interference with the squeezed states

Distinguishability theory is developed for quantum interference of the squeezed vacuum states on unitary linear interferometers. It is found that the entanglement of photon pairs over the Schmidt modes is one of the sources of distinguishability. The distinguishability is quantified by the symmetric part of the internal state of $n$ pairs of photons, whose normalization $q_{2n}$ is the probability that $2n$ photons interfere as indistinguishable. For two pairs of photons $q_{4}=(1+ 2\mathbb{P} )/3$, where $\mathbb{P} $ is the purity of the squeezed states ($K=1/\mathbb{P} $ is the Schmidt number). For a fixed purity $\mathbb{P}$, the probability $q_{2n}$ decreases exponentially fast in $n$. For example, in the experimental Gaussian boson sampling of H.-S.~Zhong \textit{et al} [Science \textbf{370}, 1460 (2020)], the achieved purity $\mathbb{P}\approx 0.938$ for the average number of photons $2n\ge 43$ gives $q_{2n}\lesssim 0.5$, i.e., close to the middle line between $n$ indistinguishable and $n$ distinguishable pairs of photons. In derivation of all the results the first-order quantization representation based on the particle decomposition of the Hilbert space of identical bosons serves as an indispensable tool. The approach can be applied also to the generalized (non-Gaussian) squeezed states, such as those recently generated in the three-photon parametric down-conversion.

quant-ph↗

arXiv2022

Boson sampling cannot be faithfully simulated by only the lower-order multi-boson interferences

To simulate noisy boson sampling approximating it by only the lower-order multi-boson interferences (e.g., by a smaller number of interfering bosons and classical particles) is very popular idea. I show that the output data from any such classical simulations can be efficiently distinguished from that of the quantum device they try to simulate, even with finite noise in the latter. The distinguishing datasets can be the experimental estimates of some large probabilities, a wide class of such is presented. This is a sequel of \textit{Quantum} \textbf{5}, 423 (2021), where I present more accessible account of the main result enhanced by additional insight on the contribution from the higher-order multi-boson interferences in presence of noise.

quant-ph↗

arXiv2022

Distinguishing noisy boson sampling from classical simulations

Giving a convincing experimental evidence of the quantum supremacy over classical simulations is a challenging goal. Noise is considered to be the main problem in such a demonstration, hence it is urgent to understand the effect of noise. Recently found classical algorithms can efficiently approximate, to any small error, the output of boson sampling with finite-amplitude noise. In this work it is shown analytically and confirmed by numerical simulations that one can efficiently distinguish the output distribution of such a noisy boson sampling from the approximations accounting for low-order quantum multiboson interferences, what includes the mentioned classical algorithms. The number of samples required to tell apart the quantum and classical output distributions is strongly affected by the previously unexplored parameter: density of bosons, i.e., the ratio of total number of interfering bosons to number of input ports of interferometer. Such critical dependence is strikingly reminiscent of the quantum-to-classical transition in systems of identical particles, which sets in when the system size scales up while density of particles vanishes.

quant-ph↗

arXiv2021

On the classical complexity of sampling from quantum interference of indistinguishable bosons

Experimental demonstration of the quantum advantage over classical simulations with Boson Sampling is currently under intensive investigation. There seems to be a scalability issue to the necessary number of bosons on the linear optical platforms and the experiments, such as the recent Boson Sampling with $20$ photons on $60$-port interferometer by H.~Wang~\textit{et al}, \textit{Phys. Rev. Lett.} \textbf{123,} 250503 (2019), are usually carried out on a small interferometer, much smaller than the size necessary for the no-collision regime. Before demonstration of quantum advantage, it is urgent to estimate exactly how the classical computations necessary for sampling from the output distribution of Boson Sampling are reduced when a smaller-size interferometer is used. The present work supplies such a result, valid with arbitrarily close to $1$ probability, which reduces in the no-collision regime to the previous estimate by P.~Clifford and R.~Clifford. One of the results with immediate application to current experiments with Boson Sampling is that classically sampling from the interference of $N$ single bosons on an $M$-port interferometer is at least as hard as that with $\mathcal{N}= \frac{N}{1+N/M}$ single bosons in the no-collision regime, i.e., on a much larger interferometer with at least $\mathcal{M}\gg N^2$ ports.

quant-ph↗

arXiv2019

Simulating boson sampling in lossy architectures

Photon losses are among the strongest imperfections affecting multi-photon interference. Despite their importance, little is known about their effect on boson sampling experiments. In this work we show that using classical computers, one can efficiently simulate multi-photon interference in all architectures that suffer from an exponential decay of the transmission with the depth of the circuit, such as integrated photonic circuits or optical fibers. We prove that either the depth of the circuit is large enough that it can be simulated by thermal noise with an algorithm running in polynomial time, or it is shallow enough that a tensor network simulation runs in quasi-polynomial time. This result suggests that in order to implement a quantum advantage experiment with single-photons and linear optics new experimental platforms may be needed.

quant-ph↗

arXiv2019

Noise in BosonSampling and the threshold of efficient classical simulatability

We study the quantum to classical transition in Boson Sampling by analysing how $N$-boson interference is affected by inevitable noise in an experimental setup. We adopt the Gaussian noise model of Kalai and Kindler for Boson Sampling and show that it appears from some realistic experimental imperfections. We reveal a connection between noise in Boson Sampling and partial distinguishability of bosons, which allows us to prove efficient classical simulatability of noisy no-collision Boson Sampling with finite noise amplitude $ε$, i.e., $ε= Ω(1)$ as $N\to \infty$. On the other hand, using an equivalent representation of network noise as losses of bosons compensated by random (dark) counts of detectors, it is proven that for noise amplitude inversely proportional to total number of bosons, i.e., $ε=O(1/N)$, noisy no-collision Boson Sampling is as hard to simulate classically as in the noiseless case. Moreover, the ratio of ``noise clicks" (lost bosons compensated by dark counts) to the total number of bosons $N$ vanishes as $N\to \infty$ for arbitrarily small noise amplitude, i.e., $ε= o(1)$ as $N\to \infty$, hence, we conjecture that such a noisy Boson Sampling is also hard to simulate classically. The results significantly relax sufficient condition on noise in a network components, such as two-mode beam splitters, for classical hardness of experimental Boson Sampling.

quant-ph↗

arXiv2019

Classical simulability of noisy boson sampling

Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For such a demonstration to be meaningful, experimental noise must not affect the computational power of the device; this occurs when a classical algorithm can use the noise to simulate the quantum system. In this work, we demonstrate an algorithm which simulates boson sampling, a quantum advantage demonstration based on many-body quantum interference of indistinguishable bosons, in the presence of optical loss. Finding the level of noise where this approximation becomes efficient lets us map out the maximum level of imperfections at which it is still possible to demonstrate a quantum advantage. We show that current photonic technology falls short of this benchmark. These results call into question the suitability of boson sampling as a quantum advantage demonstration.

quant-ph↗

arXiv2017

Partial distinguishability and photon counting probabilities in linear multiport devices

Probabilities of photon counts at the output of a multiport optical device are generalised for optical sources of arbitrary quantum states in partially distinguishable optical modes. For the single-mode photon sources, the generating function for the probabilities is a linear combination of the matrix permanents of positive semi-definite Hermitian matrices, where each Hermitian matrix is a Hadamard product of a submatrix of the multiport matrix and a Hermitian matrix describing partial distinguishability. For the multi-mode sources the generating function is given by an integral of the Husimi functions of the sources. When each photon source outputs exactly a Fock state, the obtained expression reduces to the probability formula derived for partially distinguishable photons, \textit{Physical Review A \textbf{91}, 013844 (2015)}. The derived probability formula can be useful in analysing experiments with partially distinguishable sources and error bounds of experimental Boson Sampling devices.

quant-ph↗

arXiv2014

Sufficient bound on the mode mismatch of single photons for scalability of the boson sampling computer

The boson sampler proposed by Aaronson and Arkhipov is a non-universal quantum computer, which can serve as evidence against the extended Church-Turing thesis. It samples the probability distribution at the output of linear unitary optical network, with indistinguishable single photons at the input. Four experimental groups have already tested their small-scale prototypes with up to four photons. The boson sampler with few dozens of single photons is believed to be hard to simulate on a classical computer. For scalability of a realistic boson sampler with current technology it is necessary to know the effect of the photon mode mismatch on its operation. Here a nondeterministic model of the boson sampler is analyzed, which employs partially indistinguishable single photons emitted by identical sources. A sufficient condition on the average mutual fidelity $ \langle \mathcal{F}\rangle$ of the single photons is found, which guarantees that the realistic boson sampler outperforms the classical computer. Moreover, the boson sampler computer with partially indistinguishable single photons is scalable while being beyond the power of classical computers when the single photon mode mismatch $1-\langle \mathcal{F}\rangle$ scales as $ \mathcal{O}(N^{-3/2})$ with the total number of photons $N$.

quant-ph↗