default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFernando G. S. L. Brandão
Publications
- 2023
[j13]Mario Berta, Fernando G. S. L. Brandão, Gilad Gour, Ludovico Lami, Martin B. Plenio, Bartosz Regula
, Marco Tomamichel:
On a gap in the proof of the generalised quantum Stein's lemma and its consequences for the reversibility of quantum resources. Quantum 7: 1103 (2023)- [c10]Alexander M. Dalzell, Nicola Pancotti, Earl T. Campbell, Fernando G. S. L. Brandão:
Mind the Gap: Achieving a Super-Grover Quantum Speedup by Jumping to the End. STOC 2023: 1131-1144 - 2022
- [j12]Fernando G. S. L. Brandão, Richard Kueng, Daniel Stilck França:
Faster quantum and classical SDP approximations for quadratic binary optimization. Quantum 6: 625 (2022) - [j11]Dorit Aharonov, Michael Ben-Or, Fernando G. S. L. Brandão, Or Sattath:
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings. Quantum 6: 668 (2022) - 2021
- [c9]Daniel Stilck França, Fernando G. S. L. Brandão, Richard Kueng:
Fast and Robust Quantum State Tomography from Few Basis Measurements. TQC 2021: 7:1-7:13 - 2020
- [j10]Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements. IEEE Trans. Inf. Theory 66(8): 5037-5054 (2020) - [i16]John Napp, Rolando L. La Placa, Alexander M. Dalzell, Fernando G. S. L. Brandão, Aram W. Harrow:
Efficient classical simulation of random shallow 2D quantum circuits. CoRR abs/2001.00021 (2020) - [i15]Fernando G. S. L. Brandão, Richard Kueng, Daniel Stilck França:
Fast and robust quantum state tomography from few basis measurements. CoRR abs/2009.08216 (2020) - 2019
- [c8]Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, Xiaodi Wu:
Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning. ICALP 2019: 27:1-27:14 - [i14]Fernando G. S. L. Brandão, Richard Kueng, Daniel Stilck França:
Faster quantum and classical SDP approximations for quadratic binary optimization. CoRR abs/1909.04613 (2019) - 2018
- [i13]Mario Berta, Fernando G. S. L. Brandão, Christian Majenz, Mark M. Wilde:
Conditional Decoupling of Quantum Information. CoRR abs/1808.00135 (2018) - 2017
- [j9]Hanna Wojewódka, Fernando G. S. L. Brandão, Andrzej Grudka, Karol Horodecki, Michal Horodecki, Pawel Horodecki, Marcin Pawlowski, Ravishankar Ramanathan, Maciej Stankiewicz:
Amplifying the Randomness of Weak Sources Correlated With Devices. IEEE Trans. Inf. Theory 63(11): 7592-7611 (2017) - [c7]Fernando G. S. L. Brandão, Krysta M. Svore:
Quantum Speed-Ups for Solving Semidefinite Programs. FOCS 2017: 415-426 - [i12]Mario Berta, Fernando G. S. L. Brandão, Christoph Hirche:
On Composite Quantum Hypothesis Testing. CoRR abs/1709.07268 (2017) - [i11]Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, Xiaodi Wu:
Exponential Quantum Speed-ups for Semidefinite Programming with Applications to Quantum Learning. CoRR abs/1710.02581 (2017) - 2016
- [i10]Fernando G. S. L. Brandão, Krysta M. Svore:
Quantum Speed-ups for Semidefinite Programming. CoRR abs/1609.05537 (2016) - [i9]Mario Berta, Fernando G. S. L. Brandão, Christian Majenz, Mark M. Wilde:
Deconstruction and conditional erasure of quantum correlations. CoRR abs/1609.06994 (2016) - 2015
- [i8]Fernando G. S. L. Brandão, Toby S. Cubitt, Angelo Lucia, Spyridon Michalakis, David Pérez-García:
Area law for fixed points of rapidly mixing dissipative quantum systems. CoRR abs/1505.02776 (2015) - [i7]Fernando G. S. L. Brandão, Aram W. Harrow:
Estimating operator norms using covering nets. CoRR abs/1509.05065 (2015) - 2014
- [c6]Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements. ITCS 2014: 183-194 - 2013
- [j8]Lukasz Pankowski, Fernando G. S. L. Brandão, Michal Horodecki, Graeme Smith:
Entanglement distillation by extendible maps. Quantum Inf. Comput. 13(9-10): 751-770 (2013) - [j7]Fernando G. S. L. Brandão, Michal Horodecki:
Exponential quantum speed-ups are generic. Quantum Inf. Comput. 13(11-12): 901-924 (2013) - [j6]Fernando G. S. L. Brandão, Jonathan Oppenheim:
Public Quantum Communication and Superactivation. IEEE Trans. Inf. Theory 59(4): 2517-2526 (2013) - [j5]Mario Berta, Fernando G. S. L. Brandão, Matthias Christandl, Stephanie Wehner:
Entanglement Cost of Quantum Channels. IEEE Trans. Inf. Theory 59(10): 6779-6795 (2013) - [j4]Nilanjana Datta, Milán Mosonyi, Min-Hsiu Hsieh, Fernando G. S. L. Brandão:
A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels. IEEE Trans. Inf. Theory 59(12): 8014-8026 (2013) - [c5]Fernando G. S. L. Brandão, Aram W. Harrow:
Quantum de finetti theorems under local measurements with applications. STOC 2013: 861-870 - [c4]Fernando G. S. L. Brandão, Aram W. Harrow:
Product-state approximations to quantum ground states. STOC 2013: 871-880 - [e1]Simone Severini, Fernando G. S. L. Brandão:
8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013, May 21-23, 2013, Guelph, Canada. LIPIcs 22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-55-2 [contents] - [i6]Fernando G. S. L. Brandão, Michal Horodecki, Nelly Huei Ying Ng, Jonathan Oppenheim, Stephanie Wehner:
The second laws of quantum thermodynamics. CoRR abs/1305.5278 (2013) - [i5]Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial hypothesis testing and a quantum Stein's Lemma for restricted measurements. CoRR abs/1308.6702 (2013) - 2012
- [c3]Mario Berta, Matthias Christandl, Fernando G. S. L. Brandão, Stephanie Wehner:
Entanglement cost of quantum channels. ISIT 2012: 900-904 - [c2]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, sum-of-squares proofs, and their applications. STOC 2012: 307-326 - [i4]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, Sum-of-Squares Proofs, and their Applications. CoRR abs/1205.4484 (2012) - [i3]Fernando G. S. L. Brandão, Aram W. Harrow:
Quantum de Finetti Theorems under Local Measurements with Applications. CoRR abs/1210.6367 (2012) - 2011
- [j3]Fernando G. S. L. Brandão, Nilanjana Datta:
One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps. IEEE Trans. Inf. Theory 57(3): 1754-1760 (2011) - [c1]Fernando G. S. L. Brandão, Matthias Christandl, Jon Yard:
A quasipolynomial-time algorithm for the quantum separability problem. STOC 2011: 343-352 - 2010
- [j2]Fernando G. S. L. Brandão, Michal Horodecki:
On Hastings' Counterexamples to the Minimum Output Entropy Additivity Conjecture. Open Syst. Inf. Dyn. 17(1): 31-52 (2010) - [i2]Fernando G. S. L. Brandão, Matthias Christandl, Jon Yard:
A quasipolynomial-time algorithm for the quantum separability problem. CoRR abs/1011.2751 (2010) - 2008
- [i1]Dorit Aharonov, Michael Ben-Or, Fernando G. S. L. Brandão, Or Sattath:
The Pursuit For Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings. CoRR abs/0810.4840 (2008) - 2007
- [j1]Fernando G. S. L. Brandão, Michal Horodecki, Martin B. Plenio, Shashank Virmani:
Remarks on the Equivalence of Full Additivity and Monotonicity for the Entanglement Cost. Open Syst. Inf. Dyn. 14(3): 333-340 (2007)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
