22 citations · 39 across the 11 of their papers we have counts for
12 papers
Dealing with low-weight errors that lead BP OSD to fail
Giacomo Fregona, Matthias C. Löbl, Benjamin J. Brown +2
Belief Propagation combined with Ordered Statistics Decoding (BP OSD) is an open-source decoding tool used widely within the community due to its versatility and ease of applicatio…
A Platform-aware Compilation Framework for Fault-tolerant Quantum Computation
Srushti Patil, Susan X. Chen, Andreas Juul Bay-Smidt +4
The compilation of an algorithm can vary significantly with the choice of physical hardware platform and error correction model. Yet, current compilation frameworks typically commi…
Purification of photonic graph states
Matthias C. Löbl, Aliki A. Capatos, Ming Lai Chan +3
Graph states constitute the main building block for quantum computing with photons. Quantum emitters with a hosted spin can deterministically generate photonic graph states, strong…
Photon Sorting with a Quantum Emitter
Kasper H. Nielsen, Etienne Corminboeuf, Benedikt Tissot +8
High-quality photonic Bell state measurements (BSMs) enable scalable universal quantum computing and long distance quantum communication. However, when implemented with linear opti…
Fusion-based implementation of qLDPC codes with quantum emitters
Susan X. Chen, Matthias C. Löbl, Ming Lai Chan +2
Quantum low-density parity check (qLDPC) codes offer higher encoding rate than topological codes, e.g. surface codes, making them favourable for practical, fault-tolerant quantum c…
Generating graph states with a single quantum emitter and the minimum number of fusions
Matthias C. Löbl, Love A. Pettersson, Andrew Jena +3
Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-st…
Tailoring fusion-based photonic quantum computing schemes to quantum emitters
Ming Lai Chan, Thomas J. Bell, Love A. Pettersson +4
Fusion-based quantum computation is a promising quantum computing model where small-sized photonic resource states are simultaneously entangled and measured by fusion gates. Such o…
Breadth-first graph traversal union-find decoder
Matthias C. Löbl, Susan X. Chen, Stefano Paesani +1
Fast decoding algorithms are decisive for real-time quantum error correction and for analyzing properties of error correction codes. Here, we develop variants of the union-find dec…
Deterministic generation of concatenated graph codes from quantum emitters
Love A. Pettersson, Anders S. Sørensen, Stefano Paesani
Photon loss is the dominant noise mechanism in photonic quantum technologies. Designing fault-tolerant schemes with high tolerance to loss is thus a central challenge in scaling ph…
Transforming graph states via Bell state measurements
Matthias C. Löbl, Love A. Pettersson, Stefano Paesani +1
Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, mea…
Efficient percolation simulations for lossy photonic fusion networks
Matthias C. Löbl, Stefano Paesani, Anders S. Sørensen
The study of percolation phenomena has various applications ranging from social networks or materials science to quantum information. The most common percolation models are bond- o…
Optimising graph codes for measurement-based loss tolerance
Tom J. Bell, Love A. Pettersson, Stefano Paesani
Graph codes play an important role in photonic quantum technologies as they provide significant protection against qubit loss, a dominant noise mechanism. Here, we develop methods…