Publications (32)
Distributing graph states with a photon-weaving quantum server
Daniel Bhatti, Kenneth Goodenough
One of the key aims of quantum networks is the efficient distribution of multipartite entangled states among end users. While various architectures have been proposed, each comes w…
Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning
Jan Li, Tim Coopmans, Patrick Emonts +3
Quantum repeaters play a crucial role in the effective distribution of entanglement over long distances. The nearest-future type of quantum repeater requires two operations: entang…
Constant Overhead Entanglement Distillation via Scrambling
Andi Gu, Lorenzo Leone, Kenneth Goodenough +1
High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but long-distance entanglement distri…
Efficient Multiparty Quantum Key Distribution over Quantum Networks
Samuel Oslovich, Bing Wang, Walter Krawec +1
Multiparty quantum key distribution (QKD) is useful for many applications that involve secure communication or collaboration among multiple parties. While it can be achieved using…
Near-term quantum-repeater experiments with nitrogen-vacancy centers: Overcoming the limitations of direct transmission
Filip RozpÄdek, Raja Yehia, Kenneth Goodenough +5
Quantum channels enable the implementation of communication tasks inaccessible to their classical counterparts. The most famous example is the distribution of secret key. However,…
Sector length distributions of recursively definable graph states through analytic combinatorics
Eloïc Vallée, Kenneth Goodenough, Paul E. Gunnells +2
The sector length distribution or Shor-Laflamme distribution (SLD) of quantum states is governed by the -body correlations amongst the different systems, and has been used to st…
High-Rate and Resource-Efficient All-Photonic Quantum Repeater Architectures with 9 km Repeater Spacing
Ryosuke Shiina, Kenneth Goodenough, Nathan Arnold +2
Quantum communication between two distant parties will serve as a cornerstone of the future quantum internet. However, generating enough entangled Bell pairs over long distances is…
Bipartite entanglement of noisy stabilizer states through the lens of stabilizer codes
Kenneth Goodenough, Aqil Sajjad, Eneet Kaur +2
Stabilizer states are a prime resource for a number of applications in quantum information science, such as secret-sharing and measurement-based quantum computation. This motivates…
Protocols for creating and distilling multipartite GHZ states with Bell pairs
Sébastian de Bone, Runsheng Ouyang, Kenneth Goodenough +1
The distribution of high-quality Greenberger-Horne-Zeilinger (GHZ) states is at the heart of many quantum communication tasks, ranging from extending the baseline of telescopes to…
Routing in Non-Isotonic Quantum Networks
Maxwell Tang, Garrett Hinkley, Kenneth Goodenough +2
Optimal routing in quantum-repeater networks requires finding the best path that connects a pair of end nodes. Most previous work on routing in quantum networks assumes utility fun…
Generalized Quantum Repeater Graph States
Bikun Li, Kenneth Goodenough, Filip RozpÄdek +1
All-photonic quantum repeaters are essential for establishing long-range quantum entanglement. Within repeater nodes, reliably performing entanglement swapping is a key component o…
Black-white polynomials of graphs and generating functions
Kenneth Goodenough, Paul E. Gunnells
Let G be a graph. The black-white polynomial W_G(t) enumerates colorings of the vertices of G with two colors (black and white), where the power of t keeps track of how many white…
Minimising the number of edges in LC-equivalent graph states
Hemant Sharma, Kenneth Goodenough, Johannes Borregaard +2
Graph states are a powerful class of entangled states with numerous applications in quantum communication and quantum computation. Local Clifford (LC) operations that map one graph…
Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations
Aniruddha Sen, Kenneth Goodenough, Don Towsley
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, oft…
Converse bounds for quantum and private communication over Holevo-Werner channels
Thomas P. W. Cope, Kenneth Goodenough, Stefano Pirandola
Werner states have a host of interesting properties, which often serve to illuminate the unusual properties of quantum information. Starting from these states, one may define a fam…
Near-term to distillation protocols using graph codes
Kenneth Goodenough, Sébastian de Bone, Vaishnavi L. Addala +4
Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increase…
Assessing the performance of quantum repeaters for all phase-insensitive Gaussian bosonic channels
Kenneth Goodenough, David Elkouss, Stephanie Wehner
One of the most sought-after goals in experimental quantum communication is the implementation of a quantum repeater. The performance of quantum repeaters can be assessed by compar…
Complete Hierarchies for the Geometric Measure of Entanglement
Lisa T. Weinbrenner, Albert Rico, Kenneth Goodenough +2
In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between produ…
Piecemaker: a resource-efficient entanglement distribution protocol
Luise Prielinger, Kenneth Goodenough, Guus Avis +3
We introduce multipartite entanglement distribution protocols that use a quantum switch to deliver stabilizer states to a number of remote end users. As in existing schemes, the fi…
On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations
Kenneth Goodenough, Tim Coopmans, Don Towsley
Losses are one of the main bottlenecks for the distribution of entanglement in quantum networks, which can be overcome by the implementation of quantum repeaters. The most basic fo…
Exact noise characterization of entanglement distribution in star networks
Kenneth Goodenough, Xiaonan Chen, Patrick Emonts
Multipartite entanglement forms the core of many networking applications. In the near-term future, it is expected that multipartite distribution will be achieved first through star…
Optimising repeater schemes for the quantum internet
Kenneth Goodenough, David Elkouss, Stephanie Wehner
The rate at which quantum communication tasks can be performed using direct transmission is fundamentally hindered by the channel loss. Quantum repeaters allow, in principle, to ov…
Bayesian Optimization for Repeater Protocols
Lorenzo La Corte, Kenneth Goodenough, Ananda G. Maity +2
Efficiently distributing secret keys over long distances remains a critical challenge in the development of quantum networks. "First-generation" quantum repeater chains distribute…
Contextuality without nonlocality in a superconducting quantum system
Markus Jerger, Yarema Reshitnyk, Markus Oppliger +8
Classical realism demands that system properties exist independently of whether they are measured, while noncontextuality demands that the results of measurements do not depend on…
Parameter regimes for a single sequential quantum repeater
Filip RozpÄdek, Kenneth Goodenough, Jérémy Ribeiro +6
Quantum key distribution allows for the generation of a secret key between distant parties connected by a quantum channel such as optical fibre or free space. Unfortunately, the ra…
Lower bounds on bipartite entanglement in noisy graph states
Aqil Sajjad, Eneet Kaur, Kenneth Goodenough +2
Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is…
Quantum Graph States: Bridging Classical Theory and Quantum Innovation, Workshop Summary
Eric Chitambar, Kenneth Goodenough, Otfried Gühne +5
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states a…
Efficient Graph State Purification with Factorized Graph-Preserving Operations across Local Clifford Orbits
Mingyuan Wang, Guus Avis, Kenneth Goodenough +1
Graph states form a broad class of multipartite entangled states underlying measurement-based quantum computation, quantum networks, and stabilizer codes. However, systematic entan…
Entanglement Distribution Delay Optimization in Quantum Networks with Distillation
Mahdi Chehimi, Kenneth Goodenough, Walid Saad +2
Quantum networks (QNs) distribute entangled states to enable distributed quantum computing and sensing applications. However, in such QNs, quantum switches (QSs) have limited resou…
Enhancing Quantum Key Distribution with Entanglement Distillation and Classical Advantage Distillation
Shin Sun, Kenneth Goodenough, Daniel Bhatti +1
Realizing secure communication between distant parties is one of quantum technology's main goals. Although quantum key distribution promises information-theoretic security for shar…
Enumerating all bilocal Clifford distillation protocols through symmetry reduction
Sarah Jansen, Kenneth Goodenough, Sébastian de Bone +2
Entanglement distillation is an essential building block in quantum communication protocols. Here, we study the class of near-term implementable distillation protocols that use bil…
Comparing One- and Two-way Quantum Repeater Architectures
Prateek Mantri, Kenneth Goodenough, Don Towsley
Quantum repeaters are an essential building block for realizing long-distance quantum communications. However, due to the fragile nature of quantum information, these repeaters suf…