Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Falk Unger
Observed names:
F. Unger,
Falk Peter Unger,
Unger, F.P.,
Unger, Falk
Institution:
Centrum Wiskunde & Informatica
Observed institutions:
Centrum Wiskunde & Informatica,
University of California, Berkeley
OpenAlex ID:
A5067553771
Classical command of quantum systems
2013
·
Ben W. Reichardt
, Falk Unger
, et al.
·
Nature
·
491
PDF
Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
2006
·
Gilles Brassard
, Harry Buhrman
, et al.
·
Physical Review Letters
·
477
PDF
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
2008
·
Richard Cleve
, William Slofstra
, et al.
·
Computational Complexity
·
138
PDF
A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games
2012
·
Reichardt, Ben W.
, Unger, Falk
, et al.
·
arXiv (Cornell University)
·
87
PDF
A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games
2013
·
Ben W. Reichardt
, Falk Unger
, et al.
·
Conference on Innovations in Theoretical Computer Science
·
83
New Limits on Fault-Tolerant Quantum Computation
2006
·
Harry Buhrman
, Richard Cleve
, et al.
·
Annual Symposium on Foundations of Computer Science
·
75
PDF
Implications of superstrong non-locality for cryptography
2006
·
Harry Buhrman
, Matthias Christandl
, et al.
·
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
·
69
PDF
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
2007
·
Richard Cleve
, William Slofstra
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
37
A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems
2009
·
Falk Unger
·
Annual Symposium on Foundations of Computer Science
·
24
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
2008
·
Julia Kempe
, Oded Regev
, et al.
·
Lecture notes in computer science
·
22
Upper bounds on the noise threshold for fault-tolerant quantum computing
2010
·
J. Kempe
, O. Regev
, et al.
·
Quantum Information and Computation
·
20
PDF
Noisy Interactive Quantum Communication
2014
·
Gilles Brassard
, Ashwin Nayak
, et al.
·
Annual Symposium on Foundations of Computer Science
·
18
Noise Threshold for Universality of Two-Input Gates
2008
·
F. Unger
·
IEEE Transactions on Information Theory
·
16
Noisy Interactive Quantum Communication
2019
·
Gilles Brassard
, Ashwin Nayak
, et al.
·
SIAM Journal on Computing
·
10
PDF
Noise threshold for universality of 2-input gates
2007
·
Falk Unger
·
IEEE International Symposium on Information Theory (ISIT)
·
5
PDF
Better gates can make fault-tolerant computation impossible.
2010
·
Falk Unger
·
Electronic colloquium on computational complexity
·
4
Noise in quantum and classical computation & non-locality
2008
·
Falk Unger
·
UvA-DARE (University of Amsterdam)
·
1
PDF
On Small Hard Leaf Languages
2005
·
Falk Unger
·
Lecture notes in computer science
·
1
Sparse Selfreducible Sets and Nonuniform Lower Bounds
2018
·
Harry Buhrman
, Leen Torenvliet
, et al.
·
Algorithmica
PDF
Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds
2006
·
Harry Buhrman
, Leen Torenvliet
, et al.
·
Lecture notes in computer science
On Small Hard Leaf Languages
2006
·
Falk Unger
·
UvA-DARE (University of Amsterdam)
Show more works
View as search
Works count:
27
Citation count:
1,579
H-index:
13
I10-index:
14
Year
Topic
Type