Skip to feedback

Award Abstract # 1111382
AF: Large: Collaborative Research: Reliable Quantum Communication and Computation in the Presence of Noise

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: UNIVERSITY OF WASHINGTON
Initial Amendment Date: September 13, 2011
Latest Amendment Date: March 3, 2015
Award Number: 1111382
Award Instrument: Continuing Grant
Program Manager: Dmitri Maslov
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: September 1, 2011
End Date: March 31, 2016 (Estimated)
Total Intended Award Amount: $1,286,337.00
Total Awarded Amount to Date: $1,318,337.00
Funds Obligated to Date: FY 2011 = $301,582.00
FY 2012 = $613,825.00

FY 2013 = $0.00

FY 2014 = $0.00
History of Investigator:
  • Paul Beame (Principal Investigator)
    beame@cs.washington.edu
  • Dave Bacon (Co-Principal Investigator)
  • Aram Harrow (Co-Principal Investigator)
  • Aram Harrow (Former Principal Investigator)
Recipient Sponsored Research Office: University of Washington
4333 BROOKLYN AVE NE
SEATTLE
WA  US  98195-1016
(206)543-4043
Sponsor Congressional District: 07
Primary Place of Performance: University of Washington
4333 BROOKLYN AVE NE
SEATTLE
WA  US  98195-1016
Primary Place of Performance
Congressional District:
07
Unique Entity Identifier (UEI): HD1WMN6945W6
Parent UEI:
NSF Program(s): QIS - Quantum Information Scie,
Algorithmic Foundations,
ALGORITHMS
Primary Program Source: 01001112DB NSF RESEARCH & RELATED ACTIVIT
01001213DB NSF RESEARCH & RELATED ACTIVIT

01001314DB NSF RESEARCH & RELATED ACTIVIT

01001415DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 6863, 7203, 7925, 7928, 9251
Program Element Code(s): 728100, 779600, 792600
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Quantum information science has yielded deep theoretical insights into the nature of information and communication, while raising the hope of dramatically more capable computers and communication networks. But the achievement of these practical goals is hindered by the inherent fragility of quantum information. Traditional approaches for obtaining reliability through simple redundancy do not work; instead, fault tolerance must, and can, in principle, be obtained through subtler techniques that contrive to measure and correct errors without learning anything about the encoded data.

Unfortunately present methods for fault-tolerant quantum computation require significant overhead, and present understanding of quantum channel capacities remain very limited. For example, no quantum code is known on which arbitrary fault-tolerant quantum computation can be performed without leaving the code space. And only very recently was it discovered that classical information can be sent at rates exceeding the long-conjectured Holevo bound.

This project will attempt to develop new methods for reliable quantum communication and computation in the presence of noise. First, the research will push the capabilities and boundaries of quantum error-correction techniques, both by extending and delineating the types of correctable errors, and by determining the scenarios under which such error correction is or is not possible. The second goal is to develop the deep but heretofore largely unexplored connections between quantum codes, entanglement, and many-body physics, complexity theory, cryptography and high-dimensional geometry. The objective is to advance our understanding both of quantum codes as well as the related areas of mathematics, physics and computer science. Finally the team will seek to elucidate the subtle differences between quantum communication and its closest classical analog---private communication.

This research endeavors to contribute definitively to realistic embodiments of large-scale quantum computers, which would dramatically improve mankind's ability to process and communicate information. And the research program itself is deeply interdisciplinary, bringing together physicists, computer scientists and mathematicians from industry and academia, and training students and postdocs.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 25)
Aram Wettroth Harrow, David J. Rosenbaum: "Uselessness for an Oracle model with internal randomness" Quantum Information & Computation , v.14 , 2014 , p.608
Aram W. Harrow "Why Now is the Right Time to Study Quantum Computing" ACM XRDS Magazine , v.18/3 , 2012 , p.32
Aram W. Harrow, Alexandra Kolla, and Leonard J. Schulman "Dimension-free l_2 maximal inequality for spherical means in the hypercube" Theory of Computing , v.10 , 2014 , p.55 10.4086/toc.2014.v010a003
Aram W. Harrow, Alexandra Kolla, Leonard J. Schulman "Dimension-free L2 maximal inequality for spherical means in the hypercube" arXiv , v.1209 , 2012 , p.1 arXiv:1209.4148
Aram W. Harrow, Anand Natarajan, Xiaodi Wu "An improved semidefinite programming hierarchy for testing entanglement" arxiv , v.1506 , 2015 arXiv:1506.08834
Aram W. Harrow, Ashley Montanaro "Extremal eigenvalues of local Hamiltonians" arxiv , v.1507 , 2015 arXiv:1507.00739
Boaz Barak, Fernando G.S.L. Brandao, Aram W. Harrow, Jonathan A. Kelner, David Steurer, and Yuan Zhou "Hypercontractivity, Sum-of-Squares Proofs, and Their Applications" arXiv:1205.4484 and Symposium on Theory of Computing (STOC) , v.May , 2012
Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, and Andreas Winter "The quantum reverse Shannon theorem and resource tradeoffs for simulating quantum channels" IEEE Trans. Inf. Theory , v.60 , 2014 , p.2926 10.1109/TIT.2014.2309968
Cyril J. Stark, Aram W. Harrow "Compressibility of positive semidefinite factorizations and quantum models" arxiv , v.1412 , 2014 arXiv:1412.7437
David J. Rosenbaum "Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism" arxiv , v.1412 , 2014 arXiv:1412.0639
David J. Rosenbaum and Fabian Wagner "Beating the Generator-Enumeration Bound for p-Group Isomorphism" Theoretical Computer Science , v.593 , 2015 , p.16 doi:10.1016/j.tcs.2015.05.036
(Showing: 1 - 10 of 25)

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page