23 citations · 62 across the 7 of their papers we have counts for
13 papers
Fast convergence of propagation algorithms for open quantum systems
Giorgio Facelli, Hamza Fawzi, Omar Fawzi +3
We establish general conditions for the rapid convergence of propagation algorithms for computing expectation values of local observables in quantum many-body systems, covering bot…
Quantum Gibbs State Preparation via Relative Decoding: From Fast-Mixing Sources to Broader Target Classes
Zhong-Xia Shang, Yufei Wang, Daniel Stilck França
Provable guarantees for preparing quantum Gibbs states, such as rapid mixing or gapped coherent preparation paths, are known only for restricted Hamiltonian families and usually mu…
Improved Adaptive Estimation of Quantum Partition Functions with Heisenberg Scaling
Yufei Wang, Daniel Stilck França, Samuel Slezak
We give quantum algorithms that estimate the log partition function of an -qubit quantum Hamiltonian to additive error with Heisenberg scaling, while minimizing calls to the…
Rapid mixing of Gibbs samplers via quantum Dobrushin--Shlosman conditions
Cambyse Rouzé, Daniel Stilck França
Classical Dobrushin--Shlosman theory uses heat-bath block updates to identify sharp temperature thresholds for establishing the rapid mixing of Gibbs samplers. In particular, these…
Learning Local Fermionic Lindbladians under Parity Superselection
Tim Möbus, Daniel Stilck França, Cambyse Rouzé
Parity superselection forbids direct measurement of odd Majorana observables. We learn time-independent, parity-covariant, -mode-local Lindbladians on modes using even prepa…
From Simple Sources to Quantum Advantage: Homomorphic Polynomial Transduction via Relative Decoding
Zhong-Xia Shang, Daniel Stilck França
Decoded quantum interferometry (DQI) and its Hamiltonian extension (HDQI) prepare states whose amplitudes are low-degree polynomials of an objective, using Fourier transforms and c…
Sampling (noisy) quantum circuits through randomized rounding
Victor Martinez, Omar Fawzi, Daniel Stilck França
The present era of quantum processors with hundreds to thousands of noisy qubits has sparked interest in understanding the computational power of these devices and how to leverage…
Efficient Hamiltonian, structure and trace distance learning of Gaussian states
Marco Fanizza, Cambyse Rouzé, Daniel Stilck França
In this work, we initiate the study of Hamiltonian learning for positive temperature bosonic Gaussian states, the quantum generalization of the widely studied problem of learning G…
Efficient thermalization and universal quantum computing with quantum Gibbs samplers
Cambyse Rouzé, Daniel Stilck França, Álvaro M. Alhambra
The preparation of thermal states of matter is a crucial task in quantum simulation. In this work, we prove that a recently introduced, efficiently implementable dissipative evolut…
Information-theoretic generalization bounds for learning from quantum data
Matthias Caro, Tom Gur, Cambyse Rouzé +2
Learning tasks play an increasingly prominent role in quantum information and computation. They range from fundamental problems such as state discrimination and metrology over the…
Limitations of variational quantum algorithms: a quantum optimal transport approach
Giacomo De Palma, Milad Marvian, Cambyse Rouzé +1
The impressive progress in quantum hardware in the last years has raised the interest of the quantum computing community in harvesting the computational power of such devices. Howe…
Learning quantum many-body systems from a few copies
Cambyse Rouzé, Daniel Stilck França
Estimating physical properties of quantum states from measurements is one of the most fundamental tasks in quantum science. In this work, we identify conditions on states under whi…
The modified logarithmic Sobolev inequality for quantum spin systems: classical and commuting nearest neighbour interactions
Ángela Capel, Cambyse Rouzé, Daniel Stilck França
Given a uniform, frustration-free family of local Lindbladians defined on a quantum lattice spin system in any spatial dimension, we prove a strong exponential convergence in relat…