5 papers
Reducing the Cost of Qudit State Preparation by Learning a Sparse Structure for SNAP Gates
Marco Pennazio, Leonardo Ignazio Pagliochini, Riccardo Pellini +2
Preparing quantum states in bosonic qudits with SNAP--Displacement sequences requires both optimizing the gate parameters and deciding which Fock levels should be controlled by eac…
Steering the Fidelity in State Preparation on Noisy Bosonic Systems with Risk-Seeking Optimization
Riccardo Piantoni, Riccardo Pellini, Maurizio Ferrari Dacrema +1
In order to execute quantum algorithms on bosonic quantum computers, it is necessary to encode their inputs into a desired target quantum state, with a process called state prepara…
Variance-Optimal Off-Policy Evaluation with Conjunct Effect Modeling
Nicolò Felicioni, Michael Benigni, Maurizio Ferrari Dacrema +1
Off-policy evaluation (OPE) for contextual bandit policies becomes challenging when action-level importance weighting incurs excessive variance. Doubly robust (DR) estimation remai…
Quantum Approaches to Urban Logistics: From Core QAOA to Clustered Scalability
F. Picariello, G. Turati, R. Antonelli +10
The Traveling Salesman Problem (TSP) is a fundamental challenge in combinatorial optimization, widely applied in logistics and transportation. As the size of TSP instances grows, t…
Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms
Filippo Brozzi, Gloria Turati, Maurizio Ferrari Dacrema +2
In the context of Variational Quantum Algorithms (VQAs), selecting an appropriate ansatz is crucial for efficient problem-solving. Hamiltonian expressibility has been introduced as…