Loading
Error: Cannot Load Popup Box
Skip to hit list
Adjust your hit list
Further result pages
Mobile

A
A
A

A

English
Deutsch
Français
Español
Polski
Ελληνικά
Українська
中文
 Logged in as

Log Out

Login
BASIC
SEARCH
ADVANCED
SEARCH
HELP
BROWSING
SEARCH
HISTORY
Your search
Search For:
Entire Document
Title
Author
Subject
Boost open access documents
Find
Linguistics tools
Verbatim search
Additional word forms
Multilingual synonyms
Statistics
25 hits
in 72,227,055 documents
in 0.36 seconds
Please leave the following field blank:
Home
»
Search: Fernando Pastawski
Hit List
Hit list
1.
Practical Inference for TypedBased Termination in a Polymorphic Setting
Open Access
Title:
Practical Inference for TypedBased Termination in a Polymorphic Setting
Author:
Gilles Barthe
;
Benjamin Gregoire
;
Fernando Pastawski
Gilles Barthe
;
Benjamin Gregoire
;
Fernando Pastawski
Minimize authors
Description:
We introduce a polymorphic #calculus that features inductive types and that enforces termination of recursive definitions through typing. Then, we define a sound and complete type inference algorithm that computes a set of constraints to be satisfied for terms to be typable.
We introduce a polymorphic #calculus that features inductive types and that enforces termination of recursive definitions through typing. Then, we define a sound and complete type inference algorithm that computes a set of constraints to be satisfied for terms to be typable.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090419
Source:
http://wwwsop.inria.fr/everest/Benjamin.Gregoire/Publi/Fsombrero.ps.gz
http://wwwsop.inria.fr/everest/Benjamin.Gregoire/Publi/Fsombrero.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.3496
http://wwwsop.inria.fr/everest/Benjamin.Gregoire/Publi/Fsombrero.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.3496
http://wwwsop.inria.fr/everest/Benjamin.Gregoire/Publi/Fsombrero.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
2.
Quantum memory
Title:
Quantum memory
Author:
Pastawski, Fernando
Pastawski, Fernando
Minimize authors
Description:
This thesis is devoted to the study of coherent storage of quantum information as well as its potential applications. Quantum memories are crucial to harnessing the potential of quantum physics for information processing tasks. They are required for almost all quantum computation proposals. However, despite the large arsenal of theoretical techn...
This thesis is devoted to the study of coherent storage of quantum information as well as its potential applications. Quantum memories are crucial to harnessing the potential of quantum physics for information processing tasks. They are required for almost all quantum computation proposals. However, despite the large arsenal of theoretical techniques and proposals dedicated to their implementation, the realization of longlived quantum memories remains an elusive task. Encoding information in quantum states associated to manybody topological phases of matter and protecting them by means of a static Hamiltonian is one of the leading proposals to achieve quantum memories. While many genuine and well publicized virtues have been demonstrated for this approach, equally real limitations were widely disregarded. In the first two projects of this thesis, we study limitations of passive Hamiltonian protection of quantum information under two different noise models. Chapter 2 deals with arbitrary passive Hamiltonian protection for a many body system under the effect of local depolarizing noise. It is shown that for both constant and time dependent Hamiltonians, the optimal enhancement over the natural singleparticle memory time is logarithmic in the number of particles composing the system. The main argument involves a monotonic increase of entropy against which a Hamiltonian can provide little protection. Chapter 3 considers the recoverability of quantum information when it is encoded in a manybody state and evolved under a Hamiltonian composed of known geometrically local interactions and a weak yet unknown Hamiltonian perturbation. We obtain some generic criteria which must be fulfilled by the encoding of information. For specific proposals of protecting Hamiltonian and encodings such as Kitaev's toric code and a subsystem code proposed by Bacon, we additionally provide example perturbations capable of destroying the memory which imply upper bounds for the provable memory times. Chapter 4 proposes engineered dissipation as a natural solution for continuously extracting the entropy introduced by noise and keeping the accumulation of errors under control. Persuasive evidence is provided supporting that engineered dissipation is capable of preserving quantum degrees of freedom from all previously considered noise models. Furthermore, it is argued that it provides additional flexibility over Hamiltonian thermalization models and constitutes a promising approach to quantum memories. Chapter 5 introduces a particular experimental realization of coherent storage, shifting the focus in many regards with respect to previous chapters. First of all, the system is very concrete, a roomtemperature nitrogenvacancy centre in diamond, which is subject to actual experimental control and noise restrictions which must be adequately modelled. Second, the relevant degrees of freedom reduce to a single electronic spin and a carbon 13 spin used to store a qubit. Finally, the approach taken to battle decoherence consists of inducing motional narrowing and applying dynamical decoupling pulse sequences, and is tailored to address the systems dominant noise sources. Chapter 6 analyses unforgeable tokens as a potential application of these roomtemperature qubit memories. Quantum information protocols based on Wiesner's quantum money scheme are proposed and analysed. We provide the first rigorous proof that such unentangled tokens may be resistant to counterfeiting attempts while tolerating a certain amount of noise. In summary, this thesis provides contributions to quantum memories in four different aspects. Two projects were dedicated to understanding and exposing the limitations of existing proposals. This is followed by a constructive proposal of a new counterintuitive theoretical model for quantum memories. An applied experimental project achieves record coherent storage times in roomtemperature solids. Finally, we provide rigorous analysis for a quantum information application of quantum memories. This completes a broad picture of quantum memories which integrates different perspectives, from theoretical critique and constructive proposal, to technological application going through a downtoearth experimental implementation.
Minimize
Publisher:
LudwigMaximiliansUniversität München
Year of Publication:
20120604
Document Type:
Dissertation ; NonPeerReviewed
Subjects:
Fakultät für Physik
Fakultät für Physik
Minimize
DDC:
541 Physical chemistry
(computed)
Relations:
http://edoc.ub.unimuenchen.de/14703/
URL:
http://edoc.ub.unimuenchen.de/14703/1/Pastawski_Fernando.pdf
http://nbnresolving.de/urn:nbn:de:bvb:19147039
http://edoc.ub.unimuenchen.de/14703/1/Pastawski_Fernando.pdf
http://nbnresolving.de/urn:nbn:de:bvb:19147039
Minimize
Content Provider:
University of Munich: Digital theses
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
3.
Generating topological order: no speedup by dissipation
Open Access
Title:
Generating topological order: no speedup by dissipation
Author:
Koenig, Robert
;
Pastawski, Fernando
Koenig, Robert
;
Pastawski, Fernando
Minimize authors
Description:
We consider the problem of preparing topologically ordered states using unitary and nonunitary circuits, as well as local timedependent Hamiltonian and Liouvillian evolutions. We prove that for any topological code in $D$ dimensions, the time required to encode logical information into the ground space is at least $\Omega(d^{1/(D1)})$, where ...
We consider the problem of preparing topologically ordered states using unitary and nonunitary circuits, as well as local timedependent Hamiltonian and Liouvillian evolutions. We prove that for any topological code in $D$ dimensions, the time required to encode logical information into the ground space is at least $\Omega(d^{1/(D1)})$, where $d$ is the code distance. This result is tight for the toric code, giving a scaling with the linear system size. More generally, we show that the linear scaling is necessary even when dropping the requirement of encoding: preparing any state close to the ground space using dissipation takes an amount of time proportional to the diameter of the system in typical 2D topologically ordered systems, as well as for example the 3D and 4D toric codes. ; Comment: 7 pages, 1 figure
Minimize
Year of Publication:
20131003
Document Type:
text
Subjects:
Quantum Physics ; Mathematical Physics
Quantum Physics ; Mathematical Physics
Minimize
URL:
http://arxiv.org/abs/1310.1037
http://arxiv.org/abs/1310.1037
Minimize
Content Provider:
ArXiv.org (Cornell University Library)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
4.
Faulttolerant logical gates in quantum errorcorrecting codes
Open Access
Title:
Faulttolerant logical gates in quantum errorcorrecting codes
Author:
Pastawski, Fernando
;
Yoshida, Beni
Pastawski, Fernando
;
Yoshida, Beni
Minimize authors
Description:
Recently, Bravyi and K\"onig have shown that there is a tradeoff between faulttolerantly implementable logical gates and geometric locality of stabilizer codes. They consider localitypreserving operations which are implemented by a constant depth geometrically local circuit and are thus faulttolerant by construction. In particular, they shown...
Recently, Bravyi and K\"onig have shown that there is a tradeoff between faulttolerantly implementable logical gates and geometric locality of stabilizer codes. They consider localitypreserving operations which are implemented by a constant depth geometrically local circuit and are thus faulttolerant by construction. In particular, they shown that, for local stabilizer codes in D spatial dimensions, locality preserving gates are restricted to a set of unitary gates known as the Dth level of the Clifford hierarchy. In this paper, we elaborate this idea and provide several extensions and applications of their characterization in various directions. First, we present a new nogo theorem for selfcorrecting quantum memory. Namely, we prove that a threedimensional stabilizer Hamiltonian with a localitypreserving implementation of a nonClifford gate cannot have a macroscopic energy barrier. Second, we prove that the code distance of a Ddimensional local stabilizer code with nontrivial localitypreserving mth level Clifford logical gate is upper bounded by $O(L^{D+1m})$. For codes with nonClifford gates (m>2), this improves the previous best bound by Bravyi and Terhal. Third we prove that a qubit loss threshold of codes with nontrivial transversal mth level Clifford logical gate is upper bounded by 1/m. As such, no family of faulttolerant codes with transversal gates in increasing level of the Clifford hierarchy may exist. This result applies to arbitrary stabilizer and subsystem codes, and is not restricted to geometricallylocal codes. Fourth we extend the result of Bravyi and K\"onig to subsystem codes. A technical difficulty is that, unlike stabilizer codes, the socalled union lemma does not apply to subsystem codes. This problem is avoided by assuming the presence of error threshold in a subsystem code, and the same conclusion as BravyiK\"onig is recovered. ; Comment: 13 pages, 4 figures
Minimize
Year of Publication:
20140807
Document Type:
text
Subjects:
Quantum Physics ; Condensed Matter  Strongly Correlated Electrons
Quantum Physics ; Condensed Matter  Strongly Correlated Electrons
Minimize
DDC:
005 Computer programming, programs & data
(computed)
URL:
http://arxiv.org/abs/1408.1720
http://arxiv.org/abs/1408.1720
Minimize
Content Provider:
ArXiv.org (Cornell University Library)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
5.
Faulttolerant logical gates in quantum errorcorrecting codes
Title:
Faulttolerant logical gates in quantum errorcorrecting codes
Author:
Pastawski, Fernando
;
Yoshida, Beni
Pastawski, Fernando
;
Yoshida, Beni
Minimize authors
Description:
Recently, S. Bravyi and R. König [Phys. Rev. Lett. 110, 170503 (2013)] have shown that there is a tradeoff between faulttolerantly implementable logical gates and geometric locality of stabilizer codes. They consider localitypreserving operations which are implemented by a constantdepth geometrically local circuit and are thus fault tolerant...
Recently, S. Bravyi and R. König [Phys. Rev. Lett. 110, 170503 (2013)] have shown that there is a tradeoff between faulttolerantly implementable logical gates and geometric locality of stabilizer codes. They consider localitypreserving operations which are implemented by a constantdepth geometrically local circuit and are thus fault tolerant by construction. In particular, they show that, for local stabilizer codes in D spatial dimensions, localitypreserving gates are restricted to a set of unitary gates known as the Dth level of the Clifford hierarchy. In this paper, we explore this idea further by providing several extensions and applications of their characterization to qubit stabilizer and subsystem codes. First, we present a nogo theorem for selfcorrecting quantum memory. Namely, we prove that a threedimensional stabilizer Hamiltonian with a localitypreserving implementation of a nonClifford gate cannot have a macroscopic energy barrier. This result implies that nonClifford gates do not admit such implementations in Haah's cubic code and Michnicki's welded code. Second, we prove that the code distance of a Ddimensional local stabilizer code with a nontrivial localitypreserving mthlevel Clifford logical gate is upper bounded by O(L^(D+1−m)). For codes with nonClifford gates (m>2), this improves the previous best bound by S. Bravyi and B. Terhal [New. J. Phys. 11, 043029 (2009)]. Topological color codes, introduced by H. Bombin and M. A. MartinDelgado [Phys. Rev. Lett. 97, 180501 (2006); Phys. Rev. Lett. 98, 160502 (2007); Phys. Rev. B 75, 075103 (2007)], saturate the bound for m=D. Third, we prove that the qubit erasure threshold for codes with a nontrivial transversal mthlevel Clifford logical gate is upper bounded by 1/m. This implies that no family of faulttolerant codes with transversal gates in increasing level of the Clifford hierarchy may exist. This result applies to arbitrary stabilizer and subsystem codes and is not restricted to geometrically local codes. Fourth, we extend the result of Bravyi and König to subsystem codes. Unlike stabilizer codes, the socalled union lemma does not apply to subsystem codes. This problem is avoided by assuming the presence of an error threshold in a subsystem code, and a conclusion analogous to that of Bravyi and König is recovered.
Minimize
Publisher:
American Physical Society
Year of Publication:
20150108
Document Type:
Article ; PeerReviewed
DDC:
005 Computer programming, programs & data
(computed)
Relations:
http://authors.library.caltech.edu/55641/1/PhysRevA.91.012305.pdf ; http://authors.library.caltech.edu/55641/2/1408.1720v1.pdf ; Pastawski, Fernando and Yoshida, Beni (2015) Faulttolerant logical gates in quantum errorcorrecting codes. Physical Review A, 91 (1). Art. No. 012305. ISSN 10502947....
URL:
http://authors.library.caltech.edu/55641/
http://resolver.caltech.edu/CaltechAUTHORS:20150309111410905
http://authors.library.caltech.edu/55641/
http://resolver.caltech.edu/CaltechAUTHORS:20150309111410905
Minimize
Content Provider:
California Institute of Technology: Caltech Authors
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
6.
Generating topological order: No speedup by dissipation
Title:
Generating topological order: No speedup by dissipation
Author:
König, Robert
;
Pastawski, Fernando
König, Robert
;
Pastawski, Fernando
Minimize authors
Description:
We consider the problem of converting a product state to a ground state of a topologically ordered system through a locally generated opensystem dynamic. Employing quantuminformation tools, we show that such a conversion takes an amount of time proportional to the diameter of the system. Our result applies to typical twodimensional topologica...
We consider the problem of converting a product state to a ground state of a topologically ordered system through a locally generated opensystem dynamic. Employing quantuminformation tools, we show that such a conversion takes an amount of time proportional to the diameter of the system. Our result applies to typical twodimensional topologically ordered systems as well as, for example, the threedimensional and fourdimensional toric codes. It is tight for the toric code, giving a scaling with the linear system size. Our results have immediate operational implications for the preparation of topologically ordered states, a crucial ingredient for topological quantum computation: Dissipation cannot provide any significant speedup compared to unitary evolution.
Minimize
Publisher:
American Physical Society
Year of Publication:
20140701
Document Type:
Article ; PeerReviewed
Relations:
http://authors.library.caltech.edu/55949/2/PhysRevB.90.045101.pdf ; http://authors.library.caltech.edu/55949/1/1310.1037v1.pdf ; http://authors.library.caltech.edu/55949/3/mainSM.pdf ; König, Robert and Pastawski, Fernando (2014) Generating topological order: No speedup by dissipation. Physical Review B, 90 (4). Art. No. 045101. ISSN 10980121....
URL:
http://authors.library.caltech.edu/55949/
http://resolver.caltech.edu/CaltechAUTHORS:20150320150651942
http://authors.library.caltech.edu/55949/
http://resolver.caltech.edu/CaltechAUTHORS:20150320150651942
Minimize
Content Provider:
California Institute of Technology: Caltech Authors
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
7.
Selective Efficient Quantum Process Tomography
Open Access
Title:
Selective Efficient Quantum Process Tomography
Author:
Bendersky, Ariel
;
Pastawski, Fernando
;
Paz, Juan Pablo
Bendersky, Ariel
;
Pastawski, Fernando
;
Paz, Juan Pablo
Minimize authors
Description:
We present a new method for quantum process tomography. The method enables us to efficiently estimate, with fixed precision, any of the parameters characterizing a quantum channel. It is selective since one can choose to estimate the value of any specific set of matrix elements of the superoperator describing the channel. Also, we show how to e...
We present a new method for quantum process tomography. The method enables us to efficiently estimate, with fixed precision, any of the parameters characterizing a quantum channel. It is selective since one can choose to estimate the value of any specific set of matrix elements of the superoperator describing the channel. Also, we show how to efficiently estimate all the average survival probabilities associated with the channel (i.e., all the diagonal elements of its $\chi$matrix. ; Comment: 4 pages
Minimize
Year of Publication:
20080104
Document Type:
text
Subjects:
Quantum Physics
Quantum Physics
Minimize
URL:
http://arxiv.org/abs/0801.0758
http://arxiv.org/abs/0801.0758
Minimize
Content Provider:
ArXiv.org (Cornell University Library)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
8.
An optimal dissipative encoder for the toric code
Open Access
Title:
An optimal dissipative encoder for the toric code
Author:
Dengis, John
;
Koenig, Robert
;
Pastawski, Fernando
Dengis, John
;
Koenig, Robert
;
Pastawski, Fernando
Minimize authors
Description:
We consider the problem of preparing specific encoded resource states for the toric code by local, timeindependent interactions with a memoryless environment. We propose a construction of such a dissipative encoder which converts product states to topologically ordered ones while preserving logical information. The corresponding Liouvillian is ...
We consider the problem of preparing specific encoded resource states for the toric code by local, timeindependent interactions with a memoryless environment. We propose a construction of such a dissipative encoder which converts product states to topologically ordered ones while preserving logical information. The corresponding Liouvillian is made up of fourlocal Lindblad operators. For a qubit lattice of size $L\times L$, we show that this process prepares encoded states in time $O(L)$, which is optimal. This scaling compares favorably with known local unitary encoders for the toric code which take time of order $\Omega(L^2)$ and require active timedependent control. ; Comment: 12 pages, 2 figures, v2: updated to match published version
Minimize
Year of Publication:
20131003
Document Type:
text
Subjects:
Quantum Physics
Quantum Physics
Minimize
URL:
http://arxiv.org/abs/1310.1036
http://arxiv.org/abs/1310.1036
Minimize
Content Provider:
ArXiv.org (Cornell University Library)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
9.
Selective and Efficient Quantum Process Tomography
Open Access
Title:
Selective and Efficient Quantum Process Tomography
Author:
Bendersky, Ariel
;
Pastawski, Fernando
;
Paz, Juan Pablo
Bendersky, Ariel
;
Pastawski, Fernando
;
Paz, Juan Pablo
Minimize authors
Description:
In this paper we describe in detail and generalize a method for quantum process tomography that was presented in [A. Bendersky, F.
Pastawski
, J. P. Paz, Physical Review Letters 100, 190403 (2008)]. The method enables the efficient estimation of any element of the $\chi$matrix of a quantum process. Such elements are estimated as averages over e...
In this paper we describe in detail and generalize a method for quantum process tomography that was presented in [A. Bendersky, F.
Pastawski
, J. P. Paz, Physical Review Letters 100, 190403 (2008)]. The method enables the efficient estimation of any element of the $\chi$matrix of a quantum process. Such elements are estimated as averages over experimental outcomes with a precision that is fixed by the number of repetitions of the experiment. Resources required to implement it scale polynomically with the number of qubits of the system. The estimation of all diagonal elements of the $\chi$matrix can be efficiently done without any ancillary qubits. In turn, the estimation of all the offdiagonal elements requires an extra clean qubit. The key ideas of the method, that is based on efficient estimation by random sampling over a set of states forming a 2design, are described in detail. Efficient methods for preparing and detecting such states are explicitly shown. ; Comment: 9 pages, 5 figures
Minimize
Year of Publication:
20090616
Document Type:
text
Subjects:
Quantum Physics
Quantum Physics
Minimize
URL:
http://arxiv.org/abs/0906.3002
http://arxiv.org/abs/0906.3002
Minimize
Content Provider:
ArXiv.org (Cornell University Library)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
10.
Unfolding the color code
Open Access
Title:
Unfolding the color code
Author:
Kubica, Aleksander
;
Yoshida, Beni
;
Pastawski, Fernando
Kubica, Aleksander
;
Yoshida, Beni
;
Pastawski, Fernando
Minimize authors
Description:
The topological color code and the toric code are two leading candidates for realizing faulttolerant quantum computation. Here we show that the color code on a $d$dimensional closed manifold is equivalent to multiple decoupled copies of the $d$dimensional toric code up to local unitary transformations and adding or removing ancilla qubits. Ou...
The topological color code and the toric code are two leading candidates for realizing faulttolerant quantum computation. Here we show that the color code on a $d$dimensional closed manifold is equivalent to multiple decoupled copies of the $d$dimensional toric code up to local unitary transformations and adding or removing ancilla qubits. Our result not only generalizes the proven equivalence for $d=2$, but also provides an explicit recipe of how to decouple independent components of the color code, highlighting the importance of colorability in the construction of the code. Moreover, for the $d$dimensional color code with $d+1$ boundaries of $d+1$ distinct colors, we find that the code is equivalent to multiple copies of the $d$dimensional toric code which are attached along a $(d1)$dimensional boundary. In particular, for $d=2$, we show that the (triangular) color code with boundaries is equivalent to the (folded) toric code with boundaries. We also find that the $d$dimensional toric code admits logical nonPauli gates from the $d$th level of the Clifford hierarchy, and thus saturates the bound by Bravyi and K\"{o}nig. In particular, we show that the $d$qubit control$Z$ logical gate can be faulttolerantly implemented on the stack of $d$ copies of the toric code by a local unitary transformation. ; Comment: 46 pages, 15 figures
Minimize
Year of Publication:
20150306
Document Type:
text
Subjects:
Quantum Physics
Quantum Physics
Minimize
DDC:
005 Computer programming, programs & data
(computed)
URL:
http://arxiv.org/abs/1503.02065
http://arxiv.org/abs/1503.02065
Minimize
Content Provider:
ArXiv.org (Cornell University Library)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
Export Record
All Records
Export
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Adjust your hit list
Sort Your Results
Refine Search Result
More Options
Sort Your Results
Sort by:
Relevance
Author, ZA
Author, AZ
Title, AZ
Title, ZA
Date of publication, descending
Date of publication, ascending
Refine Search Result
Author
(19) Pastawski, Fernando
(4) Yoshida, Beni
(3) Cirac, J. Ignacio
(3) Cucchietti, Fernando M.
(3) Jiang, Liang
(3) König, Robert
(3) Lukin, Mikhail D.
(3) Pastawski, Horacio M.
(3) Yao, Norman Y.
(2) Bendersky, Ariel
(2) Cirac, Ignacio
(2) Dengis, John
(2) Kay, Alastair
(2) Koenig, Robert
(2) Paz, Juan Pablo
(2) Preskill, John
(2) Schuch, Norbert
(2) The Pennsylvania State University CiteSeerX...
(1) Benjamin Gregoire
(1) Beverland, Michael E.
(1) Cirac, Juan Ignacio
(1) Clemente, Lucas
(1) Cucchietti, Fernando Martín
(1) Director A Soledad Abstract
(1) Dr. Horacio
(1) Fernando Martín Cucchietti
(1) Fernando Pastawski
(1) Gilles Barthe
(1) Harlow, Daniel
(1) Jalabert, Rodolfo A.
(1) Kastoryano, Michael J.
(1) Kubica, Aleksander
(1) Lewenkopf, Caio H.
(1) Lic Fernando
(1) M. Cucchietti
(1) M. Pastawski
(1) Pastawski, Horacio Miguel
(1) Sijher, Sumit
(1) Temme, Kristan
(1) Vergini, Eduardo
(1) Wisniacki, Diego A.
Author:
Subject
(16) quantum physics
(3) nonlinear sciences chaotic dynamics
(2) condensed matter strongly correlated electrons
(2) mathematical physics
(1) caos
(1) chaos
(1) condensed matter disordered systems and neural...
(1) condensed matter mesoscale and nanoscale physics
(1) condensed matter statistical mechanics
(1) decoherence
(1) decoherencia
(1) fakultät für physik
(1) high energy physics theory
(1) mecánica cuántica
(1) open systems
(1) physical sciences
(1) quantum mechanics
(1) relajación
(1) semiclassical theories and applications
(1) sistemas abiertos
(1) teoría de la decoherencia
(1) teorías semiclásicas
Subject:
Dewey Decimal Classification (DDC)
(5) Mathematics [51*]
(3) Computer science, knowledge & systems [00*]
(3) Modern western philosophy [19*]
(1) Physics [53*]
(1) Chemistry [54*]
Dewey Decimal Classification (DDC):
Year of Publication
(5) 2014
(4) 2009
(4) 2012
(3) 2015
(2) 2013
(1) 2001
(1) 2003
(1) 2004
(1) 2006
(1) 2008
(1) 2010
(1) 2011
Year of Publication:
Content Provider
(16) ArXiv.org
(4) Caltech: Authors
(2) CiteSeerX
(1) Munich LMU: Digital theses
(1) PubMed Central
(1) Córdoba Univ. Nacional: Repositorio Digital
Content Provider:
Language
(21) Unknown
(3) English
(1) Spanish; Castilian
Language:
Document Type
(19) Text
(4) Article, Journals
(1) Theses
(1) Unknown
Document Type:
Access
(19) Open Access
(6) Unknown
Access:
More Options
»
Search History
»
Get RSS Feed
»
Get ATOM Feed
»
Email this Search
»
Save Search
»
Browsing
»
Search Plugin
Further result pages
Results:
1

2

3
Next »
New Search »
Currently in BASE: 72,227,055 Documents of 3,466
Content Sources
About BASE

Contact

BASE Lab

Imprint
© 20042015 by
Bielefeld University Library
Search powered by
Solr
&
VuFind
.
Suggest Repository
BASE Interfaces
Currently in BASE: 72,227,055 Documents of 3,466 Content Sources
http://www.basesearch.net