8 papers
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…
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…
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…
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…
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…
Hybrid Tree Tensor Networks for quantum simulation
Julian Schuhmacher, Marco Ballarin, Alberto Baiardi +4
Hybrid Tensor Networks (hTN) offer a promising solution for encoding variational quantum states beyond the capabilities of efficient classical methods or noisy quantum computers al…