arXiv subjects

Marzio Vallero

Publications and source records attributed to Marzio Vallero.

5 recordsLinked to original sources

arXiv2026

TETRIS-Q: Tiling-based Effective Transient-fault Reduction on Interleaved Superconducting Qubits

The struggle of the hour in quantum computing research is achieving effective suppression of the error mechanisms induced by the interaction of external radiation with superconducting quantum devices. Despite the rapid advancements in quantum error correction (QEC) of recent years, radiation-induced faults are yet to be fully addressed. These events are known to be the cause of simultaneous correlated defects in qubits that lie onto a single substrate, ultimately jeopardising QEC code effectiveness. In this paper, we propose to selectively combine substrate-level phonon barriers and QEC interleaving via a planar-mesh tiling algorithm, TETRIS-Q, reaching efficient and effective suppression of radiation events. Our cross-layer solution comes at no extra cost in terms of QEC code execution or decoding time. We model and simulate radiation-induced transient faults over a plethora of barrier and QEC interleaving configurations. Through more than 51 million quantum circuit simulations, we show peak logical error reductions of more than $99.8 \%$, together with an $80\%$ reduction of the observable transient duration with permeable barriers. We find that sparser tiling can reach comparable performance to single qubit tiling, prompting cost reductions of upwards of $87 \%$ in barrier tracing. By leveraging independent QEC code interleaving, we measure up to one order of magnitude average logical error rate reductions without the use of permeable barriers, and up to three orders of magnitude with the joint usage of barriers.

quant-ph↗

arXiv2025

SQUID G.A.M.E.: Gamma, Atmospheric, and Mono-Energetic Neutron Effects on Quantum Devices

Quantum devices are a promising solution to many research applications, including medical imaging, precision magnetic field measurements, condensed matter physics, and overcoming the limits of classical computing. Among the available implementations, the superconducting technology is the current focus of scientific research and industrial applications, excelling in performance and scalability. Despite this, superconducting quantum systems are extremely prone to decoherence, and in particular, they are highly sensitive to radiation events. In this paper, we analyze the response of a superconducting device (SQUID) to radiation. We expose the SQUID to beams of monoenergetic 14 MeV neutrons (NILE - ISIS), atmospheric 1-800 MeV neutrons (ChipIR - ISIS), and gamma rays with 1.25 MeV average energy (CALLIOPE - ENEA). These experiments show that the SQUID is sensitive to the two neutron fields, while gamma rays at 1.25 MeV leave it mostly unaffected. Following our experiments with neutrons, it is possible to characterize the SQUID's response and even classify faults according to their shape and duration. We identify two categories: bursts (long lasting) and peaks (short lived). To investigate the different responses to neutrons and gamma rays, we employ Geant4 simulations, which highlight differences in the deposition spectra and the energy propagation, but likewise predict the vulnerability of the SQUID in both cases.

quant-ph↗

arXiv2025

Radiation-Induced Fault Detection in Superconducting Quantum Devices

The quest for universal superconducting quantum computing is hindered by noise and errors. It has been proven that Quantum Error Correction (QEC) codes will lay at the foundation of fault tolerant quantum computing. However, cosmic-ray induced correlated errors, which are the most detrimental events that can impact superconducting quantum computers, are yet to be efficiently tackled. In order to reach fault tolerance, we must also develop radiation aware methods to complement QEC. In this paper, we propose the first algorithm to effectively exploit syndrome information for the efficient detection of radiation events in superconducting quantum devices at runtime. We perform a thorough analysis of simulated Rotated Surface codes injecting over 11 million physics-modeled radiation-induced faults. We consider the properties of the X and Z check bases, the impact of code distance, and the decoder's time to solution constraints. Our technique detects $100\%$ of injected faults, regardless of the impact's position. Moreover, we accurately identify both the radiation impact centre and the area affected, with an overhead lower than $0.3\%$ the decoding time. Additionally, we use the fault identification information to propose a radiation fault correction technique that improves of up to $20\%$ the output correctness compared to existing decoders.

quant-ph↗

arXiv2024

On the Efficacy of Surface Codes in Compensating for Radiation Events in Superconducting Devices

Reliability is fundamental for developing large-scale quantum computers. Since the benefit of technological advancements to the qubit's stability is saturating, algorithmic solutions, such as quantum error correction (QEC) codes, are needed to bridge the gap to reliable computation. Unfortunately, the deployment of the first quantum computers has identified faults induced by natural radiation as an additional threat to qubits reliability. The high sensitivity of qubits to radiation hinders the large-scale adoption of quantum computers, since the persistence and area-of-effect of the fault can potentially undermine the efficacy of the most advanced QEC. In this paper, we investigate the resilience of various implementations of state-of-the-art QEC codes to radiation-induced faults. We report data from over 400 million fault injections and correlate hardware faults with the logical error observed after decoding the code output, extrapolating physical-to-logical error rates. We compare the code's radiation-induced logical error rate over the code distance, the number and role in the QEC of physical qubits, the underlying quantum computer topology, and particle energy spread in the chip. We show that, by simply selecting and tuning properly the surface code, thus without introducing any overhead, the probability of correcting a radiation-induced fault is increased by up to 10\%. Finally, we provide indications and guidelines for the design of future QEC codes to further increase their effectiveness against radiation-induced events.

quant-ph↗

arXiv2024

State of practice: evaluating GPU performance of state vector and tensor network methods

The frontier of quantum computing (QC) simulation on classical hardware is quickly reaching the hard scalability limits for computational feasibility. Nonetheless, there is still a need to simulate large quantum systems classically, as the Noisy Intermediate Scale Quantum (NISQ) devices are yet to be considered fault tolerant and performant enough in terms of operations per second. Each of the two main exact simulation techniques, state vector and tensor network simulators, boasts specific limitations. The exponential memory requirement of state vector simulation, when compared to the qubit register sizes of currently available quantum computers, quickly saturates the capacity of the top HPC machines currently available. Tensor network contraction approaches, which encode quantum circuits into tensor networks and then contract them over an output bit string to obtain its probability amplitude, still fall short of the inherent complexity of finding an optimal contraction path, which maps to a max-cut problem on a dense mesh, a notably NP-hard problem. This article aims at investigating the limits of current state-of-the-art simulation techniques on a test bench made of eight widely used quantum subroutines, each in 31 different configurations, with special emphasis on performance. We then correlate the performance measures of the simulators with the metrics that characterise the benchmark circuits, identifying the main reasons behind the observed performance trend. From our observations, given the structure of a quantum circuit and the number of qubits, we highlight how to select the best simulation strategy, obtaining a speedup of up to an order of magnitude.

quant-ph↗