MBMarco Ballarin

Marco Ballarin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Marco Ballarin has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Trainable, self-verifying variational quantum eigensolver using adiabatic warm starts

    by Bojan Žunkovič, Marco Ballarin, Lewis Wright, Michael Lubasch

    We study an adiabatic variant of the variational quantum eigensolver (VQE) in which VQE is performed iteratively for a sequence of Hamiltonians along an adiabatic path. We derive the conditions under which gradient-based optimization successfully prepares the adiabatic ground states. These conditions define a trainable tracking region. Additionally, when combined with a gap lower bound, energy-standard-deviation measurements certify eigenstate accuracy at run-time and verify convergence to the global optimum.

  • Open Access

    Scalable, self-verifying variational quantum eigensolver using adiabatic warm starts

    by Bojan Žunkovič, Marco Ballarin, Lewis Wright, Michael Lubasch

    We study an adiabatic variant of the variational quantum eigensolver (VQE) in which VQE is performed iteratively for a sequence of Hamiltonians along an adiabatic path. We derive the conditions under which gradient-based optimization successfully prepares the adiabatic ground states. These conditions show that the barren plateau problem and local optima can be avoided. Additionally, we propose using energy-standard-deviation measurements at runtime to certify eigenstate accuracy and verify convergence to the global optimum.

  • Open Access

    Efficient quantum state preparation of multivariate functions using tensor networks

    by Marco Ballarin, Juan José García-Ripoll, David Hayes, Michael Lubasch

    For the preparation of high-dimensional functions on quantum computers, we introduce tensor network algorithms that are efficient with regard to dimensionality, optimize circuits composed of hardware-native gates and take gate errors into account during the optimization. To avoid the notorious barren plateau problem of vanishing gradients in the circuit optimization, we smoothly transform the circuit from an easy-to-prepare initial function into the desired target function. We show that paradigmatic multivariate functions can be accurately prepared such as, by numerical simulations, a 17-dimensional Gaussian encoded in the state of 102 qubits and, through experiments, a 9-dimensional Gaussian realized using 54 qubits on Quantinuum's H2 quantum processor.

  • Open Access

    Quantum circuit compilation with quantum computers

    by Davide Rattacaso, Daniel Jaschke, Marco Ballarin, Ilaria Siloi, Simone Montangero

    Compilation optimizes quantum algorithms’ performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers, paving the way for a quantum advantage in compilation. We demonstrate the effectiveness of this approach via quantum and simulated annealing-based compilation: We successfully compile a Trotterized Hamiltonian simulation with up to 64 qubits and 64 time steps and a quantum Fourier transform with up to 40 qubits and 771 time steps. We show that, for a translationally invariant circuit, the compilation results in a fidelity gain that grows extensively in the size of the input circuit, outperforming any local or quasilocal compilation approach.


  • Open Access

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

    by Marco Ballarin, Pietro Silvi, Simone Montangero, Daniel Jaschke

    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 cumulative bounding function, without prior knowledge, in the minimal amount of tensor network contractions. The algorithm avoids sample repetition and, thus, is efficient at sampling distribution with exponentially decaying tails. We illustrate the computational advantage provided by our optimal sampling method through various numerical examples, involving condensed matter, optimization problems, and quantum circuit scenarios. Theory predicts up to an exponential speedup reducing the scaling for sampling the space up to an accumulated unknown probability ϵ from O(ϵ−1) to O(log⁡(ϵ−1)) for a decaying probability distribution. We confirm this in practice with over one order of magnitude speedup or multiple orders improvement in the error depending on the application. Our sampling strategy extends beyond local observables, e.g., to quantum magic.


  • Top Cited Papers
    Open Access

    Hybrid Tree Tensor Networks for Quantum Simulation

    by Julian Schuhmacher, Marco Ballarin, Alberto Baiardi, Giuseppe Magnifico, Francesco Tacchino, Simone Montangero, Ivano Tavernelli

    Hybrid tensor networks (hTNs) offer a promising solution for encoding variational quantum states beyond the capabilities of efficient classical methods or noisy quantum computers alone. However, their practical usefulness and many operational aspects of hTN-based algorithms, like the optimization of hTNs, the generalization of standard contraction rules to an hybrid setting, and the design of application-oriented architectures have not been thoroughly investigated yet. In this work, we introduce a novel algorithm to perform ground-state optimizations with hybrid tree tensor networks (hTTNs), discussing its advantages and roadblocks, and identifying a set of promising applications. We benchmark our approach on two paradigmatic models, namely the Ising model at the critical point and the Toric-code Hamiltonian. In both cases, we successfully demonstrate that hTTNs can improve upon classical equivalents with equal bond dimension in the classical part.