BDBrian Doolittle

Brian Doolittle

*This is an algorithmically generated author record based on publicly available information.

Brian Doolittle has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Realistic Quantum Network Simulation for Experimental BBM92 Key Distribution

    by Michelle Chalupnik, Brian Doolittle, Suparna Seshadri, Eric G. Brown, Keith Kenemer, Daniel Winton, Daniel Sanchez-Rosales, Matthew Skrzypczyk, Cara Alexander, Eric Ostby, et al.

    Quantum key distribution (QKD) can provide secure key material between two parties without relying on assumptions about the computational power of an eavesdropper. QKD is performed over quantum links and quantum networks, systems which are resource-intensive to deploy and maintain. To evaluate and optimize performance prior to, during, and after deployment, accurate simulations with attention to physical realism are necessary. Quantum network simulators can simulate a variety of quantum and classical protocols and can assist in quantum network design and optimization by offering realism and flexibility beyond mathematical models which rely on simplifying assumptions and can be intractable to solve as network complexity increases. We use a versatile discrete event quantum network simulator to simulate the entanglement-based QKD protocol BBM92 and compare it to our experimental implementation and to existing theory. We find the discrete event quantum network simulator can match experimental key rates and error rates with a lower mean squared error than analytical theory. Furthermore, we simulate secure key rates in a repeater key distribution scenario for which no experimental implementations exist and find agreement between simulation and analytical theory. Hence, we demonstrate discrete event simulators can meet needs in quantum network simulations which cannot be filled solely by experiment or theory: discrete event simulators can accurately simulate QKD protocols and match experiments in regimes where theoretical models may require more simplifying assumptions, and they can match theoretical models in the opposite scenario where experiments have not yet been performed but theoretical models exist.


  • Open Access

    Inferring Quantum Network Topology Using Local Measurements

    by Daniel T. Chen, Brian Doolittle, Jeffrey Larson, Zain H. Saleem, Eric Chitambar

    Statistical correlations that can be generated across the nodes in a quantum network depend crucially on its topology. However, this topological information might not be known a priori, or it may need to be verified. In this paper, we propose an efficient protocol for distinguishing and inferring the topology of a quantum network. We leverage entropic quantities—namely, the von Neumann entropy and the measured mutual information—as well as measurement covariance to uniquely characterize the topology. We show that the entropic quantities are sufficient to distinguish two networks that prepare GHZ states. Moreover, if qubit measurements are available, both entropic quantities and covariance can be used to infer the network topology without state-preparation assumptions. We show that the protocol can be entirely robust to noise and can be implemented via quantum variational optimization. Numerical experiments on both classical simulators and quantum hardware show that covariance is generally more reliable for accurately and efficiently inferring the topology, whereas entropy-based methods are often better at identifying the absence of entanglement in the low-shot regime.


  • Maximal qubit violations of n -locality in star and chain networks

    by Brian Doolittle, Eric Chitambar

    The nonlocal correlations of noisy quantum systems are important for both understanding nature and developing quantum technology. We consider the correlations of star and chain quantum networks in which noisy entanglement sources are measured by nonsignaling parties. We derive the necessary and sufficient conditions for when a broad family of star and chain n-locality inequalities achieve their maximal quantum violation assuming that each party's dichotomic observables are separable across qudit systems. When pairs of local dichotomic observables are considered on qubit systems, we derive maximal n-local violations that are larger and more robust to noise than the maximal n-locality violations reported previously. To obtain these larger values, we consider observables that we have not found in previous studies. Thus, we gain insights into self-testing entanglement sources and measurements in star and chain networks.


  • Open Access

    Variational Quantum Optimization of Nonlocality in Noisy Quantum Networks

    by Brian Doolittle, R. Thomas Bromley, Nathan Killoran, Eric Chitambar, Tom Bromley

    The noise and complexity inherent to quantum communication networks leads to technical challenges in designing quantum network protocols using classical methods. We address this issue with a hybrid variational quantum optimization framework (VQO) that simulates quantum networks on quantum hardware and optimizes the simulation using differential programming. We maximize nonlocality in noisy quantum networks to showcase our VQO framework. Using a classical simulator we investigate the noise robustness of quantum nonlocality. Our VQO methods reproduce known results and uncover novel phenomena. We find that maximally entangled states maximize nonlocality in the presence of unital qubit channels, while nonmaximally entangled states can maximize nonlocality in the presence of nonunital qubit channels. Thus, we show VQO to be a practical design tool for quantum networks even when run on a classical simulator. Finally, using IBM quantum computers we demonstrate that our VQO framework can maximize nonlocality on noisy quantum hardware. In the long-term, our VQO techniques show promise of scaling beyond classical approaches and can be deployed on quantum network hardware to optimize network protocols against their inherent noise.


  • Open Access

    The Communication Value of a Quantum Channel

    by Eric Chitambar, Ian George, Brian Doolittle, Marius Junge

    There are various ways to quantify the communication capabilities of a quantum channel. In this work we introduce the communication value (cv) of quantum channel, which describes the optimal probability of guessing the channel input from its output. By connecting to prior work on zero-error channel simulation, we show that the cv and its entanglement-assisted variant also offer dual interpretations as the classical communication cost for perfectly simulating different aspects of a channel using non-signaling resources. Our study involves characterizing the communication value as a generalized conditional min-entropy over the cone of separable operators. Using this characterization, we evaluate the cv for all qubit channels and higher-dimensional channels with certain symmetries. We find that the any entanglement-breaking channel has multiplicative cv when used in parallel with any other channel; the same is shown to hold for Pauli channels and partially depolarizing channels. In contrast, the cv is found to be non-multiplicative for a subset of the well-known Werner-Holevo channels. A final component of this work investigates relaxations of the channel cv to other cones such as the set of operators having a positive partial transpose (PPT).


  • Open Access

    The Communication Value of a Quantum Channel

    by Eric Chitambar, Ian George, Brian Doolittle, Marius Junge

    There are various ways to quantify the communication capabilities of a quantum channel. In this work we study the communication value (cv) of channel, which describes the optimal success probability of transmitting a randomly selected classical message over the channel. The cv also offers a dual interpretation as the classical communication cost for zero-error channel simulation using non-signaling resources. We first provide an entropic characterization of the cv as a generalized conditional min-entropy over the cone of separable operators. We evaluate the cv exactly for all qubit channels and the Werner-Holevo family of channels. The latter is shown to have non-multiplicative cv when d > 2. On the other hand, we prove that any pair of qubit channels have multiplicative cv when used in parallel. Even stronger, all entanglement-breaking channels and the partially depolarizing channel are shown to have multiplicative cv when used in parallel with any channel. We then turn to the entanglement-assisted cv and prove that it is equivalent to the conditional min-entropy of the Choi matrix of the channel. Combining with previous work on zero-error channel simulation, this implies that the entanglement-assisted cv is the classical communication cost for perfectly simulating a channel using quantum non-signaling resources. A final component of this work investigates relaxations of the channel cv to other cones such as the set of operators having a positive partial transpose (PPT).


  • Open Access

    Variational Quantum Optimization of Nonlocality in Noisy Quantum Networks

    by Brian Doolittle, Tom Bromley, Nathan Killoran, Eric Chitambar

    The inherent noise and complexity of quantum communication networks leads to challenges in designing quantum network protocols using classical methods. To address this issue, we develop a variational quantum optimization framework that simulates quantum networks on quantum hardware and optimizes the network using differential programming techniques. We use our hybrid framework to optimize nonlocality in noisy quantum networks. On the noisy IBM quantum computers, we demonstrate our framework's ability to maximize quantum nonlocality. On a classical simulator with a static noise model, we investigate the noise robustness of quantum nonlocality with respect to unital and nonunital channels. In both cases, we find that our optimization methods can reproduce known results, while uncovering interesting phenomena. When unital noise is present we find numerical evidence suggesting that maximally entangled state preparations yield maximal nonlocality. When nonunital noise is present we find that nonmaximally entangled states can yield maximal nonlocality. Thus, we show that variational quantum optimization is a practical design tool for quantum networks in the near-term. In the long-term, our variational quantum optimization techniques show promise of scaling beyond classical approaches and can be deployed on quantum network hardware to optimize quantum communication protocols against their inherent noise.

  • Open Access

    Certifying the classical simulation cost of a quantum channel

    by Brian Doolittle, Eric Chitambar

    A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to determine when a noisy classical channel can be simulated using an amount of communication strictly less than either its input or its output alphabet size. In addition, a family of eight signaling dimension witnesses is presented that completely characterize when any four-outcome measurement channel, such as a Bell measurement, can be simulated using one communication bit and shared randomness. Finally, we bound the signaling dimension for all partial replacer channels in d dimensions. The bounds are found to be tight for the special case of the erasure channel.