Fernando G. S. L. Brandão

According to our database, Fernando G. S. L. Brandão authored at least 32 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Efficient unitary designs and pseudorandom unitaries from permutations.

Chi-Fang Chen, Adam Bouland, Fernando G. S. L. Brandão, Jordan Docter, Patrick Hayden, Michelle Xu

CoRR, 2024

Efficient Unitary Designs from Random Sums and Permutations.

Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G. S. L. Brandão, Patrick Hayden

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

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

Mario Berta, Fernando G. S. L. Brandão, Gilad Gour, Ludovico Lami, Martin B. Plenio, Bartosz Regula, Marco Tomamichel

Quantum, September, 2023

Mind the Gap: Achieving a Super-Grover Quantum Speedup by Jumping to the End.

Alexander M. Dalzell, Nicola Pancotti, Earl T. Campbell, Fernando G. S. L. Brandão

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Faster quantum and classical SDP approximations for quadratic binary optimization.

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

Quantum, 2022

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

Dorit Aharonov, Michael Ben-Or, Fernando G. S. L. Brandão, Or Sattath

Quantum, 2022

2021

Fast and Robust Quantum State Tomography from Few Basis Measurements.

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

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.

Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres

IEEE Trans. Inf. Theory, 2020

Efficient classical simulation of random shallow 2D quantum circuits.

John Napp, Rolando L. La Placa, Alexander M. Dalzell, Fernando G. S. L. Brandão, Aram W. Harrow

CoRR, 2020

2019

Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning.

Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, Xiaodi Wu

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Conditional Decoupling of Quantum Information.

Mario Berta, Fernando G. S. L. Brandão, Christian Majenz, Mark M. Wilde

CoRR, 2018

2017

Amplifying the Randomness of Weak Sources Correlated With Devices.

Hanna Wojewódka, Fernando G. S. L. Brandão, Andrzej Grudka, Karol Horodecki, Michal Horodecki, Pawel Horodecki, Marcin Pawlowski, Ravishankar Ramanathan, Maciej Stankiewicz

IEEE Trans. Inf. Theory, 2017

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

Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, Xiaodi Wu

CoRR, 2017

On Composite Quantum Hypothesis Testing.

Mario Berta, Fernando G. S. L. Brandão, Christoph Hirche

CoRR, 2017

Quantum Speed-Ups for Solving Semidefinite Programs.

Fernando G. S. L. Brandão, Krysta M. Svore

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Quantum Speed-ups for Semidefinite Programming.

Fernando G. S. L. Brandão, Krysta M. Svore

CoRR, 2016

Deconstruction and conditional erasure of quantum correlations.

Mario Berta, Fernando G. S. L. Brandão, Christian Majenz, Mark M. Wilde

CoRR, 2016

2015

Estimating operator norms using covering nets.

Fernando G. S. L. Brandão, Aram W. Harrow

CoRR, 2015

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

Fernando G. S. L. Brandão, Toby S. Cubitt, Angelo Lucia, Spyridon Michalakis, David Pérez-García

CoRR, 2015

2013

A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels.

Nilanjana Datta, Milán Mosonyi, Min-Hsiu Hsieh, Fernando G. S. L. Brandão

IEEE Trans. Inf. Theory, 2013

Public Quantum Communication and Superactivation.

Fernando G. S. L. Brandão, Jonathan Oppenheim

IEEE Trans. Inf. Theory, 2013

Entanglement Cost of Quantum Channels.

Mario Berta, Fernando G. S. L. Brandão, Matthias Christandl, Stephanie Wehner

IEEE Trans. Inf. Theory, 2013

Entanglement distillation by extendible maps.

Lukasz Pankowski, Fernando G. S. L. Brandão, Michal Horodecki, Graeme Smith

Quantum Inf. Comput., 2013

Exponential quantum speed-ups are generic.

Fernando G. S. L. Brandão, Michal Horodecki

Quantum Inf. Comput., 2013

The second laws of quantum thermodynamics

Fernando G. S. L. Brandão, Michal Horodecki, Nelly Huei Ying Ng, Jonathan Oppenheim, Stephanie Wehner

CoRR, 2013

Product-state approximations to quantum ground states.

Fernando G. S. L. Brandão, Aram W. Harrow

Proceedings of the Symposium on Theory of Computing Conference, 2013

Quantum de finetti theorems under local measurements with applications.

Fernando G. S. L. Brandão, Aram W. Harrow

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Hypercontractivity, sum-of-squares proofs, and their applications.

Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps.

Fernando G. S. L. Brandão, Nilanjana Datta

IEEE Trans. Inf. Theory, 2011

A quasipolynomial-time algorithm for the quantum separability problem.

Fernando G. S. L. Brandão, Matthias Christandl, Jon Yard

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

On Hastings' Counterexamples to the Minimum Output Entropy Additivity Conjecture.

Fernando G. S. L. Brandão, Michal Horodecki

Open Syst. Inf. Dyn., 2010

2007

Remarks on the Equivalence of Full Additivity and Monotonicity for the Entanglement Cost.

Fernando G. S. L. Brandão, Michal Horodecki, Martin B. Plenio, Shashank Virmani

Open Syst. Inf. Dyn., 2007