arXiv subjects

Andrea Marchesin

Publications and source records attributed to Andrea Marchesin.

5 recordsLinked to original sources

arXiv2026

A NISQ-friendly Coined Quantum Walk Algorithm for Chaos-based Cryptographic Applications

We present a novel lackadaisical alternating quantum walk (LAQW) algorithm whose circuit depth scales as $\mathcal{O}(n^2+nt)$ for a $n\times n$ lattice over $t$ time steps. We show that this is a significant depth reduction compared to the existing controlled alternating quantum walk (CAQW) model, which has a circuit depth that scales as $\mathcal{O}(n^2t)$ (Li et al., 2017, arXiv:1707.07389). This makes the implementation of the LAQW viable for Noisy Intermediate-scale Quantum (NISQ) devices. We then showcase the applicability of the LAQW algorithm by proposing a chaos-based symmetric-key generation scheme. Our approach uses the LAQW as a quantum entropy source from which reproducible random bitstring sequences are generated using the underlying probability distribution and subsequent post-processing methods. We provide a comprehensive evaluation of the LAQW algorithm and demonstrate the reproducibility of 128-bit keys under simulated quantum noise provided by IBM's FakeTorino backend. A direct comparison with the CAQW model, which has been used in image encryption and hash function schemes (Li et al., 2017, arXiv:1707.07389; Abd EL-Latif et al., 2020, ScienceDirect; Abd El-Latif, Abd El-Atty, and Venegas-Andraca, 2020, ScienceDirect), highlights the potential and usefulness of the LAQW model in cryptographic applications.

quant-ph↗

arXiv2026

Gate Freezing Method for Gradient-Free Variational Quantum Algorithms in Circuit Optimization

Parameterized quantum circuits (PQCs) are pivotal components of variational quantum algorithms (VQAs), which represent a promising pathway to quantum advantage in noisy intermediate-scale quantum (NISQ) devices. PQCs enable flexible encoding of quantum information through tunable quantum gates and have been successfully applied across domains such as quantum chemistry, combinatorial optimization, and quantum machine learning. Despite their potential, PQC performance on NISQ hardware is hindered by noise, decoherence, and the presence of barren plateaus, which can impede gradient-based optimization. To address these limitations, we propose novel methods for improving gradient-free optimizers Rotosolve, Fraxis, and FQS, incorporating information from previous parameter iterations. Our approach conserves computational resources by reallocating optimization efforts toward poorly optimized gates, leading to improved convergence. The experimental results demonstrate that our techniques consistently improve the performance of various optimizers, contributing to more robust and efficient PQC optimization.

quant-ph↗

arXiv2025

Noisy Quantum Simulation: Performance and Resource Considerations for the Tavis-Cummings and Heisenberg Models

Fault-tolerant quantum computers promise the simulation of complex quantum systems beyond the reach of classical computation. In contrast, current noisy intermediate-scale quantum (NISQ) devices are constrained by hardware noise. Consequently, quantum simulation methods remain limited in their near-term applicability. Two prominent techniques addressing these challenges are zero-noise extrapolation (ZNE) and incremental structural learning (ISL). In this work, ZNE and ISL are benchmarked for simulating the Trotterized time evolution of two models: the Tavis-Cummings model (TCM) and the Heisenberg spin chain (HSC), using a classically simulated noisy hardware backend. The methods are evaluated on the basis of the accuracy of expectation values relative to noiseless simulations and their resource demands such as circuit depths and shot counts. The impact of noise on optimization routines in ISL, previously underexplored, is also investigated. Results indicate that ISL performs more favorably in HSC systems, consistently surpassing ZNE in expectation value accuracy. Conversely, for the TCM, ISL generally yields lower accuracies despite reduced Trotter circuit depths, with weak interactions often leading to pronounced phase lags or flat expectation curves. Notably, when performing ISL optimization under noiseless conditions, the protocol is generally able to reduce dephasing errors, but average accuracies still vary on the simulated Hamiltonian. Our findings highlight the sensitivity of quantum simulation protocols to the structure of the Hamiltonian encoding system dynamics. Trends across systems suggest that ISL optimization benefits from Trotter circuits with stronger interactions, and that ansatz construction favors isotropic couplings. Moreover, although ISL introduces approximation errors, it demonstrates greater robustness than ZNE in systems with deeper Trotter circuits.

quant-ph↗

arXiv2025

Enhancing Hybrid Methods in Parameterized Quantum Circuit Optimization

Parameterized quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy intermediate-scale quantum (NISQ) devices. The PQCs are a leading candidate to achieve a quantum advantage in NISQ devices and have already been applied in various domains such as quantum chemistry, quantum machine learning, combinatorial optimization, and many others. There is no single definitive way to optimize PQCs. The most commonly used methods are based on computing the gradient via the parameter-shift rule to use classical gradient descent (GD) optimizers like Adam, stochastic GD, and others. In addition, sequential single-qubit optimizers have been proposed, such as Rotosolve, Free-Axis Selection (Fraxis), Free-Quaternion Selection (FQS), and hybrid algorithms from the aforementioned optimizers. We further develop hybrid algorithms than those represented in the previous work by drawing inspiration from the early stopping method used in classical machine learning. The switch between the optimizers depends on the previous cost function values compared to the previous ones. We introduce two new hybrid algorithms that are more robust and scalable, and they outperform previous hybrid methods in terms of convergence towards the global minima across various cost functions. In addition, we find that they are feasible for NISQ devices with different noise profiles.

quant-ph↗

arXiv2025

Evaluating Angle and Amplitude Encoding Strategies for Variational Quantum Machine Learning: their impact on model's accuracy

Recent advancements in Quantum Computing and Machine Learning have increased attention to Quantum Machine Learning (QML), which aims to develop machine learning models by exploiting the quantum computing paradigm. One of the widely used models in this area is the Variational Quantum Circuit (VQC), a hybrid model where the quantum circuit handles data inference while classical optimization adjusts the parameters of the circuit. The quantum circuit consists of an encoding layer, which loads data into the circuit, and a template circuit, known as the ansatz, responsible for processing the data. This work involves performing an analysis by considering both Amplitude- and Angle-encoding models, and examining how the type of rotational gate applied affects the classification performance of the model. This comparison is carried out by training the different models on two datasets, Wine and Diabetes, and evaluating their performance. The study demonstrates that, under identical model topologies, the difference in accuracy between the best and worst models ranges from 10% to 30%, with differences reaching up to 41%. Moreover, the results highlight how the choice of rotational gates used in encoding can significantly impact the model's classification performance. The findings confirm that the embedding represents a hyperparameter for VQC models.

cs.LG↗