arXiv subjects

Emanuel Knill

Publications and source records attributed to Emanuel Knill.

At least 19 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

Quantified convergence of general homodyne measurements with applications to continuous variable quantum computing

In arXiv:2503.00188 we introduced broadband pulsed (BBP) homodyne measurements as a generalization of standard pulsed homodyne quadrature measurements. BBP can take advantage of detectors such as calorimeters that have the potential for high efficiency over a broad spectral range. BBP homodyne retains the advantages of standard pulsed homodyne, enabling measurement of arbitrary quadratures in the limit of large amplitude local oscillators (LO). Here we quantify the convergence of standard and BBP homodyne quadrature measurements to those of the quadrature of interest. We obtain lower bounds on the fidelity of the post-measurement classical-quantum state of outcomes and unmeasured modes, and the fidelity of the states obtained after applying operations conditional on measurement outcomes. The bounds depend on the LO amplitude and the moments of number operators. We demonstrate the practical relevance of these bounds by evaluating them for standard pulsed homodyne used for estimating values of the characteristic function of the Wigner distribution, expectations of moments, for quantum teleportation and for continuous variable error correction with GKP codes.

quant-ph↗

arXiv2026

An efficient method for spot-checking quantum properties with sequential trials

In practical situations, the reliability of quantum resources can be compromised due to complex generation processes or adversarial manipulations during transmission. Consequently, the trials generated sequentially in an experiment may exhibit non-independent and non-identically distributed (non-i.i.d.) behavior. This non-i.i.d. behavior can introduce security concerns and result in faulty estimates when performing information tasks such as quantum key distribution, self-testing, verifiable quantum computation, and resource allocation in quantum networks. To certify the performance of such tasks, one can make a random decision in each trial, either spot-checking some desired property or utilizing the quantum resource for the given task. However, a general method for certification with a sequence of non-i.i.d. spot-checking trials is still missing. Here, we develop such a method. This method not only works efficiently with a finite number of trials but also yields asymptotically tight certificates of performance. Our analysis shows that even as the total number of trials approaches infinity, only a constant number of trials needs to be spot-checked on average to certify the average performance of the remaining trials at a specified confidence level.

quant-ph↗

arXiv2026

Quantum Position Verification with Remote Untrusted Devices

Position information underpins many modern technologies, from navigation and timing to authentication and critical infrastructure. However, classical methods of proving that information originates from a particular position are vulnerable to spoofing. This limitation can be overcome with quantum technologies but current protocols rely on trust in quantum hardware that can be undermined, or require quantum computers and bounds on adversarial computation. Nevertheless, there has been significant interest in experimental demonstrations, and aspects of these protocols have been implemented. Here we introduce and experimentally demonstrate the Bell-test quantum position verification protocol for device-independent quantum position verification that guarantees security with only observed correlations from a loophole-free Bell test across a quantum network. We experimentally implement a version of this device-independent protocol against adversaries who, before each trial, are weakly entangled. Our demonstration achieves a one-dimensional localization 2.47(2) times smaller than the best, necessarily non-remote, classical localization protocol. Compared to classical protocols with identical latencies, the localization volume is 4.53(5) times smaller, and represents a certifiable quantum advantage. The general Bell-test protocol is loss tolerant and secure against adversaries with significant quantum resources. This work allows digital security to be anchored to physically trusted locations, enabling new position-based authentication protocols for applications such as financial transactions, legal agreements, and securing critical infrastructure.

quant-ph↗

arXiv2025

Constructing an approximate logical Markovian model of consecutive QEC cycles of a stabilizer code

As quantum error correction (QEC) experiments continue to make rapid progress, there is increased interest in designing experiments with guarantees of logical performance. At present, one difficulty is the lack of a clear connection between logical performance and the low-level error models. In this work, we take an important step toward addressing this issue by proving that consecutive QEC cycles of a stabilizer code with Pauli stochastic noise and with a single-cycle infidelity $\epsilon_1 \leq 1/64$ admit an approximate logical Markovian model, meaning that consecutive noisy QEC cycles can be modeled by a memoryless error process acting only on the logical subsystem. The approximate logical Markovian model can be computed from the low-level error model, and the deviations from the true behavior are exponentially suppressed in the number of QEC cycles. Consequently, we expect that the approximate logical Markovian model will be both a useful tool for logical characterization and an aid for designing stabilizer-code implementations with guarantees of logical performance.

quant-ph↗

arXiv2025

Measuring Multiparticle Indistinguishability with the Generalized Bunching Probability

The indistinguishability of many bosons undergoing passive linear transformations followed by number basis measurements is fully characterized by the visible state of the bosons. However, measuring all the parameters in the visible state is experimentally demanding. In this work, we seek to perform partial characterization of the visible state by measuring properties of it that are available after randomization. First we study the case where the occupied visible modes are randomly permuted, and second we study the case where Haar random linear optical unitaries are applied. In each case, we find that the generalized bunching probability -- which is the probability that all the input bosons arrive in a given subset of the output modes -- obeys monotonicity with respect to some partial order of distinguishability of the input bosons. As an intermediate result, we show that Lieb's permanental-dominance conjecture for immanants is equivalent to the following statement: for states that are invariant under permutations of the occupied visible modes, the generalized bunching probability is maximized when the bosons are perfectly indistinguishable. We also prove that a consequence of the monotonicity of the generalized bunching probability after Haar averaging is that this average is maximized when the bosons are perfectly indistinguishable. Finally, we discuss applications of our results to thermometry of cold-atom systems.

quant-ph↗

arXiv2025

Broadband pulsed quadrature measurements with calorimeters

A general one-dimensional quantum optical mode is described by a shape in the time or frequency domain. A fundamental problem is to measure a quadrature operator of such a mode. If the shape is narrow in frequency this can be done by pulsed homodyne detection, in which the mode and a matched local oscillator (LO) interfere on a beamsplitter, whose output ports are monitored by photo-detectors. The quadrature value is proportional to the difference between the photo-detectors' signals. When the shape of the mode is broad in frequency, the lack of uniform response of the detectors across the spectrum prevents direct application of this technique. We show that pulsed homodyne detection can be generalized to broadband pulsed (BBP) homodyne detection setups with detectors such as calorimeters that detect total energy instead of total number of photons. This generalization has applications in quantum measurements of femtosecond pulses, and, speculatively, measurements of Rindler modes to verify the temperature of Unruh radiation. Like pulsed homodyne detection, BBP homodyne detection requires choosing the LO pulse such that the subtracted signal approaches the desired quadrature measurement for large LO amplitudes. A distinctive feature of the technique is that the LO pulse does not belong to the mode of the quadrature being measured. We analyze how the implemented measurement approaches an ideal quadrature measurement with growing LO amplitude. We prove that the moments of the measurement converge to the moments of the quadrature and that the measurement distributions converge weakly.

quant-ph↗

arXiv2024

Traceable random numbers from a nonlocal quantum advantage

The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations-the generation processes cannot be fully traced, audited, and certified to be unpredictable. The algorithmic steps used in pseudorandom number generators are auditable, but they cannot guarantee that their outputs were a priori unpredictable given knowledge of the initial seed. Device-independent quantum random number generators can ensure that the source of randomness was unknown beforehand, but the steps used to extract the randomness are vulnerable to tampering. Here, for the first time, we demonstrate a fully traceable random number generation protocol based on device-independent techniques. Our protocol extracts randomness from unpredictable non-local quantum correlations, and uses distributed intertwined hash chains to cryptographically trace and verify the extraction process. This protocol is at the heart of a public traceable and certifiable quantum randomness beacon that we have launched. Over the first 40 days of operation, we completed the protocol 7434 out of 7454 attempts -- a success rate of 99.7%. Each time the protocol succeeded, the beacon emitted a pulse of 512 bits of traceable randomness. The bits are certified to be uniform with error times actual success probability bounded by $2^{-64}$. The generation of certifiable and traceable randomness represents one of the first public services that operates with an entanglement-derived advantage over comparable classical approaches.

quant-ph↗

arXiv2024

Multi-mode Gaussian State Analysis with one Bounded Photon Counter

Gaussian states are ubiquitous in quantum optics and information processing, and it is essential to have effective tools for their characterization. One such tool is a photon-number-resolving detector, and the simplest configuration involves counting the total number of photons in the state to be characterized. This motivates the following question: What properties of a multi-mode Gaussian state are determined by the signal from one detector that measures total number photons up to some bound? We find that if the Gaussian state occupies $S$ modes and the probabilities of $n$ photons for all $n\leq 8S$ are known, then we can determine the spectrum of the Gaussian covariance matrix and the magnitude of the displacements in each eigenspace of the covariance matrix. Nothing more can be learned, even if all photon-number probabilities are known. When the state is pure, the covariance matrix spectrum determines the squeezing parameters of the state.

quant-ph↗

arXiv2023

Optimized experiment design and analysis for fully randomized benchmarking

Randomized benchmarking (RB) is a widely used strategy to assess the quality of available quantum gates in a computational context. RB involves applying known random sequences of gates to an initial state and using the statistics of a final measurement step to determine an effective depolarizing error per step of the sequence, which is a metric of gate quality. Here we investigate the advantages of fully randomized benchmarking, where a new random sequence is drawn for each experimental trial. The advantages of full randomization include smaller confidence intervals on the inferred step error, the ability to use maximum likelihood analysis without heuristics, straightforward optimization of the sequence lengths, and the ability to model and measure behaviors that go beyond the typical assumption of time-independent error rates. We discuss models of time-dependent or non-Markovian errors that generalize the basic RB model of a single exponential decay of the success probability. For any of these models, we implement a concrete protocol to minimize the uncertainty of the estimated parameters given a fixed time constraint on the complete experiment, and we implement a maximum likelihood analysis. We consider several previously published experiments and determine the potential for improvements with optimized full randomization. We experimentally observe such improvements in Clifford randomized benchmarking experiments on a single trapped ion qubit at the National Institute of Standards and Technology (NIST). For an experiment with uniform lengths and intentionally repeated sequences the step error was $2.42^{+0.30}_{-0.22}\times 10^{-5}$, and for an optimized fully randomized experiment of the same total duration the step error was $2.57^{+0.07}_{-0.06}\times 10^{-5}$. We find a substantial decrease in the uncertainty of the step error as a result of optimized fully randomized benchmarking.

quant-ph↗

arXiv2023

Towards a resolution of the spin alignment problem

Consider minimizing the entropy of a mixture of states by choosing each state subject to constraints. If the spectrum of each state is fixed, we expect that in order to reduce the entropy of the mixture, we should make the states less distinguishable in some sense. Here, we study a class of optimization problems that are inspired by this situation and shed light on the relevant notions of distinguishability. The motivation for our study is the recently introduced spin alignment conjecture. In the original version of the underlying problem, each state in the mixture is constrained to be a freely chosen state on a subset of $n$ qubits tensored with a fixed state $Q$ on each of the qubits in the complement. According to the conjecture, the entropy of the mixture is minimized by choosing the freely chosen state in each term to be a tensor product of projectors onto a fixed maximal eigenvector of $Q$, which maximally "aligns" the terms in the mixture. We generalize this problem in several ways. First, instead of minimizing entropy, we consider maximizing arbitrary unitarily invariant convex functions such as Fan norms and Schatten norms. To formalize and generalize the conjectured required alignment, we define alignment as a preorder on tuples of self-adjoint operators that is induced by majorization. We prove the generalized conjecture for Schatten norms of integer order, for the case where the freely chosen states are constrained to be classical, and for the case where only two states contribute to the mixture and $Q$ is proportional to a projector. The last case fits into a more general situation where we give explicit conditions for maximal alignment. The spin alignment problem has a natural "dual" formulation, versions of which have further generalizations that we introduce.

quant-ph↗

arXiv2023

An atomic boson sampler

A boson sampler implements a restricted model of quantum computing. It is defined by the ability to sample from the distribution resulting from the interference of identical bosons propagating according to programmable, non-interacting dynamics. Here, we demonstrate a new combination of tools for implementing boson sampling using ultracold atoms in a two-dimensional, tunnel-coupled optical lattice. These tools include fast and programmable preparation of large ensembles of nearly identical bosonic atoms ($99.5^{+0.5}_{-1.6}\;\%$ indistinguishability) by means of rearrangement with optical tweezers and high-fidelity optical cooling, propagation for variable evolution time in the lattice with low loss ($5.0(2)\;\%$, independent of evolution time), and high fidelity detection of the atom positions after their evolution (typically $99.8(1)\;\%$). With this system, we study specific instances of boson sampling involving up to $180$ atoms distributed among $\sim 1000$ sites in the lattice. Direct verification of a given boson sampling distribution is not feasible in this regime. Instead, we introduce and perform targeted tests to determine the indistinguishability of the prepared atoms, to characterize the applied family of single particle unitaries, and to observe expected bunching features due to interference for a large range of atom numbers. When extended to interacting systems, our work demonstrates the core capabilities required to directly assemble ground and excited states in simulations of various Hubbard models.

cond-mat.quant-gas↗

arXiv2023

Quantum Probability Estimation for Randomness with Quantum Side Information

We develop a quantum version of the probability estimation framework [arXiv:1709.06159] for randomness generation with quantum side information. We show that most of the properties of probability estimation hold for quantum probability estimation (QPE). This includes asymptotic optimality at constant error and randomness expansion with logarithmic input entropy. QPE is implemented by constructing model-dependent quantum estimation factors (QEFs), which yield statistical confidence upper bounds on data-conditional normalized Rényi powers. This leads to conditional min-entropy estimates for randomness generation. The bounds are valid for relevant models of sequences of experimental trials without requiring independent and identical or stationary behavior. QEFs may be adapted to changing conditions during the sequence and trials can be stopped any time, such as when the results so far are satisfactory. QEFs can be constructed from entropy estimators to improve the bounds for conditional min-entropy of classical-quantum states from the entropy accumulation framework [Dupuis, Fawzi and Renner, arXiv:1607.01796]. QEFs are applicable to a larger class of models, including models permitting experimental devices with super-quantum but non-signaling behaviors and semi-device dependent models. The improved bounds are relevant for finite data or error bounds of the form $e^{-κs}$, where $s$ is the number of random bits produced. We give a general construction of entropy estimators based on maximum probability estimators, which exist for many configurations. For the class of $(k,2,2)$ Bell-test configurations we provide schemas for directly optimizing QEFs to overcome the limitations of entropy-estimator-based constructions. We obtain and apply QEFs for examples involving the $(2,2,2)$ Bell-test configuration to demonstrate substantial improvements in finite-data efficiency.

quant-ph↗

arXiv2022

Multi-mode Gaussian State Analysis with Total Photon Counting

The continuing improvement in the qualities of photon-number-resolving detectors opens new possibilities for measuring quantum states of light. In this work we consider the question of what properties of an arbitrary multimode Gaussian state are determined by a single photon-number-resolving detector that measures total photon number. We find an answer to this question in the ideal case where the exact photon-number probabilities are known. We show that the quantities determined by the total photon number distribution are the spectrum of the covariance matrix, the absolute displacement in each eigenspace of the covariance matrix, and nothing else. In the case of pure Gaussian states, the spectrum determines the squeezing parameters.

quant-ph↗

arXiv2022

Constraints on Gaussian Error Channels and Measurements for Quantum Communication

Joint Gaussian measurements of two quantum systems can be used for quantum communication between remote parties, as in teleportation or entanglement swapping protocols. Many types of physical error sources throughout a protocol can be modeled by independent Gaussian error channels acting prior to measurement. In this work we study joint Gaussian measurements on two modes $\mathsf{A}$ and $\mathsf{B}$ that take place after independent single-mode Gaussian error channels, for example loss with parameters $l_\mathsf{A}$ and $l_\mathsf{B}$ followed by added noise with parameters $n_\mathsf{A}$ and $n_\mathsf{B}$. We show that, for any Gaussian measurement, if $l_\mathsf{A} + l_\mathsf{B} + n_\mathsf{A} + n_\mathsf{B} \geq 1$ then the effective total measurement is separable and unsuitable for teleportation or entanglement swapping of arbitrary input states. If this inequality is not satisfied then there exists a Gaussian measurement that remains inseparable. We extend the results and determine the set of pairs of single-mode Gaussian error channels that render all Gaussian measurements separable.

quant-ph↗

arXiv2022

Coherent coupling and non-destructive measurement of trapped-ion mechanical oscillators

Precise quantum control and measurement of several harmonic oscillators, such as the modes of the electromagnetic field in a cavity or of mechanical motion, are key for their use as quantum platforms. The motional modes of trapped ions can be individually controlled and have good coherence properties. However, achieving high-fidelity two-mode operations and nondestructive measurements of the motional state has been challenging. Here we demonstrate the coherent exchange of single motional quanta between spectrally separated harmonic motional modes of a trapped-ion crystal. The timing, strength, and phase of the coupling are controlled through an oscillating electric potential with suitable spatial variation. Coupling rates that are much larger than decoherence rates enable demonstrations of high fidelity quantum state transfer and beamsplitter operations, entanglement of motional modes, and Hong-Ou-Mandel-type interference. Additionally, we use the motional coupling to enable repeated non-destructive projective measurement of a trapped-ion motional state. Our work enhances the suitability of trapped-ion motion for continuous-variable quantum computing and error correction and may provide opportunities to improve the performance of motional cooling and motion-mediated entangling interactions.

quant-ph↗

arXiv2022

Improving quantum state detection with adaptive sequential observations

For many quantum systems intended for information processing, one detects the logical state of a qubit by integrating a continuously observed quantity over time. For example, ion and atom qubits are typically measured by driving a cycling transition and counting the number of photons observed from the resulting fluorescence. Instead of recording only the total observed count in a fixed time interval, one can observe the photon arrival times and get a state detection advantage by using the temporal structure in a model such as a Hidden Markov Model. We study what further advantage may be achieved by applying pulses to adaptively transform the state during the observation. We give a three-state example where adaptively chosen transformations yield a clear advantage, and we compare performances on an ion example, where we see improvements in some regimes. We provide a software package that can be used for exploration of temporally resolved strategies with and without adaptively chosen transformations.

quant-ph↗

arXiv2021

High-fidelity indirect readout of trapped-ion hyperfine qubits

We propose and demonstrate a protocol for high-fidelity indirect readout of trapped ion hyperfine qubits, where the state of a $^9\text{Be}^+$ qubit ion is mapped to a $^{25}\text{Mg}^+$ readout ion using laser-driven Raman transitions. By partitioning the $^9\text{Be}^+$ ground state hyperfine manifold into two subspaces representing the two qubit states and choosing appropriate laser parameters, the protocol can be made robust to spontaneous photon scattering errors on the Raman transitions, enabling repetition for increased readout fidelity. We demonstrate combined readout and back-action errors for the two subspaces of $1.2^{+1.1}_{-0.6} \times 10^{-4}$ and $0^{+1.9}_{-0} \times 10^{-5}$ with 68% confidence while avoiding decoherence of spectator qubits due to stray resonant light that is inherent to direct fluorescence detection.

quant-ph↗