Stack Exchange

Martin Schwarz

Vienna, Austria

http://martinschwarz.wordpress.com

Quantum computer scientist

Computer science (MSc, Kopetz group, TU Vienna)
Quantum physics (PhD, Verstraete group, Uni Vienna)

top accounts reputation activity subscriptions
Top Questions
Top Answers
30
If P = NP were true, would quantum computers be useful?
cstheory.stackexchange.com

26
Gröbner bases in TCS?
cstheory.stackexchange.com

26
Quantum matrix multiplication?
cstheory.stackexchange.com

22
Fast Reduction from RSA to SAT
cstheory.stackexchange.com

22
What are the recent TCS books whose drafts are available online?
cstheory.stackexchange.com

17
Computation beyond unitary matrices
cstheory.stackexchange.com

17
Graph Isomorphism and hidden subgroups
cstheory.stackexchange.com

16
Casual tours around proofs
cstheory.stackexchange.com

15
Kolmogorov complexity applications in computational complexity
cstheory.stackexchange.com

14
Restricting entries of unitary operators to real numbers and universal gate sets
cstheory.stackexchange.com

13
What are the recent TCS books whose drafts are available online?
cstheory.stackexchange.com

12
Problems with big open complexity gaps
cstheory.stackexchange.com

11
Casual tours around proofs
cstheory.stackexchange.com

11
A question to the #P-complete proof of the permanent from Ben-Dor/Halevi
cstheory.stackexchange.com

10
Reductions of hard problems to physical models
cstheory.stackexchange.com

10
What progress has been made to prove whether or not p=np?
cstheory.stackexchange.com

10
Processor failures in distributed computing that are not crash or Byzantine
cstheory.stackexchange.com

10
Are there any cases where quantum has given insight for classical algorithms?
cstheory.stackexchange.com

9
The complexity of sampling (approximately) the Fourier transform of a Boolean function
cstheory.stackexchange.com

9
Physics results in TCS?
cstheory.stackexchange.com

9
Philosophers friendly TCS theorem
cstheory.stackexchange.com

9
Are there works on "quantum parametrized complexity"?
cstheory.stackexchange.com

8
Complexity class of phase information in Gauss sum
cstheory.stackexchange.com

8
What is the quantum computational model?
cstheory.stackexchange.com

8
Evidence that there is some problem in BQP distinct from BPP?
cstheory.stackexchange.com

7
Computational complexity in quantitative finance
cstheory.stackexchange.com

7
Bounds on the smaller eigenvalues of the adjacency matrix of a graph
cstheory.stackexchange.com

6
Are there any natural hard problems where it is required that the number of solutions are always more than one?
cstheory.stackexchange.com

6
How to calculate the cost of factoring a large integer?
cstheory.stackexchange.com

6
Why must QMA complete problems be promise problems?
cstheory.stackexchange.com

1 2