most citedQuantum algorithms for equational reasoning

1 citations · 1 across the 3 of their papers we have counts for

collaborators

7 papers

quant-ph2026

Generative IQP Circuit Learning with Physics-Informed Latent Initialization

Chen-Yu Liu, Leonardo Placidi, Marco Ballarin +1

Quantum generative learning based on instantaneous quantum polynomial-time (IQP) circuits can benefit from efficient classical training strategies. A recent latent adaptation frame…

quant-ph2026

Exact log-depth preparation of highly entangled matrix product states

Keisuke Murota, Frédéric Sauvage, Marco Ballarin +2

Preparing matrix product states (MPS) on a quantum device is a key subroutine in many quantum algorithms. The most competitive methods, based on the renormalisation group, prepare…

quant-ph20261 cited

Quantum algorithms for equational reasoning

Davide Rattacaso, Daniel Jaschke, Marco Ballarin +2

As a cornerstone of automated reasoning, equational reasoning finds equivalences between symbolic expressions and fuels advances across scientific disciplines. Yet, its potential r…

quant-ph2025

Quantum circuit compilation with quantum computers

Davide Rattacaso, Daniel Jaschke, Marco Ballarin +2

Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quant…

quant-ph2025

Optimal sampling of tensor networks targeting wave function's fast decaying tails

Marco Ballarin, Pietro Silvi, Simone Montangero +1

We introduce an optimal strategy to sample quantum outcomes of local measurement strings for isometric tensor network states. Our method generates samples based on an exact cumulat…

quant-ph2025

Benchmarking Quantum Red TEA on CPUs, GPUs, and TPUs

Daniel Jaschke, Marco Ballarin, Nora Reinić +2

We benchmark simulations of many-body quantum systems on heterogeneous hardware platforms using CPUs, GPUs, and TPUs. We compare different linear algebra backends, e.g., NumPy vers…