arXiv subjects

Francesco Preti

Publications and source records attributed to Francesco Preti.

7 recordsLinked to original sources

arXiv2025

Gradients, parallelism, and variance of quantum estimates

Computation of observables and their gradients on near-term quantum hardware is a central aspect of any quantum algorithm. In this work, we first review standard approaches to the estimation of observables with and without quantum amplitude estimation for both cost functions and gradients, discuss sampling problems, and analyze variance propagation on quantum circuits with and without Linear Combination of Unitaries (LCU). Afterwards, we systematically analyze the standard approaches to gradient computation with LCU circuits. Finally, we develop a LCU gradient framework for the most general gradients based on n-qubit gates and for time-dependent quantum control gradient, analyze the convergence behaviour of the circuit estimators, and provide detailed circuit representations of both for near-term and fault-tolerant hardware.

quant-ph↗

arXiv2025

Real-time adaptive quantum error correction by model-free multi-agent learning

Quantum error correction (QEC) is essential for scalable quantum computing, yet existing approaches rely on static assumptions about noise that break down in realistic hardware, where error channels drift over time. We introduce a unified framework that separates QEC into two learning timescales: offline code discovery and online adaptation. Offline, Multi-Agent Reinforcement Learning (MARL) autonomously discovers complete QEC cycles as explicit quantum circuits, with separate agents responsible for encoding, syndrome extraction, and error recovery, and without prescribing a code family or circuit ansatz. Online, a lightweight adaptive layer, termed Bandit Retraining for Adaptive Variational Error Correction (BRAVE), continuously retunes a low-dimensional variational parameterization without retraining the full MARL stack. This yields a "discover once, adapt continuously" strategy that combines the flexibility of learned codes with real-time adaptation to non-stationary noise. At sufficiently high sampling rates relative to the noise drift, our method reduces logical infidelity by roughly 18-fold for qubit codes and 3-fold for qutrit codes compared to static error correction, while substantially extending robustness to noise fluctuations. These results establish a paradigm in which QEC is no longer static but is dynamically optimized for realistic quantum hardware.

quant-ph↗

arXiv2025

Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning

Shortening quantum circuits is crucial to reducing the destructive effect of environmental decoherence and enabling useful algorithms. Here, we demonstrate an improvement in such compilation tasks via a combination of using hybrid discrete-continuous optimization across a continuous gate set, and architecture-tailored implementation. The continuous parameters are discovered with a gradient-based optimization algorithm, while in tandem the optimal gate orderings are learned via a deep reinforcement learning algorithm, based on projective simulation. To test this approach, we introduce a framework to simulate collective gates in trapped-ion systems efficiently on a classical device. The algorithm proves able to significantly reduce the size of relevant quantum circuits for trapped-ion computing. Furthermore, we show that our framework can also be applied to an experimental setup whose goal is to reproduce an unknown unitary process.

quant-ph↗

arXiv2024

Statistical evaluation and optimization of entanglement purification protocols

Quantitative characterization of two-qubit entanglement purification protocols is introduced. Our approach is based on the concurrence and the hit-and-run algorithm applied to the convex set of all two-qubit states. We demonstrate that pioneering protocols are unable to improve the estimated initial average concurrence of almost uniformly sampled density matrices, however, as it is known, they still generate pairs of qubits in a state that is close to a Bell state. We also develop a more efficient protocol and investigate it numerically together with a recent proposal based on an entangling rank-$2$ projector. Furthermore, we present a class of variational purification protocols with continuous parameters and optimize their output concurrence. These optimized algorithms turn out to surpass former proposals and our protocol by means of not wasting too many entangled states.

quant-ph↗

arXiv2024

Optimal two-qubit gates in recurrence protocols of entanglement purification

We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates average concurrences where the probabilistic occurrence of mixed entangled states is also taken into account. We show for certain families of states that optimal protocols are not necessarily achieved by bilaterally applied controlled-NOT gates. As we discover several optimal solutions, the proposed method offers some flexibility in experimental implementations of entanglement purification protocols and interesting perspectives in quantum information processing.

quant-ph↗

arXiv2024

Exponentiation of Parametric Hamiltonians via Unitary interpolation

The effort to generate matrix exponentials and associated differentials, required to determine the time evolution of quantum systems, frequently constrains the evaluation of problems in quantum control theory, variational circuit compilation, or Monte-Carlo sampling. We introduce two ideas for the time-efficient approximation of matrix exponentials of linear multi-parametric Hamiltonians. We modify the Suzuki-Trotter product formula from an approximation to an interpolation schemes to improve both accuracy and computational time. This allows us to achieve high fidelities within a single interpolation step, which can be computed directly from cached matrices. We furthermore define the interpolation on a grid of system parameters, and show that the infidelity of the interpolation converges with $4^\mathrm{th}$ order in the number of interpolation bins.

quant-ph↗

arXiv2022

Continuous quantum gate sets and pulse class meta-optimization

Reducing the circuit depth of quantum circuits is a crucial bottleneck to enabling quantum technology. This depth is inversely proportional to the number of available quantum gates that have been synthesised. Moreover, quantum gate synthesis and control problems exhibit a vast range of external parameter dependencies, both physical and application-specific. In this article we address the possibility of learning families of optimal control pulses which depend adaptively on various parameters, in order to obtain a global optimal mapping from the space of potential parameter values to the control space, and hence continuous classes of gates. Our proposed method is tested on different experimentally relevant quantum gates and proves capable of producing high-fidelity pulses even in presence of multiple variable or uncertain parameters with wide ranges.

quant-ph↗