Preskill, John P.
Overview
Works:  44 works in 50 publications in 2 languages and 60 library holdings 

Genres:  Academic theses 
Roles:  Thesis advisor, Author 
Classifications:  QC174.45, 
Publication Timeline
.
Most widely held works by
John P Preskill
Controlling quantum information by Andrew J Landahl(
)
2 editions published in 2002 in English and held by 3 WorldCat member libraries worldwide
"Quantum information science explores ways in which quantum physical laws can be harnessed to control the acquisition, transmission, protection, and processing of information. This field has seen explosive growth in the past several years from progress on both theoretical and experimental fronts. Essential to this endeavor are methods for controlling quantum information. In this thesis, I present three new approaches for controlling quantum information. First, I present a new protocol for continuously protecting unknown quantum states from noise. This protocol combines and expands ideas from the theories of quantum error correction and quantum feedback control. The result can outperform either approach by itself. I generalize this protocol to all known quantum stabilizer codes, and study its application to the threequbit repetition code in detail via Monte Carlo simulations. Next, I present several new protocols for controlling quantum information that are faulttolerant. These protocols require only local quantum processing due to the topological properties of the quantum error correcting codes upon which they are built. I show that each protocol's faultdependence behavior exhibits an orderdisorder phase transition when mapped onto an associated statisticalmechanical model. I review the critical error rates of these protocols found by numerical study of the associated models, and I present new analytic bounds for them using a selfavoiding random walk argument. Moreover, I discuss faulttolerant procedures for encoding, errorcorrection, computing, and decoding quantum information using these protocols, and calculate the accuracy threshold of faulttolerant quantum memory for protocols using them. I end by presenting a new class of quantum algorithms that solve combinatorial optimization problems solely by measurement. I compute the running times of these algorithms by establishing an explicit dynamical model for the measurement process. This model, the digitized version of von Neumann's measurement model, is recognized as Kitaev's phase estimation algorithm. I show that the running times of these algorithms are closely related to the running times of adiabatic quantum algorithms. Finally, I present a twomeasurement algorithm that achieves a quadratic speedup for Grover's unstructured search problem."
2 editions published in 2002 in English and held by 3 WorldCat member libraries worldwide
"Quantum information science explores ways in which quantum physical laws can be harnessed to control the acquisition, transmission, protection, and processing of information. This field has seen explosive growth in the past several years from progress on both theoretical and experimental fronts. Essential to this endeavor are methods for controlling quantum information. In this thesis, I present three new approaches for controlling quantum information. First, I present a new protocol for continuously protecting unknown quantum states from noise. This protocol combines and expands ideas from the theories of quantum error correction and quantum feedback control. The result can outperform either approach by itself. I generalize this protocol to all known quantum stabilizer codes, and study its application to the threequbit repetition code in detail via Monte Carlo simulations. Next, I present several new protocols for controlling quantum information that are faulttolerant. These protocols require only local quantum processing due to the topological properties of the quantum error correcting codes upon which they are built. I show that each protocol's faultdependence behavior exhibits an orderdisorder phase transition when mapped onto an associated statisticalmechanical model. I review the critical error rates of these protocols found by numerical study of the associated models, and I present new analytic bounds for them using a selfavoiding random walk argument. Moreover, I discuss faulttolerant procedures for encoding, errorcorrection, computing, and decoding quantum information using these protocols, and calculate the accuracy threshold of faulttolerant quantum memory for protocols using them. I end by presenting a new class of quantum algorithms that solve combinatorial optimization problems solely by measurement. I compute the running times of these algorithms by establishing an explicit dynamical model for the measurement process. This model, the digitized version of von Neumann's measurement model, is recognized as Kitaev's phase estimation algorithm. I show that the running times of these algorithms are closely related to the running times of adiabatic quantum algorithms. Finally, I present a twomeasurement algorithm that achieves a quadratic speedup for Grover's unstructured search problem."
Unified gauge theories without elementary scalar fields by
John Preskill(
Book
)
1 edition published in 1980 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1980 in English and held by 2 WorldCat member libraries worldwide
Unification of quantum information theory by Anura Yamesh Abeyesinghe(
Book
)
1 edition published in 2006 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2006 in English and held by 2 WorldCat member libraries worldwide
Upper and lower bounds on quantum codes by Graeme Stewart Baird Smith(
Book
)
1 edition published in 2006 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2006 in English and held by 2 WorldCat member libraries worldwide
Emerging paradigms in quantum error correction and quantum cryptography by Prabha Mandayam Doddamane(
)
2 editions published in 2011 in English and held by 2 WorldCat member libraries worldwide
"We study two novel paradigms in quantum error correction and quantum cryptography  approximate quantum error correction and noisystorage cryptography  which explore alternate approaches for dealing with quantum noise. Approximate quantum error correction seeks to relax the constraint of perfect error correction and construct codes that might be better adapted to correct for specific noise models. Noisystorage cryptography relies on the power of quantum noise to execute twoparty cryptographic tasks securely. Motivated by examples of approximately correcting codes, which make use of fewer physical resources than perfect codes and still obtain comparable levels of fidelity, we study the problem of finding and characterizing such codes in general. We construct for the first time a universal, nearoptimal recovery map for approximate quantum error correction (AQEC), with optimality defined in terms of worstcase fidelity. Using the analytical form of this recovery, we also obtain easily verifiable conditions for AQEC. This in turn leads to a simple algorithm for identifying good approximate codes, without having to perform a difficult optimization over all recovery maps for every possible encoding. Noisystorage cryptography envisions a setting where twoparty cryptographic protocols can be securely implemented based solely on the assumption that the quantum storage device possessed by either party is noisy and bounded. Here, we construct twoparty protocols (using higherdimensional states) that are secure even when a dishonest player can store all but a small fraction of the information transmitted during the protocol, in his noiseless quantum memory. We also show that when his memory is noisy, security can be extended to a larger class of noisy quantum memories. Our result demonstrates that the physical limits of the quantum noisystorage model are indeed achievable, albeit asymptotically. We also describe our investigations on obtaining strong entropic uncertainty relations using symmetric complementary bases. Uncertainty relations are an important and useful resource in analyzing the security of quantum cryptographic protocols, in addition to being of interest from a foundational standpoint. We present a novel construction of sets of symmetric, complementary bases in dimension d = 2^n, which are cyclically permuted under the action of a unitary transformation. We also obtain new lower bounds for uncertainty relations in terms of the minentropy, which are tight for specific instances of our construction."
2 editions published in 2011 in English and held by 2 WorldCat member libraries worldwide
"We study two novel paradigms in quantum error correction and quantum cryptography  approximate quantum error correction and noisystorage cryptography  which explore alternate approaches for dealing with quantum noise. Approximate quantum error correction seeks to relax the constraint of perfect error correction and construct codes that might be better adapted to correct for specific noise models. Noisystorage cryptography relies on the power of quantum noise to execute twoparty cryptographic tasks securely. Motivated by examples of approximately correcting codes, which make use of fewer physical resources than perfect codes and still obtain comparable levels of fidelity, we study the problem of finding and characterizing such codes in general. We construct for the first time a universal, nearoptimal recovery map for approximate quantum error correction (AQEC), with optimality defined in terms of worstcase fidelity. Using the analytical form of this recovery, we also obtain easily verifiable conditions for AQEC. This in turn leads to a simple algorithm for identifying good approximate codes, without having to perform a difficult optimization over all recovery maps for every possible encoding. Noisystorage cryptography envisions a setting where twoparty cryptographic protocols can be securely implemented based solely on the assumption that the quantum storage device possessed by either party is noisy and bounded. Here, we construct twoparty protocols (using higherdimensional states) that are secure even when a dishonest player can store all but a small fraction of the information transmitted during the protocol, in his noiseless quantum memory. We also show that when his memory is noisy, security can be extended to a larger class of noisy quantum memories. Our result demonstrates that the physical limits of the quantum noisystorage model are indeed achievable, albeit asymptotically. We also describe our investigations on obtaining strong entropic uncertainty relations using symmetric complementary bases. Uncertainty relations are an important and useful resource in analyzing the security of quantum cryptographic protocols, in addition to being of interest from a foundational standpoint. We present a novel construction of sets of symmetric, complementary bases in dimension d = 2^n, which are cyclically permuted under the action of a unitary transformation. We also obtain new lower bounds for uncertainty relations in terms of the minentropy, which are tight for specific instances of our construction."
Investigations in quantum computing: causality and graph isomorphism by David Eugene Beckman(
Book
)
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
Conditional independence in quantum manybody systems by Isaac Hyun Kim(
)
2 editions published in 2013 in English and held by 2 WorldCat member libraries worldwide
In this thesis, I will discuss how informationtheoretic arguments can be used to produce sharp bounds in the studies of quantum manybody systems. The main advantage of this approach, as opposed to the conventional fieldtheoretic argument, is that it depends very little on the precise form of the Hamiltonian. The main idea behind this thesis lies on a number of results concerning the structure of quantum states that are conditionally independent. Depending on the application, some of these statements are generalized to quantum states that are approximately conditionally independent. These structures can be readily used in the studies of gapped quantum manybody systems, especially for the ones in two spatial dimensions. A number of rigorous results are derived, including (i) a universal upper bound for a maximal number of topologically protected states that is expressed in terms of the topological entanglement entropy, (ii) a firstorder perturbation bound for the topological entanglement entropy that decays superpolynomially with the size of the subsystem, and (iii) a correlation bound between an arbitrary local operator and a topological operator constructed from a set of local reduced density matrices. I also introduce exactly solvable models supported on a threedimensional lattice that can be used as a reliable quantum memory
2 editions published in 2013 in English and held by 2 WorldCat member libraries worldwide
In this thesis, I will discuss how informationtheoretic arguments can be used to produce sharp bounds in the studies of quantum manybody systems. The main advantage of this approach, as opposed to the conventional fieldtheoretic argument, is that it depends very little on the precise form of the Hamiltonian. The main idea behind this thesis lies on a number of results concerning the structure of quantum states that are conditionally independent. Depending on the application, some of these statements are generalized to quantum states that are approximately conditionally independent. These structures can be readily used in the studies of gapped quantum manybody systems, especially for the ones in two spatial dimensions. A number of rigorous results are derived, including (i) a universal upper bound for a maximal number of topologically protected states that is expressed in terms of the topological entanglement entropy, (ii) a firstorder perturbation bound for the topological entanglement entropy that decays superpolynomially with the size of the subsystem, and (iii) a correlation bound between an arbitrary local operator and a topological operator constructed from a set of local reduced density matrices. I also introduce exactly solvable models supported on a threedimensional lattice that can be used as a reliable quantum memory
Lattice quantum codes and exotic topological phases of matter by Jeongwan Haah(
)
2 editions published in 2013 in English and held by 2 WorldCat member libraries worldwide
This thesis addresses whether it is possible to build a robust memory device for quantum information. Many schemes for faulttolerant quantum information processing have been developed so far, one of which, called topological quantum computation, makes use of degrees of freedom that are inherently insensitive to local errors. However, this scheme is not so reliable against thermal errors. Other faulttolerant schemes achieve better reliability through active error correction, but incur a substantial overhead cost. Thus, it is of practical importance and theoretical interest to design and assess faulttolerant schemes that work well at finite temperature without active error correction. In this thesis, a threedimensional gapped lattice spin model is found which demonstrates for the first time that a reliable quantum memory at finite temperature is possible, at least to some extent. When quantum information is encoded into a highly entangled ground state of this model and subjected to thermal errors, the errors remain easily correctable for a long time without any active intervention, because a macroscopic energy barrier keeps the errors well localized. As a result, stored quantum information can be retrieved faithfully for a memory time which grows exponentially with the square of the inverse temperature. In contrast, for previously known types of topological quantum storage in three or fewer spatial dimensions the memory time scales exponentially with the inverse temperature, rather than its square. This spin model exhibits a previously unexpected topological quantum order, in which ground states are locally indistinguishable, pointlike excitations are immobile, and the immobility is not affected by small perturbations of the Hamiltonian. The degeneracy of the ground state, though also insensitive to perturbations, is a complicated numbertheoretic function of the system size, and the system bifurcates into multiple noninteracting copies of itself under realspace renormalization group transformations. The degeneracy, the excitations, and the renormalization group flow can be analyzed using a framework that exploits the spin model's symmetry and some associated free resolutions of modules over polynomial algebras
2 editions published in 2013 in English and held by 2 WorldCat member libraries worldwide
This thesis addresses whether it is possible to build a robust memory device for quantum information. Many schemes for faulttolerant quantum information processing have been developed so far, one of which, called topological quantum computation, makes use of degrees of freedom that are inherently insensitive to local errors. However, this scheme is not so reliable against thermal errors. Other faulttolerant schemes achieve better reliability through active error correction, but incur a substantial overhead cost. Thus, it is of practical importance and theoretical interest to design and assess faulttolerant schemes that work well at finite temperature without active error correction. In this thesis, a threedimensional gapped lattice spin model is found which demonstrates for the first time that a reliable quantum memory at finite temperature is possible, at least to some extent. When quantum information is encoded into a highly entangled ground state of this model and subjected to thermal errors, the errors remain easily correctable for a long time without any active intervention, because a macroscopic energy barrier keeps the errors well localized. As a result, stored quantum information can be retrieved faithfully for a memory time which grows exponentially with the square of the inverse temperature. In contrast, for previously known types of topological quantum storage in three or fewer spatial dimensions the memory time scales exponentially with the inverse temperature, rather than its square. This spin model exhibits a previously unexpected topological quantum order, in which ground states are locally indistinguishable, pointlike excitations are immobile, and the immobility is not affected by small perturbations of the Hamiltonian. The degeneracy of the ground state, though also insensitive to perturbations, is a complicated numbertheoretic function of the system size, and the system bifurcates into multiple noninteracting copies of itself under realspace renormalization group transformations. The degeneracy, the excitations, and the renormalization group flow can be analyzed using a framework that exploits the spin model's symmetry and some associated free resolutions of modules over polynomial algebras
From nonabelian anyons to quantum computation to coinflipping by telephone by Carlos Mochon(
Book
)
1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide
Analysis of quantum errorcorrecting codes : symplectic lattice codes and toric codes by James William Harrington(
Book
)
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
Quantum error correction with biased noise by Peter Bernard Brooks(
Book
)
2 editions published in 2013 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 2013 in English and held by 2 WorldCat member libraries worldwide
Extending quantum error correction : new continuous measurement protocols and improved faulttolerant overhead by Charlene Sonja Ahn(
Book
)
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
Characterizing entanglement in quantum information by Federico Maximiliano Spedalieri(
Book
)
1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide
Eigenvalue inequalities in quantum information processing by Sumit Kumar Daftuar(
Book
)
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
Information amidst noise: preserved codes, error correction, and fault tolerance in a quantum world by
Hui Khoon Ng(
)
2 editions published in 2010 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 2010 in English and held by 2 WorldCat member libraries worldwide
Some aspects of open string field theories by Jiyu Feng(
Book
)
1 edition published in 1990 in English and held by 1 WorldCat member library worldwide
1 edition published in 1990 in English and held by 1 WorldCat member library worldwide
Wykłady z grawitacji by
Richard P Feynman(
Book
)
1 edition published in 2006 in Polish and held by 1 WorldCat member library worldwide
1 edition published in 2006 in Polish and held by 1 WorldCat member library worldwide
Quantum computing and information theory by
John Preskill(
Book
)
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
Cosmological production of superheavy magnetic monopoles by
John Preskill(
)
1 edition published in 1979 in Undetermined and held by 1 WorldCat member library worldwide
Grand unified models of elementary particle interactions contain stable superheavy magnetic monopoles. The density of such monopoles in the early universe is estimated to be unacceptably large. Cosmological monopole production may be suppressed if the phase transition at the grand unification mass scale is strongly first order
1 edition published in 1979 in Undetermined and held by 1 WorldCat member library worldwide
Grand unified models of elementary particle interactions contain stable superheavy magnetic monopoles. The density of such monopoles in the early universe is estimated to be unacceptably large. Cosmological monopole production may be suppressed if the phase transition at the grand unification mass scale is strongly first order
On quantum fluctuations and black holes by
Piljin Yi(
Book
)
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 California Institute of Technology Division of Physics, Mathematics and Astronomy
 Landahl, Andrew J. Author
 Ng, Hui Khoon Author
 California Institute of Technology Division of Engineering and Applied Science
 Ahn, Charlene Sonja Author
 Brooks, Peter Bernard Author
 Mochon, Carlos Author
 Abeyesinghe, Anura Yamesh Author
 Smith, Graeme Stewart Baird Author
 Daftuar, Sumit Kumar Author
Useful Links
Associated Subjects
Alternative Names
John Preskill Amerikaans natuurkundige
John Preskill amerikansk fysikar
John Preskill amerikansk fysiker
John Preskill physicien américain
John Preskill USamerikanischer Physiker
Preskill, John P.
Preskill, John Phillip
Прескилл, Джон
جان پرسکیل فیزیکدان آمریکایی
Languages