Parallelizable adiabatic gate teleportation

Nakago, Kosuke; Hajdušek, Michal; Nakayama, Shojun; Murao, Mio

doi:10.1103/physreva.92.062316

Cited by 5 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instead, we use additional degrees of freedom of our qubits to control the order with which they traverse the gates. Note that other implementations have been independently proposed, both making use of internal degrees of freedom (G. Chiribella, R. Ionicioiu, T. Jennewein and D. Terno, personal communication, July 2012) 10 23 24 , and in adiabatic quantum computing 25 . The internal degrees of freedom could be any degrees of freedom of the physical system that the qubits are encoded in.…”

Section: Resultsmentioning

confidence: 99%

Experimental superposition of orders of quantum gates

et al. 2015

View full text Add to dashboard Cite

Quantum computers achieve a speed-up by placing quantum bits (qubits) in superpositions of different states. However, it has recently been appreciated that quantum mechanics also allows one to ‘superimpose different operations'. Furthermore, it has been shown that using a qubit to coherently control the gate order allows one to accomplish a task—determining if two gates commute or anti-commute—with fewer gate uses than any known quantum algorithm. Here we experimentally demonstrate this advantage, in a photonic context, using a second qubit to control the order in which two gates are applied to a first qubit. We create the required superposition of gate orders by using additional degrees of freedom of the photons encoding our qubits. The new resource we exploit can be interpreted as a superposition of causal orders, and could allow quantum algorithms to be implemented with an efficiency unlikely to be achieved on a fixed-gate-order quantum computer.

show abstract

Section: Resultsmentioning

confidence: 99%

Experimental superposition of orders of quantum gates

et al. 2015

View full text Add to dashboard Cite

show abstract

“…Other realizations of superposition of orders, based on different models of computation, could also be possible. For example, an implementation of the 2-switch within adiabatic quantum computing was proposed recently [17].…”

mentioning

confidence: 99%

Computational Advantage from Quantum-Controlled Ordering of Gates

2014

View full text Add to dashboard Cite

It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more general kind of quantum computing that allows transformations on blackbox quantum gates that are impossible in a circuit with fixed order. Here we show that this model of quantum computing is physically realizable, by proposing an interferometric setup that can implement such a quantum control of the order between the gates. We show that this new resource provides a reduction in computational complexity: we propose a problem that can be solved by using OðnÞ blackbox queries, whereas the best known quantum algorithm with fixed order between the gates requires Oðn 2 Þ queries. Furthermore, we conjecture that solving this problem in a classical computer takes exponential time, which may be of independent interest. A useful tool to calculate the complexity of a quantum algorithm is the blackbox model of quantum computation. In this model, the input to the computation is encoded in a unitary gate-treated as a blackbox-and the complexity of the algorithm is the number of times this gate has to be queried to solve the problem.Typically, blackbox computation is studied within the quantum circuit formalism [1]. A quantum circuit consists of a collection of wires, representing quantum systems, that connect boxes, representing unitary transformations. In this framework, wires are assumed to connect the various gates in a fixed structure; thus, the order in which the gates are applied is determined in advance and independently of the input states. It was first proposed in Ref.[2] that such a constraint can be relaxed: one can consider situations where the wires, and thus the order between gates, can be controlled by some extra variable. This is natural if one thinks of the circuit's wires as quantum systems that can be in superposition.Such "superpositions of orders" allow performing information-theoretical tasks that are impossible in the quantum circuit model: it was shown in Ref.[3] that it is possible to decide whether a pair of blackbox unitaries commute or anticommute with a single use of each unitary, whereas in a circuit with a fixed order at least one of the unitaries must be used twice. (The same task was considered in a quantum optics context in Ref. [4], where a less efficient protocol was found.)It was not known, however, whether this advantage can be translated into more efficient algorithms for quantum computing, i.e., if a quantum computer that can control the order between gates can solve a computational problem with asymptotically less resources than a quantum computer with fixed circuit structure.Here we present such a problem: given a set of n unitary matrices and the promise that they satisfy one out of n! specific properties, find which property is satisfied. The essential resource to solve this problem is the quantum control over the order of n blackboxes, first in...

show abstract

“…These requirements for a process matrix to be consistent with quantum mechanics can be interpreted as a new kind of causality, which is different from the special relativistic causality but based only on quantum mechanics. The process matrix shows a new possibility for increasing the speed of quantum computers [20], and implementations of the process matrix are discussed for several settings [21,22].…”

Section: Locc* and Classical Process Matrixmentioning

confidence: 99%

Entanglement-assisted classical communication can simulate classical communication without causal order

et al. 2017

Self Cite

View full text Add to dashboard Cite

Phenomena induced by the existence of entanglement, such as nonlocal correlations, exhibit characteristic properties of quantum mechanics distinguishing from classical theories. When entanglement is accompanied by classical communication, it enhances the power of quantum operations jointly performed by two spatially separated parties. Such a power has been analyzed by the gap between the performances of joint quantum operations implementable by local operations at each party connected by classical communication with and without the assistance of entanglement. In this work, we present a new formulation for joint quantum operations connected by classical communication beyond special relativistic causal order but without entanglement and still within quantum mechanics. Using the formulation, we show that entanglement assisting classical communication necessary for implementing a class of joint quantum operations called separable operations can be interpreted to simulate "classical communication" not respecting causal order. Our results reveal a new counter-intuitive aspect of entanglement related to spacetime.

show abstract

Parallelizable adiabatic gate teleportation

Cited by 5 publications

References 29 publications

Experimental superposition of orders of quantum gates

Experimental superposition of orders of quantum gates

Computational Advantage from Quantum-Controlled Ordering of Gates

Entanglement-assisted classical communication can simulate classical communication without causal order

Contact Info

Product

Resources

About