most citedMinimising the number of edges in LC-equivalent graph states

1 citations · 1 across the 10 of their papers we have counts for

collaborators
Showing quant-phShow all

9 papers · 1 filter

quant-ph2026

Optimal Fusion Strategies for Quantum Computation

Kenneth Goodenough, Andrew Landahl, Joon Lee +2

Logical fusions are important for a number of tasks in quantum information, such as quantum error correction and quantum repeaters. In the photonic setting one must contend with th…

quant-ph2026

Asymptotic entanglement in circle stabilizer states and states forbidding arbitrary vertex-minors

Kenneth Goodenough, Marcelo Sales

Stabilizer states play a central role in quantum information theory, and understanding their entanglement has motivated a large body of work. A well-studied question in particular…

quant-ph2026

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…

quant-ph2026

High-Rate and Resource-Efficient All-Photonic Quantum Repeater Architectures with 9 km Repeater Spacing

Ryosuke Shiina, Kenneth Goodenough, Nathan Arnold +1

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…

quant-ph2026

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…

quant-ph2026

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…

quant-ph2025

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…

quant-ph2025

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…

quant-ph2025★ 1 cited

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…