8 papers
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…
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…
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…
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…
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…
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…