Loading

Error: Cannot Load Popup Box

Hit List

Title:

Contents

Author:

Description:

Measurement-based quantum

Measurement-based quantum Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2008-07-01

Source:

http://edoc.ub.uni-muenchen.de/1367/1/Raussendorf_Robert.pdf

http://edoc.ub.uni-muenchen.de/1367/1/Raussendorf_Robert.pdf 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:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Quantum computation, discreteness, and contextuality

Description:

We establish a link between contextuality of quantum mechanics and quantum-mechanical computation. Specifically, we show that no deterministic measurement-based quantum computation evaluating a non-linear function can be described by a non-contextual hidden-variable model. We give examples for such computations derived from quantum codes with su...

We establish a link between contextuality of quantum mechanics and quantum-mechanical computation. Specifically, we show that no deterministic measurement-based quantum computation evaluating a non-linear function can be described by a non-contextual hidden-variable model. We give examples for such computations derived from quantum codes with suitable transversality properties, and from a counterexample to the LU-LC conjecture. 1 Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2013-08-04

Source:

http://arxiv.org/pdf/0907.5449v1.pdf

http://arxiv.org/pdf/0907.5449v1.pdf 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:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Computational model underlying the one-way quantum computer

Description:

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-wa...

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step. 1 Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2011-11-18

Source:

http://www.hep.princeton.edu/%7Emcdonald/examples/QM/raussendorf_quant-ph-0108067.pdf

http://www.hep.princeton.edu/%7Emcdonald/examples/QM/raussendorf_quant-ph-0108067.pdf 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:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Aone-way quantum computer

Author:

Description:

one-way quantum computer—a non-network model of

one-way quantum computer—a non-network model of Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2011-11-18

Source:

http://www.hep.princeton.edu/%7Emcdonald/examples/QM/raussendorf_jmo_49_1299_02.pdf

http://www.hep.princeton.edu/%7Emcdonald/examples/QM/raussendorf_jmo_49_1299_02.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Title not available

Description:

Computational model underlying the one-way quantum computer

Computational model underlying the one-way quantum computer Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2012-12-05

Source:

http://arxiv.org/pdf/quant-ph/0108067v1.pdf

http://arxiv.org/pdf/quant-ph/0108067v1.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Computational model underlying the one-way quantum computer

Description:

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-wa...

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step. 1 Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2012-12-05

Source:

http://arxiv.org/pdf/quant-ph/0108067v2.pdf

http://arxiv.org/pdf/quant-ph/0108067v2.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Title not available

Author:

Description:

The one-way quantum computer – a non-network model of quantum computation

The one-way quantum computer – a non-network model of quantum computation Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2012-12-05

Source:

http://arxiv.org/pdf/quant-ph/0108118v1.pdf

http://arxiv.org/pdf/quant-ph/0108118v1.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Contextuality in Measurement-based Quantum Computation

Description:

We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a non-linear Boolean function with high probability are contextual. The class of contextual MBQCs includes an example which is of practical interest and has a super-polynomial speedup over the best known classical algorithm, na...

We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a non-linear Boolean function with high probability are contextual. The class of contextual MBQCs includes an example which is of practical interest and has a super-polynomial speedup over the best known classical algorithm, namely the quantum algorithm that solves the Discrete Log problem. ; Comment: Version 3: probabilistic version of Theorem 1 added Minimize

Year of Publication:

2009-07-30

Document Type:

text

Subjects:

Quantum Physics

Quantum Physics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Quantum computation via translation-invariant operations on a chain of qubits

Description:

A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are translation-invariant. ; Comment: Comment after Eq. (2) inserted, journal version

A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are translation-invariant. ; Comment: Comment after Eq. (2) inserted, journal version Minimize

Year of Publication:

2005-05-16

Document Type:

text

Subjects:

Quantum Physics

Quantum Physics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

A quantum cellular automaton for universal quantum computation

Description:

I describe a quantum cellular automaton capable of performing universal quantum computation. The automaton has an elementary transition function that acts on Margolus cells of $2\times 2$ qubits, and both the ``quantum input'' and the program are encoded in the initial state of the system. ; Comment: 4 pages, 3 figures

I describe a quantum cellular automaton capable of performing universal quantum computation. The automaton has an elementary transition function that acts on Margolus cells of $2\times 2$ qubits, and both the ``quantum input'' and the program are encoded in the initial state of the system. ; Comment: 4 pages, 3 figures Minimize

Year of Publication:

2004-12-06

Document Type:

text

Subjects:

Quantum Physics

Quantum Physics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Currently in BASE: 68,072,316 Documents of 3,307 Content Sources

http://www.base-search.net