Searcharxiv⌕ Search

arXiv subjects

Orsolya Kálmán

Publications and source records attributed to Orsolya Kálmán.

18 recordsLinked to original sources

Repetition-code-based readout error detection and correction across hardware platforms and generations

Readout errors are one of the dominant sources of noise in current quantum processors, limiting both expectation-value estimation and sampling-based applications. Since they affect only the classical measurement outcomes, they can be addressed using classical coding techniques: immediately before measurement, each data qubit is redundantly encoded with ancilla qubits, and the resulting bit string is decoded either by post-selection or by majority voting. Unlike conventional readout error mitigation, which corrects only aggregate quantities such as expectation values, this approach operates on individual measurement shots and can therefore produce approximately corrected samples. We present a systematic cross-platform and cross-generation experimental evaluation of repetition-code readout error detection and correction. We benchmark the same protocol on IBM Heron r1-r3 superconducting processors and Quantinuum H1 and H2 trapped-ion processors while independently varying the code distance, hardware generation, and encoding layout. We find that both error detection and correction improve readout fidelity on every device and generation tested, even as the unencoded baseline improves substantially across successive hardware releases. At the same time, the value of additional redundancy depends strongly on the underlying hardware. On superconducting processors, the extra gate errors introduced by the encoding rapidly offset its benefits, whereas on trapped-ion processors the much lower gate error rates allow larger code distances to remain advantageous.

quant-ph↗

Clifford Volume and Free Fermion Volume: Complementary Scalable Benchmarks for Quantum Computers

As quantum computing advances toward the late-NISQ and early fault-tolerant eras, scalable and platform-independent benchmarks are essential for quantifying computational capacity in a classically verifiable manner. We introduce two volumetric benchmarks, Clifford Volume and Free Fermion Volume, that assess quantum hardware by testing the execution of random Clifford and free fermion operations. These two groups of unitaries possess a combination of properties that make them ideal for benchmarking: (i) each is individually efficient to simulate classically, enabling verification at scale; (ii) together they form a universal gate set; (iii) they serve as essential algorithmic primitives in practical applications (including shadow tomography and quantum chemistry); and (iv) their definitions are formulated abstractly, without explicit reference to hardware-specific features such as qubit connectivity or native gate sets. This framework thus enables scalable and fair cross-platform comparisons and tracks meaningful computational advancement. We demonstrate the practical feasibility of these benchmarks through extensive numerical simulations across realistic noise parameters and through experimental validation on Quantinuum's H2-1 trapped-ion quantum computer, which achieves a Clifford Volume of 34.

quant-ph↗

Ergodic dynamics in iterated quantum protocols

We study measurement-induced nonlinear dynamics generated by an iterated quantum protocol combining an entangling gate, a single-qubit rotation, and post-selection. For pure single-qubit inputs, a particular choice of the single-qubit unitary yields globally chaotic, strongly mixing dynamics that explores the entire Bloch sphere, providing a physical realization of ergodic behavior in a complex map. We extend the analysis to realistic, noisy preparation by considering mixed initial states and the induced nonlinear evolution inside the Bloch sphere. Numerical results show that the maximally mixed state is an attractor for mixed inputs, although many trajectories exhibit transient increases in purity before ultimately converging. To quantify robustness against noise, we introduce a practical notion of quasi-ergodicity: ensembles prepared in a small angular patch at fixed purity rapidly spread to cover all directions, while the purity gradually decreases toward its minimal value. By varying the final single-qubit gate, we identify a broad family of protocols that remain ergodic-like for pure states, supported by consistent diagnostics including the absence of attracting cycles, agreement of time and ensemble statistics, rapid spreading from localized regions, and exponential sensitivity to initial conditions. Away from the special globally mixing case, the mixed-state dynamics can change qualitatively: for most ergodic-like parameters, a finite subset of noisy inputs is driven toward purification rather than complete mixing, demonstrating the coexistence of statistical mixing and purification within a single iterated protocol.

quant-ph↗

Universal, unambiguous concentration and distillation of Bell pairs

The ability of preparing perfect Bell pairs with a practical scheme is of great relevance for quantum communication as well as distributed quantum computing. We propose a scheme which probabilistically, but unambiguously produces the $\left|Φ_{+}\right>$ Bell pair from four copies of qubit pairs initially in the same arbitrary pure quantum state. The same scheme, extended to eight qubit pairs initially in the same, moderately mixed quantum state, unambiguously produces the $\left|Φ_{+}\right>$ Bell pair with quadratically suppressed noise. The core step of the proposed scheme consists of a pair of local two-qubit operations applied at each of the two distant locations, followed by a partial projective measurement and postselection at each party, with results communicated classically. While the scheme resembles standard entanglement distillation protocols, it achieves success within just three iterations, making it attractive for real-world applications.

quant-ph↗

The EU Quantum Flagship's Key Performance Indicators for Quantum Computing

As quantum processors continue to scale in size and complexity, the need for well-defined, reproducible, and technology-agnostic performance metrics becomes increasingly critical. Here we present a suite of scalable quantum computing benchmarks developed as key performance indicators (KPIs) within the EU Quantum Flagship. These proposed benchmarks are designed to assess holistic system performance rather than isolated components, and to remain applicable across both noisy intermediate-scale quantum (NISQ) devices and future fault-tolerant architectures. We introduce four core benchmarks addressing complementary aspects of quantum computing capability: large multi-qubit circuit execution via a Clifford Volume benchmark, scalable multipartite entanglement generation through GHZ-state preparation, a benchmark based on the application of Shor's period-finding subroutine to simple functions, and a protocol quantifying the benefit of quantum error correction using Bell states. Each benchmark is accompanied by clearly specified protocols, reporting standards, and scalable evaluation methods. Together, these KPIs provide a coherent framework for transparent and fair performance assessment across quantum hardware platforms and for tracking progress late-NISQ toward early fault-tolerant quantum computation.

quant-ph↗

Practical scheme for efficient distillation of GHZ states

We develop an efficient local operation and classical communication (LOCC) scheme for the distillation of Greenberger-Horne-Zeilinger (GHZ) states from tripartite systems subjected to both coherent and incoherent errors. The proposed method employs an iterative process that applies a postselection-based non-linear transformation to increase the entanglement of 3-qubit states. In contrast to traditional distillation protocols that require an exponential number of initial states as a resource, our method achieves subexponential convergence towards a pure GHZ state. The proposed scheme is practical in the sense that it employs a small set of relatively simple unitary operations and projective measurements in the computational basis. We systematically develop a double-iteration protocol by providing a mathematical framework for the transformation processes involved, emphasizing the role of unitary operations in correcting arbitrary small errors in the initial states. Through analytical derivations and numerical simulations, we demonstrate the protocol's ability to progressively eliminate noise and improve fidelity over subsequent iterations. Significantly, our protocol not only corrects for small arbitrary distortions in the GHZ states but also maintains operational simplicity, making it feasible for practical quantum computing applications.

quant-ph↗

Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't

In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transition toward fully fault-tolerant quantum computing. We examine theoretical no-go results and their implications, addressing misconceptions about the practicality of quantum error mitigation techniques and variational quantum algorithms. By emphasizing the nuances of error scaling, circuit depth, and algorithmic feasibility, we highlight viable near-term applications and synergies between error mitigation and early fault-tolerant architectures. Our discussion explores strategies for addressing current challenges, such as barren plateaus in variational circuits and the integration of quantum error mitigation and quantum error correction techniques. We aim to underscore the importance of continued innovation in hardware and algorithmic design to bridge the gap between theoretical potential and practical utility, paving the way for meaningful quantum advantage in the era of late noisy intermediate scale and early fault-tolerant quantum devices.

quant-ph↗

Towards a benchmark for quantum computers based on an iterated post-selective protocol

Applying post selection in each step of an iterated protocol leads to sensitive quantum dynamics that may be utilized to test and benchmark current quantum computers. An example of this type of protocols was originally proposed for the task of matching an unknown quantum state to a reference state. We propose to employ the quantum state matching protocol for the purpose of testing and benchmarking quantum computers. In particular, we implement this scheme on freely available IBM superconducting quantum computers. By comparing measured values with the theoretical conditional probability of the single, final post-selected qubit, which is easy to calculate classically, we define a benchmark metric. Additionally, the standard deviation of the experimental results from their average serves as a secondary benchmark metric, characterizing fluctuations in the given device. A peculiar feature of the considered protocol is that there is a phase parameter of the initially prepared state, on which the resulting conditional probability should not depend. A careful analysis of the measured values indicates that its dependence on the initial phase can reveal useful information about coherent gate errors of the quantum device.

quant-ph↗

Training iterated protocols for distillation of GHZ states with variational quantum algorithms

We present optimized distillation schemes for preparing Greenberger-Horne-Zeilinger (GHZ) states. Our approach relies on training variational quantum circuits with white noise affected GHZ states as inputs. Optimizing for a single iteration of the scheme, we find that it is possible to achieve an increased fidelity to the GHZ state, although further iterations decrease the fidelity. The same scheme, acting on coherently distorted pure-state inputs, is effective only in certain special cases. We show that radically different results can be achieved, however, when one optimizes for the output after two iterations of the protocol. In this case, the obtained schemes are more effective in distilling GHZ states from inputs affected by white noise. Moreover, they can also correct several types of coherent pure-state errors.

quant-ph↗

Testing quantum computers with the protocol of quantum state matching

The presence of noise in quantum computers hinders their effective operation. Even though quantum error correction can theoretically remedy this problem, its practical realization is still a challenge. Testing and benchmarking noisy, intermediate-scale quantum (NISC) computers is therefore of high importance. Here, we suggest the application of the so-called quantum state matching protocol for testing purposes. This protocol was originally proposed to determine if an unknown quantum state falls in a prescribed neighborhood of a reference state. We decompose the unitary specific to the protocol and construct the quantum circuit implementing one step of the dynamics for different characteristic parameters of the scheme and present test results for two different IBM quantum computers. By comparing the experimentally obtained relative frequencies of success to the ideal success probability with a maximum statistical tolerance, we discriminate statistical errors from device specific ones. For the characterization of noise, we also use the fact that while the output of the ideal protocol is insensitive to the internal phase of the input state, the actual implementation may lead to deviations. For systematically varied inputs we find that the device with the smaller quantum volume performs better on our tests than the one with larger quantum volume, while for random inputs they show a more similar performance.

quant-ph↗

Error-free interconversion of nonlocal boxes

Understanding the structure of nonlocal correlations is important in many fields ranging from fundamental questions of physics to device-independent cryptography. We present a protocol that can convert extremal two-party--two-input nonlocal no-signaling boxes of any type into any other extremal two-party--two-input nonlocal no-signaling box perfectly. Our results are exact, and even though the number of required boxes cannot be determined in advance, their expected number is finite. Our protocol is adaptive and demonstrates for the first time the usefulness of using no-signaling boxes in different causal orders by the parties.

quant-ph↗

Phase Transition in Iterated Quantum Protocols for Noisy Inputs

Quantum information processing exploits all the features quantum mechanics offers. Among them there is the possibility to induce nonlinear maps on a quantum system by involving two or more identical copies of the given system in the same state. Such maps play a central role in distillation protocols used for quantum key distribution. We determine that such protocols may exhibit sensitive, quasi-chaotic evolution not only for pure initial states but also for mixed states, i.e. the complex dynamical behavior is not destroyed by small initial uncertainty. We show that the appearance of sensitive, complex dynamics associated with a fractal structure in the parameter space of the system has the character of a first order phase transition. The purity of the initial state plays the role of the control parameter and the dimension of the fractal structure is independent of the purity value after passing the phase transition point. The critical purity coincides with the purity of a repelling fixed point of the dynamics and we show that all the pre-images of states from the close neighborhood of pure chaotic initial states have purity larger than this. Initial states from this set can be considered as quasi-chaotic.

quant-ph↗

Sensing microwave photons with a Bose-Einstein condensate

We consider the interaction of a magnetically trapped Bose-Einstein condensate of Rubidium atoms with the stationary microwave radiation field sustained by a coplanar waveguide resonator. This coupling allows for the measurement of the magnetic field of the resonator by means of counting the atoms that fall out of the condensate due to hyperfine transitions to non-trapped states. We determine the quantum efficiency of this detection scheme and show that weak microwave fields at the single-photon level can be sensed with an integration time on the order of a second.

quant-ph↗

Sensitivity to initial noise in measurement-induced nonlinear quantum dynamics

We consider a special iterated quantum protocol with measurement-induced nonlinearity for qubits, where all pure initial states on the Bloch sphere can be considered chaotic. The dynamics is ergodic with no attractive fixed cycles. We show that initial noise radically changes this behavior. The completely mixed state is an attractive fixed point of the dynamics induced by the protocol. Our numerical simulations strongly indicate that initially mixed states all converge to the completely mixed state. The presented protocol is an example, where gaining information from measurements and employing it to control an ensemble of quantum systems enables us to create ergodicity, which in turn is destroyed by any initial noise.

quant-ph↗

Quantum state matching of qubits via measurement-induced nonlinear transformations

We consider the task of deciding whether an unknown qubit state falls in a prescribed neighborhood of a reference state. We assume that several copies of the unknown state are given and apply a unitary operation pairwise on them combined with a post-selection scheme conditioned on the measurement result obtained on one of the qubits of the pair. The resulting transformation is a deterministic, nonlinear, chaotic map in the Hilbert space. We derive a class of these transformations capable of orthogonalizing nonorthogonal qubit states after a few iterations. These nonlinear maps orthogonalize states which correspond to the two different convergence regions of the nonlinear map. Based on the analysis of the border (the so-called Julia set) between the two regions of convergence, we show that it is always possible to find a map capable of deciding whether an unknown state is within a neighborhood of fixed radius around a desired quantum state. We analyze which one- and two-qubit operations would physically realize the scheme. It is possible to find a single two-qubit unitary gate for each map or, alternatively, a universal special two-qubit gate together with single-qubit gates in order to carry out the task. We note that it is enough to have a single physical realization of the required gates due to the iterative nature of the scheme.

quant-ph↗

Measurement-induced chaos and quantum state discrimination in an iterated Tavis-Cummings scheme

A cavity quantum electrodynamical scenario is proposed for implementing a Schrödinger microscope capable of amplifying differences between non orthogonal atomic quantum states. The scheme involves an ensemble of identically prepared two-level atoms interacting pairwise with a single mode of the radiation field as described by the Tavis-Cummings model. By repeated measurements of the cavity field and of one atom within each pair a measurement-induced nonlinear quantum transformation of the relevant atomic states can be realized. The intricate dynamical properties of this nonlinear quantum transformation, which exhibits measurement-induced chaos, allows approximate orthogonalization of atomic states by purification after a few iterations of the protocol, and thus the application of the scheme for quantum state discrimination.

quant-ph↗

Two-dimensional quantum rings with oscillating spin-orbit interaction strength: A wave function picture

We determine the relevant spinor valued wave functions for a two-dimensional quantum ring in the presence of Rashba-type spin-orbit interaction (SOI). The case of constant SOI strength is considered first, then we investigate the physical consequences of time-dependent (oscillating) SOI strength. Floquet's method is applied to find time-dependent eigenspinors, and it is shown that the Floquet quasienergies and thus their differences (the generalized Rabi frequencies) are determined by the radial boundary conditions. Time evolution of various initial states is calculated.

quant-ph↗

Quantum walk on the line with quantum rings

We propose a scheme to implement the one-dimensional coined quantum walk with electrons transported through a two-dimensional network of spintronic semiconductor quantum rings. The coin degree of freedom is represented by the spin of the electron, while the discrete position of the walker corresponds to the label of the rings in one of the spatial directions in the network. We assume that Rashba-type spin-orbit interaction is present in the rings, the strength of which can be tuned by an external electric field. The geometry of the device, together with the appropriate spin-orbit interaction strengths, ensure the realization of the coin-toss (i.e. spin-flip) and the step operator.

cond-mat.mes-hall↗