SearcharxivSearch

arXiv subjects

Piero Luchi

Publications and source records attributed to Piero Luchi.

6 recordsLinked to original sources

Lie Algebra-Based Quantum Optimal Controls Interpolation

We present a framework combining Lie group theory and feed-forward neural networks to efficiently generate quantum optimal control pulses for arbitrary unitary operations in superconducting qubit systems, bypassing the need for explicit optimization at inference time. The exponential scaling of the Hilbert space dimension with qubit number makes standard optimization approaches computationally prohibitive when large ensembles of distinct propagators must be processed, a bottleneck that is particularly acute in Trotterized quantum simulation. Our method addresses this limitation by pre-computing a representative set of control pulses via Lie group theory and training neural networks to map target propagators to their corresponding pulses. We demonstrate the approach on superconducting qubit systems of 2, 3, and 4 qubits, finding high reconstruction fidelity for specific combinations of Lie algebra parameters. As a physically motivated benchmark, we apply the methodology to reconstruct control pulses for the Trotter propagators of a neutrino system undergoing collective flavor oscillations. The successful generalization across system types demonstrates that a single model -- trained once on hardware-specific random propagators -- can serve as a universal control-pulse generator for any target quantum system of compatible Hilbert space dimension, offering a promising route toward scalable quantum simulation.

quant-ph

Enhancing Qubit Readout with Autoencoders

In addition to the need for stable and precisely controllable qubits, quantum computers take advantage of good readout schemes. Superconducting qubit states can be inferred from the readout signal transmitted through a dispersively coupled resonator. This work proposes a novel readout classification method for superconducting qubits based on a neural network pre-trained with an autoencoder approach. A neural network is pre-trained with qubit readout signals as autoencoders in order to extract relevant features from the data set. Afterwards, the pre-trained network inner layer values are used to perform a classification of the inputs in a supervised manner. We demonstrate that this method can enhance classification performance, particularly for short and long time measurements where more traditional methods present lower performance.

quant-ph

Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations

It is well known that the neutrino flavor in extreme astrophysical environments changes under the effect of three contributions: the vacuum oscillation, the interaction with the surrounding matter, and the collective oscillations due to interactions between different neutrinos. The latter adds a non-linear contribution to the equations of motion, making the description of their dynamics complex. In this work we study various strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. This was achieved by using a pair-neutrino decomposition designed to account for the fact that the flavor Hamiltonian, in the presence of the neutrino-neutrino term, presents an all-to-all interaction that makes the implementation of the evolution dependent on the qubit topology. We analyze the Trotter error caused by the decomposition demonstrating that the complexity of the implementation of time evolution scales polynomially with the number of neutrinos and that the noisy from near-term quantum device simulation can be reduced by optimizing the quantum circuit decomposition and exploiting a full-qubit connectivity. We find that the gate complexity using second order Trotter-Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing. We finally present the application and the results of our algorithm on a real quantum device based on trapped-ions qubits.

quant-ph

Coarse-grained Mori-Zwanzig dynamics in a time-non-local stationary-action framework

Coarse-grained (CG) models are simplified representations of soft matter systems that are commonly employed to overcome size and time limitations in computational studies. Many approaches have been developed to construct and parametrise such effective models for a variety of systems of natural as well as artificial origin. However, while extremely accurate in reproducing the stationary and equilibrium observables obtained with more detailed representations, CG models generally fail to preserve the original time scales of the reference system, and hence its dynamical properties. In order to improve our understanding of the impact of coarse-graining on the model system dynamics, we here formulate the Mori-Zwanzig generalised Langevin equations (GLEs) of motion of a CG model in terms of a time non-local stationary-action principle. The latter is employed in combination with a data-driven optimisation strategy to determine the parameters of the GLE. We apply this approach to a system of water molecules in standard thermodynamical conditions, showing that it can substantially improve the dynamical features of the corresponding CG model.

cond-mat.stat-mech

Control optimization for parametric hamiltonians by pulse reconstruction

Optimal control techniques provide a means to tailor the control pulses required to generate customized quantum gates, which helps to improve the resilience of quantum simulations to gate errors and device noise. However, the significant amount of (classical) computation required to generate customized gates can quickly undermine the effectiveness of this approach, especially when pulse optimization needs to be iterated. We propose a method to reduce the computational time required to generate the control pulse for a Hamiltonian that is parametrically dependent on a time-varying quantity. We use simple interpolation schemes to accurately reconstruct the control pulses from a set of pulses obtained in advance for a discrete set of predetermined parameter values. We obtain a reconstruction with very high fidelity and a significant reduction in computational effort. We report the results of the application of the proposed method to device-level quantum simulations of the unitary (real) time evolution of two interacting neutrons based on superconducting qubits.

quant-ph

Imaginary Time Propagation on a Quantum Chip

Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter and nuclear physics. We propose an algorithm to implement imaginary time propagation on a quantum computer. Our algorithm is devised in the context of an efficient encoding into an optimized gate, drawing on the underlying characteristics of the quantum device, of a unitary operation in an extended Hilbert space. However, we proved that for simple problems it can be successfully applied to standard digital quantum machines. This work paves the way for porting quantum many-body methods based on imaginary-time propagation to near-term quantum devices, enabling the future quantum simulation of the ground states of a broad class of microscopic systems.

quant-ph