activity
20152025
most citedRelative Entropy Convergence for Depolarizing Channels

48 citations · 227 across the 16 of their papers we have counts for

collaborators

17 papers

quant-ph2025

Bounded-Error Quantum Simulation via Hamiltonian and Lindbladian Learning

Tristan Kraft, Manoj K. Joshi, William Lam +11

Analog Quantum Simulators offer a route to exploring strongly correlated many-body dynamics beyond classical computation, but their predictive power remains limited by the absence…

quant-ph2023★ 4 cited

Going Beyond Gadgets: The Importance of Scalability for Analogue Quantum Simulators

Dylan Harley, Ishaun Datta, Frederik Ravn Klausen +4

Quantum hardware has the potential to efficiently solve computationally difficult problems in physics and chemistry to reap enormous practical rewards. Analogue quantum simulation…

quant-ph2023★ 6 cited

Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers

Guoming Wang, Daniel Stilck França, Gumaro Rendon +1

A major thrust in quantum algorithm development over the past decade has been the search for the quantum algorithms that will deliver practical quantum advantage first. Today's qua…

quant-ph2023★ 4 cited

Lower Bounds on Learning Pauli Channels with Individual Measurements

Omar Fawzi, Aadil Oufkir, Daniel Stilck França

Understanding the noise affecting a quantum device is of fundamental importance for scaling quantum technologies. A particularly important class of noise models is that of Pauli ch…

quant-ph2022★ 4 cited

Quantum Differential Privacy: An Information Theory Perspective

Christoph Hirche, Cambyse Rouzé, Daniel Stilck França

Differential privacy has been an exceptionally successful concept when it comes to providing provable security guarantees for classical computations. More recently, the concept was…

quant-ph2020★ 8 cited

A game of quantum advantage: linking verification and simulation

Daniel Stilck França, Raul Garcia-Patron

We present a formalism that captures the process of proving quantum superiority to skeptics as an interactive game between two agents, supervised by a referee. Bob, is sampling fro…

quant-ph2020★ 29 cited

On contraction coefficients, partial orders and approximation of capacities for quantum channels

Christoph Hirche, Cambyse Rouzé, Daniel Stilck França

The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrea…

quant-ph2020★ 8 cited

Fast and robust quantum state tomography from few basis measurements

Fernando G. S. L. Brandão, Richard Kueng, Daniel Stilck França

Quantum state tomography is a powerful, but resource-intensive, general solution for numerous quantum information processing tasks. This motivates the design of robust tomography p…

quant-ph2020★ 8 cited

Efficient classical simulation and benchmarking of quantum processes in the Weyl basis

Daniel Stilck França, Sergii Strelchuk, Michał Studziński

One of the crucial steps in building a scalable quantum computer is to identify the noise sources which lead to errors in the process of quantum evolution. Different implementation…

quant-ph2020★ 16 cited

Optimization at the boundary of the tensor network variety

Matthias Christandl, Fulvio Gesmundo, Daniel Stilck Franca +1

Tensor network states form a variational ansatz class widely used, both analytically and numerically, in the study of quantum many-body systems. It is known that if the underlying…

cs.DS2019★ 30 cited

Faster quantum and classical SDP approximations for quadratic binary optimization

Fernando G. S L. Brandão, Richard Kueng, Daniel Stilck França

We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization. This class of relaxations for combinatorial optimization…

quant-ph2019

Group transference techniques for the estimation of the decoherence times and capacities of quantum Markov semigroups

Ivan Bardet, Marius Junge, Nicholas LaRacuente +2

Capacities of quantum channels and decoherence times both quantify the extent to which quantum information can withstand degradation by interactions with its environment. However,…

math.OC2017★ 11 cited

Dimensionality reduction of SDPs through sketching

Andreas Bluhm, Daniel Stilck Franca

We show how to sketch semidefinite programs (SDPs) using positive maps in order to reduce their dimension. More precisely, we use Johnson\hyp{}Lindenstrauss transforms to produce a…

quant-ph2017★ 3 cited

Perfect Sampling for Quantum Gibbs States

Daniel Stilck França

We show how to obtain perfect samples from a quantum Gibbs state on a quantum computer. To do so, we adapt one of the `Coupling from the Past'-algorithms proposed by Propp and Wils…

quant-ph2016★ 20 cited

Sandwiched Rényi Convergence for Quantum Evolutions

Alexander Müller-Hermes, Daniel Stilck Franca

We study the speed of convergence of a primitive quantum time evolution towards its fixed point in the distance of sandwiched Rényi divergences. For each of these distance measures…

quant-ph2015★ 48 cited

Relative Entropy Convergence for Depolarizing Channels

Alexander Müller-Hermes, Daniel Stilck Franca, Michael M. Wolf

We study the convergence of states under continuous-time depolarizing channels with full rank fixed points in terms of the relative entropy. The optimal exponent of an upper bound…

quant-ph2015★ 28 cited

Entropy Production of Doubly Stochastic Quantum Channels

Alexander Müller-Hermes, Daniel Stilck Franca, Michael M. Wolf

We study the entropy increase of quantum systems evolving under primitive, doubly stochastic Markovian noise and thus converging to the maximally mixed state. This entropy increase…