Peter Shor
#886
Most Influential Person Now
American professor of applied mathematics at MIT
Peter Shor's AcademicInfluence.com Rankings
Peter Shormathematics Degrees
Mathematics
#340
World Rank
#719
Historical Rank
#163
USA Rank
Applied Mathematics
#11
World Rank
#12
Historical Rank
#7
USA Rank
Measure Theory
#367
World Rank
#544
Historical Rank
#158
USA Rank
Download Badge
Mathematics
Why Is Peter Shor Influential?
(Suggest an Edit or Addition)According to Wikipedia, Peter Williston Shor is an American professor of applied mathematics at MIT. He is known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.
Peter Shor's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1995) (8769)
- Algorithms for quantum computation: discrete logarithms and factoring (1994) (6647)
- Quantum error correction via codes over GF(4) (1996) (1546)
- Applications of random sampling in computational geometry, II (1988) (1118)
- Quantum nonlocality without entanglement (1998) (813)
- Remote state preparation. (2000) (734)
- Quantum Error Correction and Orthogonal Geometry (1996) (677)
- Unextendible product bases and bound entanglement (1998) (567)
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem (2001) (558)
- Entanglement-Assisted Classical Capacity of Noisy Quantum Channels (1999) (482)
- Geometric applications of a matrix-searching algorithm (1987) (418)
- Algorithms for Quantum Computation: Discrete Log and Factoring (Extended Abstract) (1994) (411)
- Fault-tolerant quantum computation (1996) (391)
- The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information (2003) (373)
- A linear-time algorithm for computing the voronoi diagram of a convex polygon (1989) (328)
- Randomizing Quantum States: Constructions and Applications (2003) (326)
- Chip-firing Games on Graphs (1991) (312)
- Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement (1999) (298)
- Quantum Information Theory (1998) (256)
- QUANTUM-CHANNEL CAPACITY OF VERY NOISY CHANNELS (1997) (247)
- Oblivious remote state preparation. (2002) (247)
- Erratum: Remote State Preparation [Phys. Rev. Lett. 87, 077902 (2001)] (2002) (233)
- Additivity of the classical capacity of entanglement-breaking quantum channels (2002) (227)
- Equivalence of Additivity Questions in Quantum Information Theory (2003) (227)
- Random Domino Tilings and the Arctic Circle Theorem (1998) (220)
- Quantum Computers, Factoring, and Decoherence (1995) (216)
- Stretchability of Pseudolines is NP-Hard (1990) (206)
- Local rule-based theory of virus shell assembly. (1994) (201)
- Quantum Error Correction Via Codes Over GF (1998) (187)
- The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels (2014) (175)
- Evidence for bound entangled states with negative partial transpose (1999) (173)
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (2015) (169)
- Local rules simulation of the kinetics of virus capsid self-assembly. (1998) (167)
- Remote preparation of quantum states (2003) (158)
- The Quantum Double Model with Boundary: Condensations and Symmetries (2010) (143)
- Efficient NC algorithms for set cover with applications to learning and geometry (1989) (127)
- Error Correcting Codes For Adiabatic Quantum Computation (2005) (123)
- Keller’s cube-tiling conjecture is false in high dimensions (1992) (117)
- The average-case analysis of some on-line algorithms for bin packing (1984) (116)
- Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms (1986) (115)
- Polynominal time algorithms for discrete logarithms and factoring on a quantum computer (1994) (109)
- Quantum Analog of the MacWilliams Identities for Classical Coding Theory (1997) (103)
- Approximation alogorithms for the maximum acyclic subgraph problem (1990) (100)
- Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome (1996) (100)
- Geometric Applications of a Matrix Searching Algorithm (1986) (99)
- Estimating Jones polynomials is a complete problem for one clean qubit (2007) (98)
- Quantum money from knots (2010) (97)
- A nonadditive quantum code (1997) (95)
- Criticality without frustration for quantum spin-1 chains. (2012) (93)
- A Group-Theoretic Framework for the Construction of Packings in Grassmannian Spaces (1999) (92)
- Different Strategies for Optimization Using the Quantum Adiabatic Algorithm (2014) (91)
- Nonadditivity of bipartite distillable entanglement follows from a conjecture on bound entangled Werner states. (2000) (89)
- Equivalence of Additivity Questions in Quantum Information Theory (2004) (88)
- A lower bound for the length of a partial transversal in a Latin square (2008) (88)
- Why haven't more quantum algorithms been found? (2003) (87)
- Supercritical entanglement in local systems: Counterexample to the area law for quantum matter (2016) (86)
- The rectilinear steiner arborescence problem (1992) (86)
- Quantum adiabatic algorithms, small gaps, and different paths (2009) (82)
- Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel (2007) (82)
- Superactivation of bound entanglement. (2000) (81)
- Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs (2012) (81)
- Average-case analysis of cutting and packing in two dimensions (1990) (78)
- The Power of Unentanglement (2008) (76)
- Optimum quantum error recovery using semidefinite programming (2006) (76)
- Random debaters and the hardness of approximating stochastic functions (1994) (74)
- Disks, balls, and walls: analysis of a combinatorial game (1989) (70)
- On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels (2007) (68)
- Minimax Grid Matching and Empirical Measures (1991) (67)
- Bit-commitment-based quantum coin flipping (2002) (65)
- A New Proof of Cayley's Formula for Counting Labeled Trees (1995) (62)
- INTRODUCTION TO QUANTUM ALGORITHMS (2000) (61)
- Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental (1988) (59)
- Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (1993) (59)
- Capacities of quantum channels and how to find them (2003) (58)
- Quantum Reverse Shannon Theorem (2009) (58)
- On the Sum-of-Squares algorithm for bin packing (2002) (57)
- Resource theory of non-Gaussian operations (2018) (56)
- On the pagenumber of planar graphs (1984) (54)
- Generalized Planar Matching (1990) (53)
- Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol (2009) (51)
- Entanglement assisted capacity of the broadband Lossy channel. (2003) (51)
- Implementation of a Combinatorial Multicommodity Flow Algorithm (1991) (50)
- The classical capacity achievable by a quantum channel assisted by a limited entanglement (2004) (49)
- Progress in Quantum Algorithms (2004) (48)
- A game-theoretic classification of interactive complexity classes (1995) (47)
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings (2000) (47)
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands (1992) (47)
- Markov chains, computer proofs, and average-case analysis of best fit bin packing (1993) (46)
- Broadband channel capacities (2003) (46)
- Structured near-optimal channel-adapted quantum error correction (2007) (43)
- Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study (1991) (43)
- A Family of Optimal Packings in Grassmannian Manifolds (1998) (42)
- Multilayer grid embeddings for VLSI (1991) (41)
- Quantum transverse-field Ising model on an infinite tree from matrix product states (2007) (41)
- How to pack better than best fit: tight bounds for average-case online bin packing (1991) (39)
- A Self Organizing Bin Packing Heuristic (1999) (39)
- Power law violation of the area law in quantum spin chains (2014) (38)
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (1989) (36)
- Inequalities and separations among assisted capacities of quantum channels. (2004) (35)
- Random quantum codes from Gaussian ensembles and an uncertainty relation (2007) (34)
- Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions (1995) (34)
- The adaptive classical capacity of a quantum channel, or Information capacities of three symmetric pure states in three dimensions (2002) (34)
- Tight Bounds for the Maximum Acyclic Subgraph Problem (1997) (32)
- Three results on interactive communication (1993) (31)
- High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping (2009) (30)
- A Counterexample to the Triangle Conjecture (1985) (29)
- Bin packing with discrete item sizes, part II: Tight bounds on First Fit (1997) (29)
- Quantum state restoration and single-copy tomography for ground states of Hamiltonians. (2009) (29)
- Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing (2002) (28)
- Graph concatenation for quantum codes (2009) (28)
- Separation of Out-Of-Time-Ordered Correlation and Entanglement (2019) (28)
- A complete resolution of the Keller maximum clique problem (2011) (28)
- Time independent universal computing with spin chains: quantum plinko machine (2015) (27)
- Generalized concatenated quantum codes (2009) (27)
- A Linear time algorithm for computing the Voronoi diagram of a convex polygon (1987) (27)
- Approximating the set of separable states using the positive partial transpose test (2009) (26)
- Detecting and decomposing self-overlapping curves (1989) (25)
- Unfrustrated qudit chains and their ground states (2010) (24)
- On the sum-of-squares algorithm for bin packing (2000) (23)
- Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement. (2016) (23)
- The Cutting-Stock Approach to Bin Packing: Theory and Experiments (2003) (22)
- Local rule mechanism for selecting icosahedral shell geometry (2000) (21)
- Packings in two dimensions: Asymptotic average-case analysis of algorithms (1993) (20)
- Superadditivity of the classical capacity with limited entanglement assistance (2017) (19)
- ON the Number of Elements Needed in a POVM Attaining the Accessible Information (2000) (19)
- Nonadditive quantum error correcting codes adapted to the ampltitude damping channel (2007) (19)
- Quantum Information Theory: Results and Open Problems (2000) (19)
- Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH (2013) (18)
- Finding stabbing lines in 3-dimensional space (1991) (17)
- The Additivity Conjecture in Quantum Information Theory (2005) (17)
- Local Rule Switching Mechanism for Viral Shell Geometry (1995) (16)
- Doc. Math. J. Dmv 1 Quantum Computing (1998) (16)
- Quantum Channel Capacities (2004) (15)
- Privacy in a Quantum World (1999) (15)
- Probabilistic Analysis of Packing and Related Partitioning Problems (1993) (15)
- Unstructured randomness, small gaps and localization (2010) (14)
- On the Mathematics of Virus Shell Assembly (1995) (14)
- Cube-tilings of ℝn and nonlinear codesand nonlinear codes (1994) (14)
- New Constructions of Codes for Asymmetric Channels via Concatenation (2012) (13)
- Cube-Tilings of Rn and Nonlinear Codes (1994) (13)
- A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound (1991) (13)
- Time Reversal and Exchange Symmetries of Unitary Gate Capacities (2005) (13)
- Quantum and Super-quantum enhancements to two-sender, two-receiver channels (2017) (12)
- Superadditivity in Trade-Off Capacities of Quantum Channels (2017) (12)
- Quantum Interactive Proofs with Short Messages (2010) (12)
- Efficiently Controllable Graphs. (2015) (11)
- A new relativistic orthogonal states quantum key distribution protocol (2014) (10)
- C_3, semi-Clifford and genralized semi-Clifford operations (2008) (10)
- Capacity of quantum erasure channel assisted by backwards classical communication. (2007) (9)
- Quantum information theory: The bits don't add up (2009) (8)
- Elementary gates for quantum computation NOVEMBER 1995 (2011) (7)
- Local Rule Simulations of Capsid Assembly (2005) (7)
- Scrambling Time and Causal Structure of the Photon Sphere of a Schwarzschild Black Hole (2018) (7)
- Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version) (1989) (7)
- A lower bound for 0, 1, * tournament codes (1987) (6)
- Entanglement purification with two-way classical communication (2007) (6)
- Generalized concatenation for quantum codes (2009) (6)
- Quantum MacWilliams Identities (1996) (6)
- Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems (1999) (5)
- Regressions and monotone chains: A ramsey-type extremal problem for partial orders (1984) (5)
- An Efficient Quantum Algorithm for a Variant of the Closest Lattice-Vector Problem (2016) (5)
- Steiner tree problems (1992) (4)
- Maximizing free energy gain (2017) (4)
- On the Structure of the Scaffolding Core of Bacteriophage T4 (1999) (4)
- Semi-Clifford and Generalized Semi-Clifford Operations (2009) (4)
- Applications of Random Sampling in Computational (2005) (4)
- Power law violation of the area law in critical spin chains (2014) (4)
- Erratum: Quantum-channel capacity of very noisy channels [Phys. Rev. A57, 830 (1998)] (1999) (4)
- The Early Days of Quantum Computation (2022) (4)
- Adaptive Entanglement Purification Protocols with Two-way Classical Communication (2007) (4)
- Largest induced suborders satisfying the chain condition (1985) (3)
- Bounding the Forward Classical Capacity of Bipartite Quantum Channels (2020) (3)
- The Systematic Normal Form of Lattices (2016) (3)
- Graphical quantum Clifford-encoder compilers from the ZX calculus (2023) (3)
- Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback (2019) (3)
- Computers and mathematics. Quantum channel capacities. (2004) (3)
- A note on finding a strict saddlepoint (1991) (3)
- When is a bit worth much more than kT ln2 (2017) (3)
- Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel (2017) (3)
- Superadditivity in Trade-Off Capacities of Quantum Channels (2019) (3)
- Publicly verifiable quantum money from random lattices (2022) (2)
- Design of Quantum Algorithms Using Physics Tools (2014) (2)
- A Ga,me-Theoretic Classification of Interactive Complexity Classes (Est ended Abstract ) (1995) (2)
- Evidence for Nonadditivity of Bipartite Distillable Entanglement (2000) (2)
- Indistinguishable Chargeon-Fluxion Pairs in the Quantum Double of Finite Groups (2010) (2)
- Problems: 10494-10500 (1996) (2)
- The Kitaev Model with Boundary: Condensations and Symmetries (2010) (2)
- A Discrete Fourier Transform on Lattices with Quantum Applications (2017) (1)
- Some Problems in Probabilistic Tomography (1997) (1)
- A Selection-Replacement Process on the Circle (1993) (1)
- Analog computational power. (1996) (1)
- Simultaneous Measurement and Entanglement (2022) (1)
- Putnam Problems--Play by Play (1981) (0)
- UvA-DARE ( Digital Academic Repository ) Unextendible product bases and bound entanglement (2017) (0)
- C[subscript 3], semi-clifford and generalized semi-clifford operations (2010) (0)
- A 97 , 052317 ( 2018 ) Resource theory of non-Gaussian operations (2018) (0)
- Unfrustrated qudit chains and their ground states Citation (2010) (0)
- A Good Family of Quantum Low-Density Parity-Check Codes (2012) (0)
- J ul 2 00 3 Equivalence of Additivity Questions in Quantum Information Theory (2007) (0)
- New Frontiers: Interactions between Quantum Physics and Mathematics June 20-23, 2022 (2022) (0)
- Ju n 20 03 Equivalence of Additivity Questions in Quantum Information Theory (2008) (0)
- Some problems in probabilistic tomography@@@Some problems in probabilistic tomography (1996) (0)
- A Combinatorial Identity (Peter Shor) (1979) (0)
- Explorer The Power of Unentanglement (2009) (0)
- Impact of Quantum Computing (2019) (0)
- A Combinatorial Identity (1978) (0)
- A pr 2 01 7 Maximizing free energy gain (2018) (0)
- Upper bound on the classical capacity of a quantum channel assisted by classical feedback (2021) (0)
- Advanced Topics in Algorithms (2012) (0)
- Questions answered. in theory.: http://cstheory.stackexchange.com/ (2010) (0)
- Addicted to Proof (2020) (0)
- Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
- Quantum Information Science (PDF) (2006) (0)
- The Power of Unentanglement (Extended Abstract) (2008) (0)
- Ju n 20 06 Optimum Quantum Error Recovery using Semidefinite Programming (2006) (0)
- Communications in Mathematical Physics Randomizing Quantum States : Constructions and Applications (0)
- Quantum Computers (1998) (0)
- Quantum information theory (invited paper) (2000) (0)
- M ay 2 00 3 Equivalence of Additivity Questions in Quantum Information Theory (2008) (0)
- Addicted to Proof (2020) (0)
- Quantum Channel Capacity of Very Noisy (1998) (0)
- Principles of Applied Mathematics (PDF) (2005) (0)
- 2 1 2 M ay 2 00 3 Equivalence of Additivity Questions in Quantum Information Theory (2009) (0)
- On bit-commitment based quantum coin flipping. (arXiv:quant-ph/0206123v1 CROSS LISTED) (2018) (0)
- Mathematics for Operations Research (2003) (0)
- Analog comuputational power (1996) (0)
- Breaking and making quantum money (2009) (0)
This paper list is powered by the following services:
Other Resources About Peter Shor
What Schools Are Affiliated With Peter Shor?
Peter Shor is affiliated with the following schools:
