Mats Granath

Senior lecturer

University of Gothenburg
Country flagSweden

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

About

Mats Granath is a Senior Lecturer at the University of Gothenburg, Sweden. His research encompasses quantum error correction, quantum optimization, and superconductivity, as evidenced by his recent articles on topics such as graph neural networks and topological stabilizer codes. Granath's work contributes to advancing understanding in emerging fields of quantum information and materials science.

Articles (10)

To leverage the full potential of quantum error-correcting stabilizer codes it is crucial to have an efficient and accurate decoder. Accurate, maximum likelihood, decoders are computationally very expensive whereas decoders based on more efficient algorithms give sub-optimal performance. In addition, the accuracy will depend on the quality of models and estimates of error rates for idling qubits, gates, measurements, and resets, and will typically assume symmetric error channels. In this work, we explore a model-free, data-driven, approach to decoding, using a graph neural network (GNN). The decoding problem is formulated as a graph classification task in which a set of stabilizer measurements is mapped to an annotated detector graph for which the neural network predicts the most likely logical error class. We show that the GNN-based decoder can outperform a matching decoder for circuit level noise on the surface code given only the simulated data, while the matching decoder is given full information of the underlying error model. Although training is computationally demanding, inference is fast and scales approximately linearly with the space-time volume of the code. We also find that we can use large, but more limited, datasets of real experimental data for the repetition code, giving decoding accuracies that are on par with minimum weight perfect matching. The results show that a purely data-driven approach to decoding may be a viable future option for practical quantum error correction, which is competitive in terms of speed, accuracy, and versatility.

Year:

2025

Quantum computing offers new heuristics for combinatorial problems. With small- and intermediate-scale quantum devices becoming available, it is possible to implement and test these heuristics on small-size problems. A candidate for such combinatorial problems is the heterogeneous vehicle routing problem (HVRP): the problem of finding the optimal set of routes, given a heterogeneous fleet of vehicles with varying loading capacities, to deliver goods to a given set of customers. In this work, we investigate the potential use of a quantum computer to find approximate solutions to the HVRP using the quantum approximate optimization algorithm (QAOA). For this purpose we formulate a mapping of the HVRP to an Ising Hamiltonian and simulate the algorithm on problem instances of up to 21 qubits. We show that the number of qubits needed for this mapping scales quadratically with the number of customers. We compare the performance of different classical optimizers in the QAOA for varying problem size of the HVRP, finding a trade-off between optimizer performance and runtime.

Year:

2024

The code-capacity threshold of a scalable quantum error correcting stabilizer code can be expressed as a thermodynamic phase transition of a corresponding random-bond Ising model. Here we study the XY and XZZX surface codes under phase-biased noise, p x = p y = p z / ( 2 η ) , with η ≥ 1 / 2 , and total error rate p = p x + p y + p z . By appropriately formulating the boundary conditions, in the rotated code geometry, we find exact solutions at a special disordered point, p = 1 + η − 1 2 + η − 1 ≳ 0.5 , for arbitrary odd code distance d , where the codes reduce to one-dimensional Ising models. The total logical failure rate is given by P f = 3 4 − 1 4 e − 2 d Z artanh ( 1 / 2 η ) , where d Z = d 2 and d for the two codes respectively, is the effective code distance for pure phase-flip noise. As a consequence, for code distances d ≪ η , and error rates near the threshold, the XZZX code is effectively equivalent to the phase-flip correcting repetition code over d qubits. The large finite size corrections for d Z < η also make threshold extractions, from numerical calculations at moderate code distances, unreliable. We show that calculating thresholds based not only on the total logical failure rate, but also independently on the phase- and bit-flip logical failure rates, gives a more confident estimate. Using this method for the XZZX code with a tensor-network based decoder and code distances up to d ≈ 100 , we find that the thresholds converge to a single value at moderate bias ( η = 30 , 100 ), at an error rate above the hashing bound.

Year:

2024

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2021

Year:

2020

Year:

2020