Peter Shor

Shor in 2017 Peter Williston Shor (born August 14, 1959) is an American theoretical computer scientist 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. He has been a professor of applied mathematics at the Massachusetts Institute of Technology (MIT) since 2003. Provided by Wikipedia
Showing 1 - 16 results of 16 for search 'Shor, Peter Williston', query time: 0.04s Refine Results
  1. 1
    Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback

    Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback by Shor, Peter Williston

    Published 2020
    Get full text
    Article
  2. 2
    Random planar matching and bin packing

    Random planar matching and bin packing by Shor, Peter Williston.

    Published 2020
    Get full text
    Thesis
  3. 3
    Addicted to Proof

    Addicted to Proof by Shor, Peter Williston

    Published 2021
    Get full text
    Article
  4. 4
    Supercritical entanglement in local systems: Counterexample to the area law for quantum matter

    Supercritical entanglement in local systems: Counterexample to the area law for quantum matter by Movassagh, Ramis, Shor, Peter Williston

    Published 2017
    Get full text
    Get full text
    Article
  5. 5
    Quantum and superquantum enhancements to two-sender, two-receiver channels

    Quantum and superquantum enhancements to two-sender, two-receiver channels by Quek, Yihui, Shor, Peter Williston

    Published 2017
    Get full text
    Get full text
    Article
  6. 6
    Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement

    Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement by Zhuang, Quntao, Zhu, Elton, Shor, Peter Williston

    Published 2017
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  7. 7
    Superadditivity of the Classical Capacity with Limited Entanglement Assistance

    Superadditivity of the Classical Capacity with Limited Entanglement Assistance by Zhu, Elton, Zhuang, Quntao, Shor, Peter Williston

    Published 2017
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8
    Superadditivity in trade-off capacities of quantum channels

    Superadditivity in trade-off capacities of quantum channels by Zhu, Elton, Zhuang, Quntao, Shor, Peter Williston

    Published 2020
    Get full text
    Article
  9. 9
    Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel

    Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel by Lloyd, Seth, Shor, Peter Williston, Thompson, Kevin

    Published 2020
    Get full text
    Article
  10. 10
    Resource theory of non-Gaussian operations

    Resource theory of non-Gaussian operations by Zhuang, Quntao, Shor, Peter Williston, Shapiro, Jeffrey H

    Published 2018
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  11. 11
    Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH

    Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH by Shor, Peter W., Bavarian, Mohammad, Shor, Peter Williston

    Published 2018
    Get full text
    Get full text
    Get full text
    Article
  12. 12
    Resource theory of non-Gaussian operations

    Resource theory of non-Gaussian operations by Zhuang, Quntao, Shor, Peter Williston, Shapiro, Jeffrey H

    Published 2020
    Get full text
    Article
  13. 13
    Superadditivity in Trade-Off Capacities of Quantum Channels

    Superadditivity in Trade-Off Capacities of Quantum Channels by Zhu, Elton Yechao., Zhuang, Quntao, Shor, Peter Williston

    Published 2020
    Get full text
    Article
  14. 14
    Efficiently Controllable Graphs

    Efficiently Controllable Graphs by Gokler, Can, Thompson, Kevin, Lloyd, Seth, Shor, Peter Williston

    Published 2017
    Get full text
    Get full text
    Article
  15. 15
    Time independent universal computing with spin chains: quantum plinko machine

    Time independent universal computing with spin chains: quantum plinko machine by Thompson, K F, Gokler, C, Lloyd, Seth, Shor, Peter Williston

    Published 2016
    Get full text
    Get full text
    Article
  16. 16
    New Constructions of Codes for Asymmetric Channels via Concatenation

    New Constructions of Codes for Asymmetric Channels via Concatenation by Grassl, Markus, Smith, Graeme, Smolin, John, Zeng, Bei, Shor, Peter Williston

    Published 2018
    Get full text
    Get full text
    Article

Search Tools: