 | 2011 |
|---|
| 10 |       | Salman Beigi,
Peter W. Shor,
John Watrous:
Quantum Interactive Proofs with Short Messages.
Theory of Computing 7(1): 101-117 (2011) |
| 2010 |
|---|
| 9 | | Salman Beigi:
Entanglement-assisted zero-error capacity is upper bounded by the Lovasz theta function
CoRR abs/1002.2488: (2010) |
| 8 | | Salman Beigi,
Peter W. Shor,
John Watrous:
Quantum interactive proofs with short messages
CoRR abs/1004.0411: (2010) |
| 7 | | Salman Beigi:
NP vs QMA_log(2).
Quantum Information & Computation 10(1&2): 2 (2010) |
| 6 | | Salman Beigi,
Peter W. Shor:
C_3, semi-Clifford and genralized semi-Clifford operations.
Quantum Information & Computation 10(1&2): 41-59 (2010) |
| 5 | | Salman Beigi:
A lower bound on the value of entangled binary games.
Quantum Information & Computation 10(11&12): 911-924 (2010) |
| 2009 |
|---|
| 4 | | Scott Aaronson,
Salman Beigi,
Andrew Drucker,
Bill Fefferman,
Peter W. Shor:
The Power of Unentanglement.
Theory of Computing 5(1): 1-42 (2009) |
| 2008 |
|---|
| 3 | | Scott Aaronson,
Salman Beigi,
Andrew Drucker,
Bill Fefferman,
Peter W. Shor:
The Power of Unentanglement.
IEEE Conference on Computational Complexity 2008: 223-236 |
| 2 | | Scott Aaronson,
Salman Beigi,
Andrew Drucker,
Bill Fefferman,
Peter W. Shor:
The Power of Unentanglement.
Electronic Colloquium on Computational Complexity (ECCC) 15(051): (2008) |
| 2007 |
|---|
| 1 | | Mohsen Bahramgiri,
Salman Beigi:
An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case
CoRR abs/cs/0702057: (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page