collaborators

6 papers

quant-ph2026

AlphaClifford: Efficient Clifford Synthesis and Transpilation with Model-based RL

Daniele Lizzio Bosco, Jacopo Cossio, Carla Piazza +1

Clifford circuits play a foundational role in quantum computing, particularly due to their importance in quantum error correction and fault-tolerant logical synthesis. While these…

quant-ph2026

Efficiently Simulable Pauli Correlation Encoding

Daniele Lizzio Bosco, Gabriel Matos, Chen-Yu Liu +4

Pauli Correlation Encoding (PCE) is a heuristic framework for binary optimisation that encodes classical variables into many-body Pauli observables. While PCE requires fewer qubits…

cs.AI2026

AlphaCNOT: Learning CNOT Minimization with Model-Based Planning

Jacopo Cossio, Daniele Lizzio Bosco, Riccardo Romanello +2

Quantum circuit optimization is a central task in Quantum Computing, as current Noisy Intermediate Scale Quantum devices suffer from error propagation that often scales with the nu…

quant-ph2026

Quantum Circuit Pre-Synthesis: Learning Local Edits to Reduce -count

Daniele Lizzio Bosco, Lukasz Cincio, Giuseppe Serra +1

Compiling quantum circuits into Clifford+ gates is a central task for fault-tolerant quantum computing using stabilizer codes. In the near term, gates will dominate the cost…

cs.AI2025

CNOT Minimal Circuit Synthesis: A Reinforcement Learning Approach

Riccardo Romanello, Daniele Lizzio Bosco, Jacopo Cossio +4

CNOT gates are fundamental to quantum computing, as they facilitate entanglement, a crucial resource for quantum algorithms. Certain classes of quantum circuits are constructed exc…

quant-ph2025

Securities Transaction Settlement Optimization on superconducting quantum devices

Francesco Martini, Daniele Lizzio Bosco, Carlo Barbanera +7

We describe a quantum variational algorithm for securities transactions settlement optimization, based on a novel mathematical formalization of the problem that includes the most r…