Fernando G. S. L. Brandão

According to our database1, Fernando G. S. L. Brandão authored at least 30 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On a gap in the proof of the generalised quantum Stein's lemma and its consequences for the reversibility of quantum resources.
Quantum, September, 2023

Mind the Gap: Achieving a Super-Grover Quantum Speedup by Jumping to the End.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Faster quantum and classical SDP approximations for quadratic binary optimization.
Quantum, 2022

The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings.
Quantum, 2022

2021
Fast and Robust Quantum State Tomography from Few Basis Measurements.
Proceedings of the 16th Conference on the Theory of Quantum Computation, 2021

2020
Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements.
IEEE Trans. Inf. Theory, 2020

Efficient classical simulation of random shallow 2D quantum circuits.
CoRR, 2020

2019
Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Conditional Decoupling of Quantum Information.
CoRR, 2018

2017
Amplifying the Randomness of Weak Sources Correlated With Devices.
IEEE Trans. Inf. Theory, 2017

Exponential Quantum Speed-ups for Semidefinite Programming with Applications to Quantum Learning.
CoRR, 2017

On Composite Quantum Hypothesis Testing.
CoRR, 2017

Quantum Speed-Ups for Solving Semidefinite Programs.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Quantum Speed-ups for Semidefinite Programming.
CoRR, 2016

Deconstruction and conditional erasure of quantum correlations.
CoRR, 2016

2015
Estimating operator norms using covering nets.
CoRR, 2015

Area law for fixed points of rapidly mixing dissipative quantum systems.
CoRR, 2015

2013
A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels.
IEEE Trans. Inf. Theory, 2013

Public Quantum Communication and Superactivation.
IEEE Trans. Inf. Theory, 2013

Entanglement Cost of Quantum Channels.
IEEE Trans. Inf. Theory, 2013

Entanglement distillation by extendible maps.
Quantum Inf. Comput., 2013

Exponential quantum speed-ups are generic.
Quantum Inf. Comput., 2013

The second laws of quantum thermodynamics
CoRR, 2013

Product-state approximations to quantum ground states.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Quantum de finetti theorems under local measurements with applications.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
Hypercontractivity, sum-of-squares proofs, and their applications.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011
One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps.
IEEE Trans. Inf. Theory, 2011

A quasipolynomial-time algorithm for the quantum separability problem.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
On Hastings' Counterexamples to the Minimum Output Entropy Additivity Conjecture.
Open Syst. Inf. Dyn., 2010

2007
Remarks on the Equivalence of Full Additivity and Monotonicity for the Entanglement Cost.
Open Syst. Inf. Dyn., 2007


  Loading...