Ivan Pogorelov

Ivan Pogorelov

Auto-generated profile, based on publicly available information

Ivan Pogorelov

Universität Innsbruck

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 August 2024 in PRX Quantum
Verified
Journal Article
Open access
PDF file
LPLukas Postler
Lukas Postler
FBFriederike Butt
Friederike Butt
IPIvan Pogorelov
Ivan Pogorelov
CMChristian D. Marciniak
Christian D. Marciniak
SHSascha Heußen
Sascha Heußen
TMThomas Monz
Thomas Monz
Encoding information redundantly using quantum error-correcting (QEC) codes allows one to overcome the inherent sensitivity to noise in quantum computers to ultimately achieve large-scale quantum computation. The Steane QEC method involves preparing an auxiliary logical qubit of the same QEC code as used for the data register. The data and auxiliary registers are then coupled with a logical controlled- () gate, enabling a measurement of the auxiliary register to reveal the error syndrome. This study presents the implementation of multiple rounds of fault-tolerant (FT) Steane QEC on a trapped-ion quantum computer. Various QEC codes are employed and the results are compared to a previous experimental approach utilizing flag qubits. Our experimental findings show improved logical fidelities for Steane QEC and accompanying numerical simulations indicate an even larger performance advantage for quantum processors limited by entangling-gate errors. This establishes experimental Steane QEC as a competitive paradigm for FT quantum computing. Published by the American Physical Society 2024

24 January 2025 in Nature Physics
Verified
Journal Article
Closed access
PDF file
IPIvan Pogorelov
Ivan Pogorelov
FBFriederike Butt
Friederike Butt
LPLukas Postler
Lukas Postler
CMChristian D. Marciniak
Christian D. Marciniak
PSPhilipp Schindler
Philipp Schindler
TMThomas Monz
Thomas Monz

2 January 2025 in Nature Communications
Verified
Journal Article
Open access
PDF file
MRMartin Ringbauer
Martin Ringbauer
MHMarcel Hinsche
Marcel Hinsche
TFThomas Feldker
Thomas Feldker
PFPaul K. Faehrmann
Paul K. Faehrmann
JBJuani Bermejo-Vega
Juani Bermejo-Vega
DHDominik Hangleiter
Dominik Hangleiter
Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing tools for verifying that a quantum device indeed performed the classically intractable sampling task are either impractical or not scalable to the quantum advantage regime. The verification problem thus remains an outstanding challenge. Here, we experimentally demonstrate efficiently verifiable quantum random sampling in the measurement-based model of quantum computation on a trapped-ion quantum processor. We create and sample from random cluster states, which are at the heart of measurement-based computing, up to a size of 4 × 4 qubits. By exploiting the structure of these states, we are able to recycle qubits during the computation to sample from entangled cluster states that are larger than the qubit register. We then efficiently estimate the fidelity to verify the prepared states—in single instances and on average—and compare our results to cross-entropy benchmarking. Finally, we study the effect of experimental noise on the certificates. Our results and techniques provide a feasible path toward a verified demonstration of a quantum advantage.

26 January 2026 in Nature Communications
Verified
Journal Article
Open access
PDF file
FBFriederike Butt
Friederike Butt
IPIvan Pogorelov
Ivan Pogorelov
RFRobert Freund
Robert Freund
ASAlex Steiner
Alex Steiner
MMMarcel Meyer
Marcel Meyer
MMMarkus Müller
Markus Müller
The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations on error-detecting codes without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover’s quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.

18 June 2026 in Physical Review Research
Verified
Journal Article
Open access
DMDaniel Miller
Daniel Miller
KLKyano Levi
Kyano Levi
LPLukas Postler
Lukas Postler
ASAlex Steiner
Alex Steiner
LBLennart Bittel
Lennart Bittel
JEJens Eisert
Jens Eisert
Throughout its history, the theory of quantum error correction has heavily benefited from translating classical concepts into the quantum setting. In particular, classical notions of weight enumerators, which relate to the performance of an error-correcting code, and MacWilliams’ identity, which links enumerators of a code to the ones of its dual, have been generalized to the quantum case. In this work, we establish a relationship between the theoretical machinery of quantum weight enumerators and a seemingly unrelated physics experiment: we prove that Rains’ quantum shadow enumerators—a powerful mathematical tool—arise as probabilities of observing fixed numbers of triplets in a two-copy Bell sampling experiment. This insight allows us to develop here a rigorous framework for the direct measurement of quantum weight enumerators, thus enabling experimental and theoretical studies of the entanglement structure of any quantum error-correcting code or quantum state under investigation. On top of that, we derive concrete sample complexity bounds and physically motivated robustness guarantees against unavoidable experimental imperfections. Finally, we demonstrate the feasibility of experimentally learning weight enumerators on a trapped-ion quantum computer. Our experimental findings are in good agreement with theoretical predictions and illuminate how entanglement theory and quantum error correction cross-fertilize each other once two-copy Bell sampling experiments are combined with the theoretical machinery of quantum weight enumerators.