Výsledky vyhledávání - "BECKMAN, DAVID"

Electronic Resource

Investigations in quantum computing: causality and graph isomorphism

Autor: Beckman, David Eugene. Preskill, John P.

Publikováno v: Investigations in quantum computing: causality and graph isomorphism [electronic thesis]

Thesis (Ph. D.)--PQ #3151342.
Paper copy has vi, 121 leaves. Webb copy includes 2 blank pages. Includes bibliographical references.

Externí odkaz: http://resolver.caltech.edu/CaltechETD:etd-05272004-174253

Zobrazit plný text záznamu

Dissertation/ Thesis

Investigations in Quantum Computing: Causality and Graph Isomorphism

Autor: Beckman, David Eugene

In this thesis I explore two different types of limits on the time complexity of quantum computation ---that is, limits on how much time is required to perform a given class of quantum operations on a quantum system. Upper limits can be found by expl

Externí odkaz: https://thesis.library.caltech.edu/2139/1/thesis.pdf

Zobrazit plný text záznamu

Report

Measurability of Wilson loop operators

Autor: Beckman, David, Gottesman, Daniel, Kitaev, Alexei, Preskill, John

Publikováno v: Phys.Rev. D65 (2002) 065022

We show that the nondemolition measurement of a spacelike Wilson loop operator W(C) is impossible in a relativistic non-Abelian gauge theory. In particular, if two spacelike-separated magnetic flux tubes both link with the loop C, then a nondemolitio

Externí odkaz: http://arxiv.org/abs/hep-th/0110205

Zobrazit plný text záznamu

Report

Causal and localizable quantum operations

Autor: Beckman, David, Gottesman, Daniel, Nielsen, M. A., Preskill, John

Publikováno v: Phys.Rev. A64 (2001) 052309

We examine constraints on quantum operations imposed by relativistic causality. A bipartite superoperator is said to be localizable if it can be implemented by two parties (Alice and Bob) who share entanglement but do not communicate; it is causal if

Externí odkaz: http://arxiv.org/abs/quant-ph/0102043

Zobrazit plný text záznamu

Report

Efficient Networks for Quantum Factoring

Autor: Beckman, David, Chari, Amalavoyal N., Devabhaktuni, Srikrishna, Preskill, John

Publikováno v: Phys. Rev.A54:1034-1063,1996

We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory qubits and the number of operations required to perform factorization, using the algorithm suggested by Shor.

Externí odkaz: http://arxiv.org/abs/quant-ph/9602016

Zobrazit plný text záznamu