I agree that this site is using cookies. You can find further informations here.
X
Buhrman, Harry Matthijs
65  results:
Articles (Online) X
Search for persons X
?
1

Relating non-local quantum computation to information theor..:

Allerstorfer, Rene ; Buhrman, Harry ; May, Alex..
Quantum.  8 (2024)  - p. 1387 , 2024
Link: https://doi.org/10.22331..
 
?
2

High Entropy Random Selection Protocols:

Buhrman, Harry ; Christandl, Matthias ; Koucký, Michal...
Algorithmica.  83 (2020)  2 - p. 667-694 , 2020
Link: https://doi.org/10.1007/..
 
?
3

The Interaction Light Cone of the Discrete Bak–Sneppen, Con..:

Bannink, Tom ; Buhrman, Harry ; Gilyén, András.
Journal of Statistical Physics.  176 (2019)  6 - p. 1500-1525 , 2019
Link: https://doi.org/10.1007/..
 
?
4

The quantum technologies roadmap: a European community view:

Acín, Antonio ; Bloch, Immanuel ; Buhrman, Harry...
New Journal of Physics.  20 (2018)  8 - p. 080201 , 2018
Link: https://doi.org/10.1088/..
 
?
5

Sparse Selfreducible Sets and Nonuniform Lower Bounds:

Buhrman, Harry ; Torenvliet, Leen ; Unger, Falk.
Algorithmica.  81 (2018)  1 - p. 179-200 , 2018
Link: https://doi.org/10.1007/..
 
?
6

Catalytic Space: Non-determinism and Hierarchy:

Buhrman, Harry ; Koucký, Michal ; Loff, Bruno.
Theory of Computing Systems.  62 (2017)  1 - p. 116-135 , 2017
Link: https://doi.org/10.1007/..
 
?
7

Quantum communication complexity advantage implies violatio..:

Buhrman, Harry ; Czekaj, Łukasz ; Grudka, Andrzej...
Proceedings of the National Academy of Sciences.  113 (2016)  12 - p. 3191-3196 , 2016
Link: https://doi.org/10.1073/..
 
?
8

Towards a Reverse Newman's Theorem in Interactive Informati..:

Brody, Joshua ; Buhrman, Harry ; Koucký, Michal...
Algorithmica.  76 (2016)  3 - p. 749-781 , 2016
Link: https://doi.org/10.1007/..
 
?
9

Clean Quantum and Classical Communication Protocols:

Buhrman, Harry ; Christandl, Matthias ; Perry, Christopher.
Physical Review Letters.  117 (2016)  23 - p. , 2016
Link: https://doi.org/10.1103/..
 
?
10

Quantum communication complexity advantage implies violatio..:

Buhrman, Harry ; Czekaj, Łukasz ; Grudka, Andrzej...
Proceedings of the National Academy of Sciences of the United States of America.  113 (2016)  12 - p. 3191-3196 , 2016
Link: https://www.jstor.org/st..
 
?
11

Distinguishing Two Probability Ensembles with One Sample fr..:

Antunes, Luís ; Buhrman, Harry ; Matos, Armando..
Theory of Computing Systems.  59 (2015)  3 - p. 517-531 , 2015
Link: https://doi.org/10.1007/..
 
?
12

Position-Based Quantum Cryptography: Impossibility and Cons..:

Buhrman, Harry ; Chandran, Nishanth ; Fehr, Serge...
SIAM Journal on Computing.  43 (2014)  1 - p. 150-178 , 2014
Link: https://doi.org/10.1137/..
 
?
13

Hardness of Approximation for Knapsack Problems:

Buhrman, Harry ; Loff, Bruno ; Torenvliet, Leen
Theory of Computing Systems.  56 (2014)  2 - p. 372-393 , 2014
Link: https://doi.org/10.1007/..
 
?
14

Violating the Shannon capacity of metric graphs withentangl..:

Briët, Jop ; Buhrman, Harry ; Gijswijt, Dion
Proceedings of the National Academy of Sciences of the United States of America.  110 (2013)  48 - p. 19227-19651 , 2013
Link: https://www.jstor.org/st..
 
?
15

A Realistic Model Under Which the Genetic Code is Optimal:

Buhrman, Harry ; van der Gulik, Peter T. S. ; Klau, Gunnar W....
Journal of Molecular Evolution.  77 (2013)  4 - p. 170-184 , 2013
Link: https://doi.org/10.1007/..
 
1-15