The following pages link to Peter W. Shor (Q701710):
Displayed 50 items.
- On the sum-of-squares algorithm for bin packing (Q3191987) (← links)
- Generalized planar matching (Q3357535) (← links)
- (Q3400471) (← links)
- Why haven't more quantum algorithms been found? (Q3455556) (← links)
- Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation (Q3521589) (← links)
- (Q3522501) (← links)
- (Q3534621) (← links)
- On the Sum-of-Squares algorithm for bin packing (Q3546292) (← links)
- Remote Preparation of Quantum States (Q3546562) (← links)
- (Q3596954) (← links)
- Estimating Jones polynomials is a complete problem for one clean qubit (Q3602386) (← links)
- Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel (Q3604934) (← links)
- (Q3974991) (← links)
- A Note on Finding a Strict Saddlepoint (Q3983928) (← links)
- Keller’s cube-tiling conjecture is false in high dimensions (Q4020147) (← links)
- (Q4028879) (← links)
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands (Q4032588) (← links)
- (Q4035170) (← links)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (Q4255836) (← links)
- (Q4259979) (← links)
- (Q4283452) (← links)
- Three results on interactive communication (Q4307373) (← links)
- Local rule-based theory of virus shell assembly. (Q4308644) (← links)
- Random Debaters and the Hardness of Approximating Stochastic Functions (Q4337648) (← links)
- Tight Bounds for the Maximum Acyclic Subgraph Problem (Q4366872) (← links)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (Q4376179) (← links)
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings (Q4490793) (← links)
- Quantum Error Correction and Orthogonal Geometry (Q4492481) (← links)
- Supercritical entanglement in local systems: Counterexample to the area law for quantum matter (Q4646229) (← links)
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem (Q4677586) (← links)
- Quantum error correction via codes over GF(4) (Q4701110) (← links)
- Quantum information theory (Q4701207) (← links)
- Additivity of the classical capacity of entanglement-breaking quantum channels (Q4832726) (← links)
- (Q4847941) (← links)
- Time Reversal and Exchange Symmetries of Unitary Gate Capacities (Q4976064) (← links)
- Superadditivity in Trade-Off Capacities of Quantum Channels (Q5224047) (← links)
- Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (Q5248499) (← links)
- Markov chains, computer proofs, and average-case analysis of best fit bin packing (Q5248510) (← links)
- Approximating the set of separable states using the positive partial transpose test (Q5249127) (← links)
- Graph concatenation for quantum codes (Q5256212) (← links)
- High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping (Q5272332) (← links)
- Entanglement Breaking Channels (Q5315846) (← links)
- (Q5365030) (← links)
- A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound (Q5751655) (← links)
- Time independent universal computing with spin chains: quantum plinko machine (Q5855076) (← links)
- A lower bound for the length of a partial transversal in a Latin square (Q5900501) (← links)
- Quantum computing (Q5904086) (← links)
- A lower bound for the length of a partial transversal in a Latin square (Q5905147) (← links)
- Bounding the Forward Classical Capacity of Bipartite Quantum Channels (Q6197484) (← links)
- Unfrustrated Qudit Chains and their Ground States (Q6216976) (← links)