arXiv subjects

Ivan Pogorelov

Publications and source records attributed to Ivan Pogorelov.

17 recordsLinked to original sources

arXiv2026

Holographic quantum codes with trapped ions

Holography is a central concept at the intersection of gravity, condensed matter theory, and quantum information, linking the interior bulk of a system to its boundary. A model realizing key features of holographic systems is the holographic pentagon code by Pastawski et al. Here we experimentally implement instances of the holographic pentagon and heptagon codes with trapped ions and test their properties: For the pentagon code, we recover logical bulk qubits from their nearby boundary and test the Ryu-Takayanagi entanglement area law. For the heptagon code, we show that the transversal Hadamard gate native to the constituent Steane codes induces a single-qubit, correctable error in the holographic code. Our implementation paves the way towards the use of holographic quantum codes for quantum information processing.

quant-ph↗

arXiv2026

Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery

Universal quantum computers are expected to generate arbitrary complex quantum states of logical qubits encoded in many physical qubits. This capability hinges on a fault-tolerantly implemented universal gate set, which no single quantum error-correction code admits transversally but which becomes accessible by joining complementary codes via lattice surgery. Here we report on the experimental generation and certification of logical genuine multipartite entanglement in a trapped-ion quantum processor using a transversally implemented universal logical gate set. The gate set is accessed via lattice surgery across two different codes and comprises a Hadamard gate on a four-qubit surface code and a doubly controlled Pauli-$Z$ ($\overline{\mathrm{CCZ}}$) gate on an eight-qubit 3D colour code. To showcase this lattice-surgery toolbox, we generate both stabiliser (Greenberger-Horne-Zeilinger) and non-stabiliser ($|\overline{\mathrm{CCZ}}\rangle$) states of three logical qubits and verify their genuine multipartite entanglement--a form of correlation beyond statistical mixtures of bipartite entanglement across any bipartition. We further use these cross-code primitives to demonstrate arbitrary rotations of single logical qubits via a $\overline{\mathrm{CCZ}}$-based resource gadget accessing the full universal gate set through lattice surgery. Together, these demonstrations showcase the core building blocks of an architecture for fault-tolerant quantum computation and its ability to generate complex logical quantum states.

quant-ph↗

arXiv2025

Demonstration of measurement-free universal fault-tolerant quantum computation

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 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.

quant-ph↗

arXiv2024

Experimental measurement and a physical interpretation of quantum shadow enumerators

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 helps to compute enumerators, have been generalized to the quantum case. In this work, we establish a distinct 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 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 state under investigation. On top of that, we derive concrete sample complexity bounds and physically-motivated robustness guarantees against unavoidable experimental imperfections. Finally, we experimentally demonstrate the possibility of directly measuring 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 can cross-fertilize each other once Bell sampling experiments are combined with the theoretical machinery of quantum weight enumerators.

quant-ph↗

arXiv2024

Learning symmetry-protected topological order from trapped-ion experiments

Classical machine learning has proven remarkably useful in post-processing quantum data, yet typical learning algorithms often require prior training to be effective. In this work, we employ a tensorial kernel support vector machine (TK-SVM) to analyze experimental data produced by trapped-ion quantum computers. This unsupervised method benefits from directly interpretable training parameters, allowing it to identify the non-trivial string-order characterizing symmetry-protected topological (SPT) phases. We apply our technique to two examples: a spin-1/2 model and a spin-1 model, featuring the cluster state and the AKLT state as paradigmatic instances of SPT order, respectively. Using matrix product states, we generate a family of quantum circuits that host a trivial phase and an SPT phase, with a sharp phase transition between them. For the spin-1 case, we implement these circuits on two distinct trapped-ion machines based on qubits and qutrits. Our results demonstrate that the TK-SVM method successfully distinguishes the two phases across all noisy experimental datasets, highlighting its robustness and effectiveness in quantum data interpretation.

quant-ph↗

arXiv2024

Verifiable measurement-based quantum random sampling with trapped ions

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 x 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.

quant-ph↗

arXiv2024

Experimental fault-tolerant code switching

Quantum error correction is a crucial tool for mitigating hardware errors in quantum computers by encoding logical information into multiple physical qubits. However, no single error-correcting code allows for an intrinsically fault-tolerant implementation of all the gates needed for universal quantum computing [1-3]. One way to tackle this problem is to switch between two suitable error-correcting codes, while preserving the encoded logical information, which in combination give access to a fault-tolerant universal gate set [4-6]. In this work, we present the first experimental implementation of fault-tolerant code switching between two codes. One is the seven-qubit color code [7], which features fault-tolerant CNOT and $H$ quantum gates, while the other one, the 10-qubit code [8], allows for a fault-tolerant $T$-gate implementation. Together they form a complementary universal gate set. Building on essential code switching building blocks, we construct logical circuits and prepare 12 different logical states which are not accessible natively in a fault-tolerant way within a single code. Finally, we use code switching to entangle two logical qubits employing the full universal gate set in a single logical quantum circuit. Our results experimentally open up a new route towards deterministic control over logical qubits with low auxiliary qubit overhead, not relying on the probabilistic preparation of resource states.

quant-ph↗

arXiv2023

Demonstration of fault-tolerant Steane quantum error correction

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 used for the data register. The data and auxiliary registers are then coupled with a logical CNOT gate, enabling a measurement of the auxiliary register to reveal the error syndrome. This study presents the implementation of multiple rounds of fault-tolerant 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. This establishes experimental Steane QEC as a competitive paradigm for fault-tolerant quantum computing.

quant-ph↗

arXiv2023

Approaching optimal entangling collective measurements on quantum computing platforms

Entanglement is a fundamental feature of quantum mechanics and holds great promise for enhancing metrology and communications. Much of the focus of quantum metrology so far has been on generating highly entangled quantum states that offer better sensitivity, per resource, than what can be achieved classically. However, to reach the ultimate limits in multi-parameter quantum metrology and quantum information processing tasks, collective measurements, which generate entanglement between multiple copies of the quantum state, are necessary. Here, we experimentally demonstrate theoretically optimal single- and two-copy collective measurements for simultaneously estimating two non-commuting qubit rotations. This allows us to implement quantum-enhanced sensing, for which the metrological gain persists for high levels of decoherence, and to draw fundamental insights about the interpretation of the uncertainty principle. We implement our optimal measurements on superconducting, trapped-ion and photonic systems, providing an indication of how future quantum-enhanced sensing networks may look.

quant-ph↗

arXiv2023

Strategies for practical advantage of fault-tolerant circuit design in noisy trapped-ion quantum computers

Fault-tolerant quantum error correction provides a strategy to protect information processed by a quantum computer against noise which would otherwise corrupt the data. A fault-tolerant universal quantum computer must implement a universal gate set on the logical level in order to perform arbitrary calculations to in principle unlimited precision. We characterize the recent demonstration of a fault-tolerant universal gate set in a trapped-ion quantum computer [Postler et al. Nature 605.7911 (2022)] and identify aspects to improve the design of experimental setups to reach an advantage of logical over physical qubit operation. We show that various criteria to assess the break-even point for fault-tolerant quantum operations are within reach for the ion trap quantum computing architecture under consideration. We analyze the influence of crosstalk in entangling gates for logical state preparation circuits. These circuits can be designed to respect fault tolerance for specific microscopic noise models. We find that an experimentally-informed depolarizing noise model captures the essential noise dynamics of the fault-tolerant experiment, and crosstalk is negligible in the currently accessible regime of physical error rates. For deterministic Pauli state preparation, we provide a fault-tolerant unitary logical qubit initialization circuit, which can be realized without in-sequence measurement and feed-forward of classical information. We show that non-deterministic state preparation schemes for logical Pauli and magic states perform with higher logical fidelity over their deterministic counterparts for the current and anticipated future regime of physical error rates. Our results offer guidance on improvements of physical qubit operations and validate the experimentally-informed noise model as a tool to predict logical failure rates in quantum computing architectures based on trapped ions.

quant-ph↗

arXiv2022

Demonstration of fault-tolerant universal quantum gate operations

Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits using error correcting codes. When manipulating the logical quantum states, it is imperative that errors caused by imperfect operations do not spread uncontrollably through the quantum register. This requires that all operations on the quantum register obey a fault-tolerant circuit design which, in general, increases the complexity of the implementation. Here, we demonstrate a fault-tolerant universal set of gates on two logical qubits in a trapped-ion quantum computer. In particular, we make use of the recently introduced paradigm of flag fault tolerance, where the absence or presence of dangerous errors is heralded by usage of few ancillary 'flag' qubits. We perform a logical two-qubit CNOT-gate between two instances of the seven qubit color code, and we also fault-tolerantly prepare a logical magic state. We then realize a fault-tolerant logical T-gate by injecting the magic state via teleportation from one logical qubit onto the other. We observe the hallmark feature of fault tolerance, a superior performance compared to a non-fault-tolerant implementation. In combination with recently demonstrated repeated quantum error correction cycles these results open the door to error-corrected universal quantum computation.

quant-ph↗

arXiv2022

Optimal metrology with programmable quantum sensors

Quantum sensors are an established technology that has created new opportunities for precision sensing across the breadth of science. Using entanglement for quantum-enhancement will allow us to construct the next generation of sensors that can approach the fundamental limits of precision allowed by quantum physics. However, determining how state-of-the-art sensing platforms may be used to converge to these ultimate limits is an outstanding challenge. In this work we merge concepts from the field of quantum information processing with metrology, and successfully implement experimentally a *programmable quantum sensor* operating close to the fundamental limits imposed by the laws of quantum mechanics. We achieve this by using low-depth, parametrized quantum circuits implementing optimal input states and measurement operators for a sensing task on a trapped ion experiment. With 26 ions, we approach the fundamental sensing limit up to a factor of 1.45(1), outperforming conventional spin-squeezing with a factor of 1.87(3). Our approach reduces the number of averages to reach a given Allan deviation by a factor of 1.59(6) compared to traditional methods not employing entanglement-enabled protocols. We further perform on-device quantum-classical feedback optimization to `self-calibrate' the programmable quantum sensor with comparable performance. This ability illustrates that this next generation of quantum sensor can be employed without prior knowledge of the device or its noise environment.

quant-ph↗

arXiv2021

Quantum portfolio value forecasting

We present an algorithm which efficiently estimates the intrinsic long-term value of a portfolio of assets on a quantum computer. The method relies on quantum amplitude estimation to estimate the mean of a novel implementation of the Gordon-Shapiro formula. The choice of loading and readout algorithms makes it possible to price a five-asset portfolio on present day quantum computers, a feat which has not been realised using quantum computing to date. We compare results from two available trapped ion quantum computers. Our results are consistent with classical benchmarks, but result in smaller statistical errors for the same computational cost.

quant-ph↗

arXiv2021

A compact ion-trap quantum computing demonstrator

Quantum information processing is steadily progressing from a purely academic discipline towards applications throughout science and industry. Transitioning from lab-based, proof-of-concept experiments to robust, integrated realizations of quantum information processing hardware is an important step in this process. However, the nature of traditional laboratory setups does not offer itself readily to scaling up system sizes or allow for applications outside of laboratory-grade environments. This transition requires overcoming challenges in engineering and integration without sacrificing the state-of-the-art performance of laboratory implementations. Here, we present a 19-inch rack quantum computing demonstrator based on $^{40}\textrm{Ca}^+$ optical qubits in a linear Paul trap to address many of these challenges. We outline the mechanical, optical, and electrical subsystems. Further, we describe the automation and remote access components of the quantum computing stack. We conclude by describing characterization measurements relevant to digital quantum computing including entangling operations mediated by the Molmer-Sorenson interaction. Using this setup we produce maximally-entangled Greenberger-Horne-Zeilinger states with up to 24 ions without the use of post-selection or error mitigation techniques; on par with well-established conventional laboratory setups.

quant-ph↗

arXiv2018

Reconfigurable photonics on a glass chip

Reconfigurability of integrated photonic chips plays a key role in current experiments in the area of linear-optical quantum computing. We demonstrate a reconfigurable multiport interferometer implemented as a femtosecond laser-written integrated photonic device. The device includes a femtosecond laser-written $4\times 4$ multiport interferometer equipped with 12 thermooptical phase shifters, making it a universal programmable linear-optical circuit. We achieve a record fast switching time for a single nested Mach-Zender interferometer of $\sim10$ ms and quantitatively analyse the reconfigurability of the optical circuit. We believe, that our results will improve the current state of quantum optical experiments utilizing femtosecond laser-written photonic circuits.

physics.app-ph↗

arXiv2016

Experimental adaptive process tomography

Adaptive measurements were recently shown to significantly improve the performance of quantum state tomography. Utilizing information about the system for the on-line choice of optimal measurements allows to reach the ultimate bounds of precision for state reconstruction. In this article we generalize an adaptive Bayesian approach to the case of process tomography and experimentally show its superiority in the task of learning unknown quantum operations. Our experiments with photonic polarization qubits cover all types of single-qubit channels. We also discuss instrumental errors and the criteria for evaluation of the ultimate achievable precision in an experiment. It turns out, that adaptive tomography provides a lower noise floor in the presence of strong technical noise.

quant-ph↗

arXiv2015

Experimental Adaptive Quantum Tomography of Two-Qubit States

We report an experimental realization of adaptive Bayesian quantum state tomography for two-qubit states. Our implementation is based on the adaptive experimental design strategy proposed in [F.Huszár and N.M.T.Houlsby, Phys.Rev.A 85, 052120 (2012)] and provides an optimal measurement approach in terms of the information gain. We address the practical questions, which one faces in any experimental application: the influence of technical noise, and behavior of the tomographic algorithm for an easy to implement class of factorized measurements. In an experiment with polarization states of entangled photon pairs we observe a lower instrumental noise floor and superior reconstruction accuracy for nearly-pure states of the adaptive protocol compared to a non-adaptive. At the same time we show, that for the mixed states the restriction to factorized measurements results in no advantage for adaptive measurements, so general measurements have to be used.

quant-ph↗