arXiv subjects

Ariel Shlosberg

Publications and source records attributed to Ariel Shlosberg.

11 recordsLinked to original sources

arXiv2026

Constraints on recovering quantum information after erasure

Suppose that we encode quantum information into $ n $ physical carriers. With what probabilities can we perfectly recover the quantum information after sets of carriers have been erased? This question arises in the study of quantum erasure channels, for which M.B. Hastings conjectured that if each carrier is independently erased with probability $ t \geq 1/2 $, then it is impossible to recover the quantum information with asymptotically vanishing error and probability $ > 1-t $. We prove this conjecture by establishing new no-cloning constraints on realizable recovery probabilities.

quant-ph↗

arXiv2026

Efficient simulation of noisy IQP circuits with amplitude-damping noise

Efficient classical simulation of noisy intermediate-scale quantum (NISQ) circuits has been a topic of intense study over the past few years. The majority of results on efficient simulation assume that the circuits undergo some variant of unital noise or involve sufficient randomness. However, there are limited results for circuits undergoing non-unital noise in the absence of randomness. In this work, we present a polynomial-time classical algorithm to sample from the output distributions of amplitude-damped instantaneous quantum polynomial (IQP) circuits. Our algorithm works for circuits generated by arbitrary $l$-local diagonal gates with depth $d = \Omega(\log(n))$, undergoing constant amplitude-damping noise.

quant-ph↗

arXiv2026

Robust Negativity in the Quantum-to-Classical Transition of Kerr Dynamics

We quantify the quantum-to-classical transition of the single-mode Kerr nonlinear dynamics in the presence of loss. We establish three time scales that govern the dynamics, each with distinct characteristics. For times short compared to the Ehrenfest time, the evolution is classical, characterized by Gaussian dynamics. For sufficiently long times, as we increase the initial photon number, unitary Kerr evolution would generate macroscopic superpositions of coherent states (so-called kitten states), but this is severely restricted in the presence of small photon loss so that expectation values of observables coincide with their classical values. The intermediate time scale, however, shows resilient quantum behavior in the macroscopic limit. We show that in the mean-field non-Gaussian regime, the Kerr Hamiltonian (with small photon loss) generates a significant amount of Wigner-negativity, and classical flow is recovered only if the loss rate grows with system size. Our results broaden the usual understanding of quantum-to-classical transitions and demonstrate the potential for creating robust nonclassical resources for continuous-variable quantum information processing in the presence of loss.

quant-ph↗

arXiv2025

Product testing with single-copy measurements

In this work, we study the sample complexity of two variants of product testing when restricted to single-copy measurements. In particular, we consider both bipartite product testing (i.e., does there exist at least one non-trivial cut across which the state is product) and multipartite product testing (i.e., is the state fully product across every cut). For the first variant, we prove an exponential lower bound on the sample complexity of any algorithm for this task which utilizes only single-copy measurements. When comparing this with known efficient algorithms that utilize multi-copy measurements, this establishes an exponential separation for this and several related entanglement learning tasks. For the second variant, we prove another sample lower bound that establishes a separation between single- and multi-copy strategies. To obtain our results, we prove a crucial technical lemma that gives a lower bound on the overlap between tensor products of permutation operators acting on subsystems of states that themselves carry a tensor structure. Finally, we provide an algorithm for multipartite product testing using only single-copy, local measurements, and we highlight several interesting open questions arising from this work.

quant-ph↗

arXiv2024

Uniform Additivity of Tripartite Optimized Correlation Measures

Information theory provides a framework for answering fundamental questions about the optimal performance of many important quantum communication and computational tasks. In many cases, the optimal rates of these tasks can be expressed in terms of regularized formulas that consist of linear combinations of von Neumann entropies optimized over state extensions. However, evaluation of regularized formulas is often intractable, since it involves computing a formula's value in the limit of infinitely many copies of a state. To find optimized, linear entropic functions of quantum states whose regularized versions are tractable to compute, we search for linear combinations of entropies on tripartite quantum states that are additive. We use the method of \cite{cross2017uniform}, which considers bipartite formulas, to identify convex polyhedral cones of uniformly additive \emph{tripartite} correlation measures. We rely only on strong subadditivity of the von Neumann entropy and use these cones to prove that three previously established tripartite optimized correlation measures are additive.

quant-ph↗

arXiv2024

Security Assumptions in Dispersive-Optics QKD

Quantum key distribution (QKD) seeks to provide a method of generating cryptographically-secure keys between remote parties while guaranteeing unconditional security. Implementations of high-dimensional QKD using dispersive-optics (DO-QKD) have been proposed to allow for multiple secure bits to be transmitted per photon while remaining cost-effective and scalable using existing telecommunication technology [1]. In the recent literature, there have been a number of experimental realizations of DO-QKD systems [2-6], with security analysis based on the treatment in Ref. [1]. Here we demonstrate that in the case of finite dispersion, the model assumed for the eavesdropper's attack in Ref. [1] is non-optimal for the eavesdropper, which leads to a significant overestimation of the secure key rate between parties. We consider an alternative attack model that Alice and Bob find indistinguishable from the Ref. [1] model, as long as they are restricted to making the measurements typical in DO-QKD. We provide concrete examples where a significant gap exists between the Holevo information, and therefore the secret key rate, predicted by the two models. We further analyze the experiment in Ref. [2] as an example of a case where secure key is predicted according to the Ref. [1] model, but where in fact there is zero secure key rate when considering the full set of collective attacks that an eavesdropper may perform.

quant-ph↗

arXiv2023

Opportunities and Limitations in Broadband Sensing

We consider estimating the magnitude of a monochromatic AC signal that couples to a two-level sensor. For any detection protocol, the precision achieved depends on the signal's frequency and can be quantified by the quantum Fisher information. To study limitations in broadband sensing, we introduce the integrated quantum Fisher information and derive inequality bounds that embody fundamental tradeoffs in any sensing protocol. These inequalities show that sensitivity in one frequency range must come at a cost of reduced sensitivity elsewhere. For many protocols, including those with small phase accumulation and those consisting of $π$-pulses, we find the integrated Fisher information scales linearly with $T$. We also find protocols with substantial phase accumulation can have integrated QFI that grows quadratically with $T$, which is optimal. These protocols may allow the very rapid detection of a signal with unknown frequency over a very wide bandwidth.

quant-ph↗

arXiv2023

Adaptive estimation of quantum observables

The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring a quantum system will become increasingly demanding, particularly for variational protocols that require extensive sampling. Here, we introduce a measurement scheme that adaptively modifies the estimator based on previously obtained data. Our algorithm, which we call AEQuO, continuously monitors both the estimated average and the associated error of the considered observable, and determines the next measurement step based on this information. We allow both for overlap and non-bitwise commutation relations in the subsets of Pauli operators that are simultaneously probed, thereby maximizing the amount of gathered information. AEQuO comes in two variants: a greedy bucket-filling algorithm with good performance for small problem instances, and a machine learning-based algorithm with more favorable scaling for larger instances. The measurement configuration determined by these subroutines is further post-processed in order to lower the error on the estimator. We test our protocol on chemistry Hamiltonians, for which AEQuO provides error estimates that improve on all state-of-the-art methods based on various grouping techniques or randomized measurements, thus greatly lowering the toll of measurements in current and future quantum applications.

quant-ph↗

arXiv2021

Towards Demonstrating Fault Tolerance in Small Circuits Using Bacon-Shor Codes

Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily studies of quantum memory[1, 2], an important first step towards quantum computation, where the objective is to increase the lifetime of the encoded quantum information. Additionally, several works have explored the implementation of logical gates[3-5]. In this work we study a next step - fault-tolerantly implementing quantum circuits. We choose the $[[4, 1, 2]]$ Bacon-Shor subsystem code, which has a particularly simple error-detection circuit. Through both numerics and site-counting arguments, we compute pseudo-thresholds for the Pauli error rate $p$ in a depolarizing noise model, below which the encoded circuits outperform the unencoded circuits. These pseudo-threshold values are shown to be as high as $p=3\%$ for short circuits, and $p=0.6\%$ for circuits of moderate depth. Additionally, we see that multiple rounds of stabilizer measurements give an improvement over performing a single round at the end. This provides a concrete suggestion for a small-scale fault-tolerant demonstration of a quantum algorithm that could be accessible with existing hardware.

quant-ph↗

arXiv2019

Entangled Excitons via Spontaneous Downconversion

A class of centrosymmetric molecules support excitons with a well-defined quasi-angular momentum. Cofacial arrangements of these molecules can be engineered so that quantum cutting produces a pair of excitons with angular momenta that are maximally entangled. The Bell state constituents can subsequently travel in opposite directions down molecular chains as ballistic wave packets. This is a direct excitonic analog to the entangled polarization states produced by the spontaneous parametric downconversion of light. As in optical settings, the ability to produce Bell states should enable foundational experiments and technologies based on non-local excitonic quantum correlation. The idea is elucidated with a combination of quantum electrodynamics theory and numerical simulation.

quant-ph↗

arXiv2019

Exciton Interferometry

An exciton beam splitter is designed and computationally implemented, offering the prospect of excitonic interferometry. Exciton interaction between propagation conduits is modeled using a coupling parameter that varies with position. In practice, this variation can be realized by a change in the distance separating conduits as would occur if they crossed at oblique angles. Two such excitonic beam splitters can be combined to comprise an excitonic analog to a Mach-Zehnder interferometer, allowing the relative phase shift between two signals to be used to tailor the output populations on each channel. In contrast to optical splitters, an excitonic signal can be coherently split among more than two channels. These ideas are computationally demonstrated within an idealized setting in which each site is idealized as a two-level system. Physical implementations include molecular and coupled cavity settings as well as combinations of these. This adds to the developing inventory of excitonic analogs to optical elements.

quant-ph↗