836 citations
- Delft University of TechnologyNL6 papers
- Osipyan Institute of Solid State Physics RASRU5 papers
- Romanian AcademyRO2 papers
- The University of AdelaideAU2 papers
- University of BristolGB2 papers
- University of ZurichCH2 papers
- Australian Mathematical Sciences InstituteAU1 paper
- Australian National UniversityAU1 paper
- Bangor UniversityGB1 paper
- Bishop's UniversityCA1 paper
- Boston UniversityUS1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
Showing 2002 · quant-phShow all
2 papers · 2 filters
quant-ph2002★ 1 cited
Maximal p-norms of entanglement breaking channels
C. King
It shown that when one of the components of a product channel is entanglement breaking, the output state with maximal p-norm is always a product state. This result complements Shor…
quant-ph2002★ 836 cited
Exponential algorithmic speedup by quantum walk
Andrew M. Childs, Richard Cleve, Enrico Deotto +3
We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a c…