arXiv subjects

Thiago L. M. Guedes

Publications and source records attributed to Thiago L. M. Guedes.

9 recordsLinked to original sources

arXiv2026

High-performance cellular automaton decoders for quantum repetition and toric code

Execution of quantum algorithms on large-scale quantum computers will require extremely low logical error rates, which necessitates the development of scalable decoding architectures. Local decoders are promising candidates for this task, as they avoid the communication and data processing bottlenecks inherent in global decoding strategies. Cellular automaton (CA) decoders represent a distinct class of local decoders, offering a path toward the low-latency, real-time decoding required for practical applications. In this work, we present SCALA (Signaling CA with Local Attraction), a novel non-hierarchical cellular automaton decoder for quantum repetition and toric codes. By evaluating SCALA alongside the hierarchical CA decoder proposed by Harrington, we provide a direct comparison between non-hierarchical and renormalization-group-style local decoding strategies. We characterize SCALA across three key metrics: Performance, scalability, and robustness. Our results show that SCALA achieves a code-capacity threshold of approximately $p_c\approx 7.5\%$ and provides strong sub-threshold scaling of about $p_L\propto p^{d/4}$ on the toric code. In terms of scalability, our non-hierarchical design ensures that the local computational resources remain independent of system size, yielding a modular local architecture suitable for hardware implementation. Finally, SCALA demonstrates strong robustness to qubit measurement errors and noise within the decoder itself, a critical advantage for real-time decoding on noisy hardware. Our results establish SCALA as a high-performance, scalable, and robust local decoder for scalable quantum error correction.

quant-ph↗

arXiv2025

Fast Native Three-Qubit Gates and Fault-Tolerant Quantum Error Correction with Trapped Rydberg Ions

Trapped ions as one of the most promising quantum-information-processing platforms, yet conventional entangling gates mediated by collective motion remain slow and difficult to scale. Exciting trapped ions to high-lying electronic Rydberg states provides a promising route to overcome these limitations by enabling strong, long-range dipole-dipole interactions that support much faster multi-qubit operations. Here, we introduce the first scheme for implementing a native controlled-controlled-Z gate with microwave-dressed Rydberg ions by optimizing a single-pulse protocol that accounts for the finite Rydberg-state lifetime. The resulting gate outperforms standard decompositions into one- and two-qubit gates by achieving fidelities above 97% under realistic conditions, with execution times of about 2 microseconds at cryogenic temperatures. To explore the potential of trapped Rydberg ions for fault-tolerant quantum error correction, and to illustrate the utility of three-qubit Rydberg-ion gates in this context, we develop and analyze a proposal for fault-tolerant, measurement-free quantum error correction using the nine-qubit Bacon-Shor code. Our simulations confirm that quantum error correction can be performed in a fully fault-tolerant manner on a linear Rydberg-ion chain despite its limited qubit connectivity. These results establish native multiqubit Rydberg-ion gates as a valuable resource for fast, high-fidelity quantum computing and highlight their potential for fault-tolerant quantum error correction.

quant-ph↗

arXiv2025

Computing the graph-changing dynamics of loop quantum gravity

In loop quantum gravity (LQG), states of the gravitational field are represented by labeled graphs called spin networks. Their dynamics can be described by a Hamiltonian constraint, { which acts on the spin network states modifying both spins and graphs.} Fixed-graph approximations of the dynamics have been extensively studied, but its full graph-changing action so far remains elusive. The latter, alongside the solutions of its constraint, are arguably the missing features { in canonical LQG to access phenomenology in all its richness}. Here, we discuss a recently developed numerical tool that, for the first time, implements graph-changing dynamics via the Hamiltonian constraint. We explain how it is used to find new solutions to that constraint and to show that some quantum geometric observables behave differently than in the graph-preserving truncation. We also point out that these new numerical methods can find applications in other domains.

gr-qc↗

arXiv2025

Taming Thiemann's Hamiltonian constraint in canonical loop quantum gravity: reversibility, eigenstates and graph-change analysis

The Hamiltonian constraint remains an elusive object in loop quantum gravity because its action on spinnetworks leads to changes in their corresponding graphs. As a result, calculations in loop quantum gravity are often considered unpractical, and neither the eigenstates of the Hamiltonian constraint, which form the physical space of states, nor the concrete effect of its graph-changing character on observables are entirely known. Much worse, there is no reference value to judge whether the commonly adopted graph-preserving approximations lead to results anywhere close to the non-approximated dynamics. Our work sheds light on many of these issues, by devising a new numerical tool that allows us to implement the action of the Hamiltonian constraint without the need for approximations and to calculate expectation values for geometric observables. To achieve that, we fill the theoretical gap left in the derivations of the action of the Hamiltonian constraint on spinnetworks: we provide the first complete derivation of such action for the case of 4-valent spinnetworks, while updating the corresponding derivation for 3-valent spinnetworks. Our derivations also include the action of the volume operator. By proposing a new approach to encode spinnetworks into functions of lists and the derived formulas into functionals, we implement both the Hamiltonian constraint and the volume operator numerically. We are able to transform spinnetworks with graph-changing dynamics perturbatively and verify that volume expectation values have rather different behavior from the approximated, graph-preserving results. Furthermore, using our tool we find a family of potentially relevant solutions of the Hamiltonian constraint. Our work paves the way to a new generation of calculations in loop quantum gravity, in which graph-changing results and their phenomenology can finally be accounted for and understood.

gr-qc↗

arXiv2025

Quantum cellular automata for quantum error correction and density classification

Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant manner on all cells/qudits of a register, generating a global rule that updates cell states locally, i.e., based solely on the states of their neighbors. Although desirable features in many applications, it is generally not clear to which extent these fully automated discrete-time local updates can generate and sustain long-range order in the (noisy) systems they act upon. In special, whether and how quantum cellular automata can perform quantum error correction remain open questions. We close this conceptual gap by proposing quantum cellular automata with quantum-error-correction capabilities. We design and investigate two (quasi-)one dimensional quantum cellular automata based on known classical cellular-automata rules with density-classification capabilities, namely the local majority voting and the two-line voting. We investigate the performances of those quantum cellular automata as quantum-memory components by simulating the number of update steps required for the logical information they act upon to be afflicted by a logical bit flip. The proposed designs pave a way to further explore the potential of new types of quantum cellular automata with built-in quantum error correction capabilities.

quant-ph↗

arXiv2024

Two-qubit gate protocols with microwave-dressed Rydberg ions in a linear Paul trap

Ultracold trapped atomic ions excited into highly energetic Rydberg states constitute a promising platform for scalable quantum information processing. Elementary building blocks for such tasks are high-fidelity and sufficiently fast entangling two-qubit gates, which can be achieved via strong dipole-dipole interactions between microwave-dressed Rydberg ions, as recently demonstrated in a breakthrough experiment at https://www.nature.com/articles/s41586-020-2152-9 . We theoretically investigate the performance of three protocols leading to controlled-phase gate operations. Starting from a microscopic description of Rydberg ions in a linear Paul trap, we derive an effective Hamiltonian that faithfully captures the essential dynamics underlying the gate protocols. We then use an optimization scheme to fine-tune experimentally controllable parameters like laser detuning and Rabi frequency to yield maximal gate fidelity under each studied protocol. We show how non-adiabatic transitions resulting from fast laser driving relative to the characteristic time scales of the system detrimentally affect the fidelity. Despite this, we demonstrate that in the realistic scenario of Rydberg ions with finite radiative lifetimes, optimizing the best found gate protocol enables achievement of fidelities as high as $99.25\,\%$ for a gate time of $0.2\,μ\mathrm{s}$. This considerably undercuts entangling gate durations between ground-state ions, for which gate times are typically limited by the comparably slower time scales of vibrational modes. Overall, this places trapped Rydberg ions into the regime where fast high-accuracy quantum computing and eventually quantum error correction become possible.

quant-ph↗

arXiv2023

Optical time-domain quantum state tomography on a subcycle scale

Following recent progress in the experimental application of electro-optic sampling to the detection of the quantum fluctuations of the electromagnetic-field ground state and ultrabroadband squeezed states on a subcycle scale, we propose an approach to elevate broadband electro-optic sampling from a spectroscopic method to a full quantum tomography scheme, able to reconstruct a broadband quantum state directly in the time-domain. By combining two recently developed methods to theoretically describe quantum electro-optic sampling, we analytically relate the photon-count probability distribution of the electro-optic signal to a transformed phase-space quasiprobability distribution of the sampled quantum state as a function of the time delay between the sampled mid-infrared pulsed state and an ultrabroadband near-infrared pump/probe pulse. We catalog and analyze sources of noise and show that in quantum electro-optic sampling with an ultrabroadband pump pulse one can expect to observe thermalization due to entanglement breaking. Mitigation of the thermalization noise enables a tomographic reconstruction of broadband quantum states while granting access to its dynamics on a subcycle scale.

quant-ph↗

arXiv2022

A complete POVM description of multi-channel quantum electro-optic sampling with monochromatic field modes

We propose a multi-channel version of quantum electro-optic sampling involving monochromatic field modes. It allows for multiple simultaneous measurements of arbitrarily many $\hat{X}$ and $\hat{Y}$ field-quadrature for a single quantum-state copy, while independently tuning the interaction strengths at each channel. In contrast to standard electro-optic sampling, the sampled mid-infrared (MIR) mode undergoes a nonlinear interaction with multiple near-infrared (NIR) pump beams. We present a complete positive operator-valued measure (POVM) description for quantum states in the MIR mode. The probability distribution of the electro-optic signal outcomes is shown to be related to an $s$-parametrized phase-space quasiprobability distribution of the indirectly measured MIR state, with the parameter $s$ depending solely on the quantities characterizing the nonlinear interaction. Furthermore, we show that the quasiprobability distributions for the sampled and post-measurement states are related to each other through a renormalization and a change in the parametrization. This result is then used to demonstrate that two consecutive measurements of both $\hat{X}$ and $\hat{Y}$ quadratures can outperform eight-port homodyne detection.

quant-ph↗

arXiv2021

Realizing an Unruh-DeWitt detector through electro-optic sampling of the electromagnetic vacuum

A new theoretical framework to describe the experimental advances in electro-optic detection of broadband quantum states, specifically the quantum vacuum, is devised. By making use of fundamental concepts from quantum field theory on spacetime metrics, the nonlinear interaction behind the electro-optic effect can be reformulated in terms of an Unruh-DeWitt detector coupled to a conjugate field during a very short time interval. When the coupling lasts for a time interval comparable to the oscillation periods of the detected field mode (i.e. the subcycle regime), virtual particles inhabiting the field vacuum are transferred to the detector in the form of real excitations. We demonstrate that this behavior can be rigorously translated to the scenario of electro-optic sampling of the quantum vacuum, in which the (spectrally filtered) probe works as an Unruh-DeWitt detector, with its interaction-generated photons arising from virtual particles inhabiting the electromagnetic vacuum. We discuss the specific working regime of such processes, and the consequences through characterization of the quantum light involved in the detection.

quant-ph↗