Peter W. Shor

Publication Activity (10 Years)

Years Active: 1982-2024
Publications (10 Years): 15

Top Venues

CoRR

IEEE Trans. Inf. Theory

ISIT

ITCS

Publications

Robert Lin, Peter W. Shor
A New Class of Algorithms for Finding Short Vectors in Lattices Lifted from Co-dimension k Codes. CoRR (2024)
Dawei Ding, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang, Mark M. Wilde
Bounding the Forward Classical Capacity of Bipartite Quantum Channels. IEEE Trans. Inf. Theory 69 (5) (2023)
Dawei Ding, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang, Mark M. Wilde
Upper bound on the classical capacity of a quantum channel assisted by classical feedback. ISIT (2021)
Dawei Ding, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang, Mark M. Wilde
Bounding the forward classical capacity of bipartite quantum channels. CoRR (2020)
Dawei Ding, Yihui Quek, Peter W. Shor, Mark M. Wilde
Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback. ISIT (2019)
Dawei Ding, Yihui Quek, Peter W. Shor, Mark M. Wilde
Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback. CoRR (2019)
Seth Lloyd, Peter W. Shor, Kevin Thompson
Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel. IEEE Trans. Inf. Theory 65 (11) (2019)
Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor
Superadditivity in Trade-Off Capacities of Quantum Channels. IEEE Trans. Inf. Theory 65 (6) (2019)
Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor
Superadditivity in Trade-Off Capacities of Quantum Channels. ISIT (2018)
Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor
Superadditivity in trade-off capacities of quantum channels. CoRR (2017)
Elton Yechao Zhu, Quntao Zhuang, Peter W. Shor
Superadditivity of the classical capacity with limited entanglement assistance. CoRR (2017)
Yihui Quek, Peter W. Shor
Quantum and Super-quantum enhancements to two-sender, two-receiver channels. CoRR (2017)
Lior Eldar, Peter W. Shor
The Systematic Normal Form of Lattices. CoRR (2016)
Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng
New Constructions of Codes for Asymmetric Channels via Concatenation. IEEE Trans. Inf. Theory 61 (4) (2015)
Mohammad Bavarian, Peter W. Shor
Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH. ITCS (2015)
Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas J. Winter
The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels. IEEE Trans. Inf. Theory 60 (5) (2014)
Jordan S. Cotler, Peter W. Shor
A new relativistic orthogonal states quantum key distribution protocol. Quantum Inf. Comput. 14 (13-14) (2014)
Mohammad Bavarian, Peter W. Shor
Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH. CoRR (2013)
Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng
New Constructions of Codes for Asymmetric Channels via Concatenation. CoRR (2013)
Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor
Quantum money from knots. ITCS (2012)
Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng
New constructions of codes for asymmetric channels via concatenation. ISIT (2012)
Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor
Quantum adiabatic algorithms, small gaps, and different paths. Quantum Inf. Comput. 11 (3&4) (2011)
Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng
High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping. IEEE Trans. Inf. Theory 57 (10) (2011)
Salman Beigi, Peter W. Shor, John Watrous
Quantum Interactive Proofs with Short Messages. Theory Comput. 7 (1) (2011)
Jennifer Debroni, John D. Eblen, Michael A. Langston, Wendy J. Myrvold, Peter W. Shor, Dinesh Weerapurage
A complete resolution of the Keller maximum clique problem. SODA (2011)
Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Peter W. Shor
Unstructured randomness, small gaps and localization. Quantum Inf. Comput. 11 (9&10) (2011)
Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron D. Sterling, Suresh Venkatasubramanian
Questions answered. in theory.: http://cstheory.stackexchange.com/. SIGACT News 41 (4) (2010)
Salman Beigi, Peter W. Shor
C_3, semi-Clifford and genralized semi-Clifford operations. Quantum Inf. Comput. 10 (1&2) (2010)
Aram W. Harrow, Peter W. Shor
Time reversal and exchange symmetries of unitary gate capacities. IEEE Trans. Inf. Theory 56 (1) (2010)
Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor
Quantum money from knots CoRR (2010)
Salman Beigi, Peter W. Shor, John Watrous
Quantum interactive proofs with short messages CoRR (2010)
Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor
Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. ICS (2010)
Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas J. Winter
Quantum Reverse Shannon Theorem. CoRR (2009)
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor
The Power of Unentanglement. Theory Comput. 5 (1) (2009)
Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor
Quantum Adiabatic Algorithms, Small Gaps, and Different Paths CoRR (2009)
Markus Grassl, Peter W. Shor, Bei Zeng
Generalized concatenation for quantum codes. ISIT (2009)
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor
The Power of Unentanglement. Electron. Colloquium Comput. Complex. 15 (051) (2008)
Patrick M. Hayden, Peter W. Shor, Andreas J. Winter
Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation. Open Syst. Inf. Dyn. 15 (1) (2008)
Alan W. Leung, Peter W. Shor
Entanglement purification with two-way classical communication. Quantum Inf. Comput. 8 (3) (2008)
Andrew S. Fletcher, Peter W. Shor, Moe Z. Win
Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel. IEEE Trans. Inf. Theory 54 (12) (2008)
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor
The Power of Unentanglement. Computational Complexity Conference (2008)
Pooya Hatami, Peter W. Shor
A lower bound for the length of a partial transversal in a Latin square. J. Comb. Theory, Ser. A 115 (7) (2008)
Peter W. Shor, Stephen P. Jordan
Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Inf. Comput. 8 (8) (2008)
Patrick M. Hayden, Peter W. Shor, Andreas J. Winter
Random quantum codes from Gaussian ensembles and an uncertainty relation. CoRR (2007)
János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
On the Sum-of-Squares algorithm for bin packing. J. ACM 53 (1) (2006)
Charles H. Bennett, Patrick M. Hayden, Debbie W. Leung, Peter W. Shor, Andreas J. Winter
Remote preparation of quantum states. IEEE Trans. Inf. Theory 51 (1) (2005)
Peter W. Shor
The adaptive classical capacity of a quantum channel, or Information capacities of three symmetric pure states in three dimensions. IBM J. Res. Dev. 48 (1) (2004)
Peter W. Shor
Progress in Quantum Algorithms. Quantum Inf. Process. 3 (1-5) (2004)
Peter W. Shor
The classical capacity achievable by a quantum channel assisted by a limited entanglement. Quantum Inf. Comput. 4 (6) (2004)
David L. Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor
The Cutting-Stock Approach to Bin Packing: Theory and Experiments. ALENEX (2003)
Peter W. Shor
Why haven't more quantum algorithms been found?. J. ACM 50 (1) (2003)
Peter W. Shor
Capacities of quantum channels and how to find them. Math. Program. 97 (1-2) (2003)
Edward G. Coffman Jr., Costas Courcoubetis, Michael R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing. SIAM Rev. 44 (1) (2002)
Charles H. Bennett, Peter W. Shor, John A. Smolin, Ashish V. Thapliyal
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem. IEEE Trans. Inf. Theory 48 (10) (2002)
János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
On the Sum-of-Squares Algorithm for Bin Packing CoRR (2002)
János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
On the sum-of-squares algorithm for bin packing. STOC (2000)
Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. SIAM J. Discret. Math. 13 (3) (2000)
Bonnie Berger, Jonathan A. King, Russell Schwartz, Peter W. Shor
Local rule mechanism for selecting icosahedral shell geometry. Discret. Appl. Math. 104 (1-3) (2000)
John L. Bruno, Edward G. Coffman Jr., Jeffrey C. Lagarias, Tom J. Richardson, Peter W. Shor
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems. Math. Oper. Res. 24 (2) (1999)
Bonnie Berger, G. W. Hoest, J. R. Paulson, Peter W. Shor
On the Structure of the Scaffolding Core of Bacteriophage T4. J. Comput. Biol. 6 (1) (1999)
Peter W. Shor
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Rev. 41 (2) (1999)
János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
A Self Organizing Bin Packing Heuristic. ALENEX (1999)
A. Robert Calderbank, Eric M. Rains, Peter W. Shor, Neil J. A. Sloane
Quantum Error Correction Via Codes Over GF(4). IEEE Trans. Inf. Theory 44 (4) (1998)
Charles H. Bennett, Peter W. Shor
Quantum Information Theory. IEEE Trans. Inf. Theory 44 (6) (1998)
Bonnie Berger, Peter W. Shor
Tight Bounds for the Maximum Acyclic Subgraph Problem. J. Algorithms 25 (1) (1997)
Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber
Bin packing with discrete item sizes, part II: Tight bounds on First Fit. Random Struct. Algorithms 10 (1-2) (1997)
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
Random Debaters and the Hardness of Approximating Stochastic Functions. SIAM J. Comput. 26 (2) (1997)
Peter W. Shor
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 26 (5) (1997)
Peter W. Shor
Fault-Tolerant Quantum Computation. FOCS (1996)
Joan Feigenbaum, Daphne Koller, Peter W. Shor
A Game-Theoretic Classification of Interactive Complexity Classes. Computational Complexity Conference (1995)
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Chic. J. Theor. Comput. Sci. 1995 (1995)
Peter W. Shor
A New Proof of Cayley's Formula for Counting Labeled Trees. J. Comb. Theory, Ser. A 71 (1) (1995)
J. C. Lagarias, Peter W. Shor
and Nonlinear Codes. Discret. Comput. Geom. 11 (1994)
Peter W. Shor
Polynominal time algorithms for discrete logarithms and factoring on a quantum computer. ANTS (1994)
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
Random Debaters and the Hardness of Approximating Stochastic Functions. Computational Complexity Conference (1994)
Peter W. Shor
Algorithms for Quantum Computation: Discrete Logarithms and Factoring FOCS (1994)
Bonnie Berger, John Rompel, Peter W. Shor
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry. J. Comput. Syst. Sci. 49 (3) (1994)
Moni Naor, Alon Orlitsky, Peter W. Shor
Three results on interactive communication. IEEE Trans. Inf. Theory 39 (5) (1993)
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC (1993)
Edward G. Coffman Jr., Peter W. Shor
Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms. Algorithmica 9 (3) (1993)
Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber
Markov chains, computer proofs, and average-case analysis of best fit bin packing. STOC (1993)
Marco Pellegrini, Peter W. Shor
Finding Stabbing Lines in 3-Space. Discret. Comput. Geom. 8 (1992)
Peter W. Shor, Christopher J. Van Wyk
Detecting and Decomposing Self-overlapping Curves. Comput. Geom. 2 (1992)
Warren D. Smith, Peter W. Shor
Steiner Tree Problems. Algorithmica 7 (2&3) (1992)
Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor
The Rectilinear Steiner Arborescence Problem. Algorithmica 7 (2&3) (1992)
Julien Bramel, Edward G. Coffman Jr., Peter W. Shor, David Simchi-Levi
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Oper. Res. 40 (6) (1992)
Marco Pellegrini, Peter W. Shor
Finding Stabbing Lines in 3-Dimensional Space. SODA (1991)
Alok Aggarwal, Maria M. Klawe, Peter W. Shor
Multilayer Grid Embeddings for VLSI. Algorithmica 6 (1) (1991)
Peter W. Shor
How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing FOCS (1991)
Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study STOC (1991)
Tishya Leong, Peter W. Shor, Clifford Stein
Implementation of a Combinatorial Multicommodity Flow Algorithm. Network Flows And Matching (1991)
Edward G. Coffman Jr., Peter W. Shor
) Upright Matching Bound. SIAM J. Discret. Math. 4 (1) (1991)
Anders Björner, László Lovász, Peter W. Shor
Chip-firing Games on Graphs. Eur. J. Comb. 12 (4) (1991)
Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder
Generalized Planar Matching. J. Algorithms 11 (2) (1990)
Bonnie Berger, Peter W. Shor
Approximation Algorithms for the Maximum Acyclic Subgraph Problem. SODA (1990)
Peter W. Shor
Stretchability of Pseudolines is NP-Hard. Applied Geometry And Discrete Mathematics (1990)
Kenneth L. Clarkson, Peter W. Shor
Application of Random Sampling in Computational Geometry, II. Discret. Comput. Geom. 4 (1989)
Tom Leighton, Peter W. Shor
Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms. Comb. 9 (2) (1989)
Bonnie Berger, John Rompel, Peter W. Shor
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry FOCS (1989)
Pankaj K. Agarwal, Micha Sharir, Peter W. Shor
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. J. Comb. Theory, Ser. A 52 (2) (1989)

Peter W. Shor.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter W. Shor