Related papers: Interaction cost of non-local gates
As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we…
I present a simple two-party quantum communication complexity protocol with higher success rate than the best possible classical protocol for the same task. The quantum protocol is shown to be equivalent to a quantum non-locality test,…
Today's devices for quantum computing are still far from implementing useful and powerful quantum algorithms. Decoherence and the wish to resist the effects of errors in a system of quantum bits incurs a lot of overhead in the number of…
Correlated electron materials, such as superconductors and magnetic materials, are regarded as fascinating targets in quantum computing. However, the quantitative resources, specifically the number of quantum gates and qubits, required to…
We study non-local two-qubit operations from a geometric perspective. By applying a Cartan decomposition to su(4), we find that the geometric structure of non-local gates is a 3-Torus. We derive the invariants for local transformations, and…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…
We propose a scheme to eliminate the effect of non-nearest-neighbor qubits in preparing cluster state with double-dot molecules. As the interaction Hamiltonians between qubits are Ising-model and mutually commute, we can get positive and…
Implementing quantum operations in the form of natural Hamiltonian dynamics is desirable, since they almost require no external control or feedback. In this work, we propose a NISQ-friendly quantum-classical hybrid approach to designing a…
We consider unitary dynamical evolutions on n qubits caused by time dependent pair-interaction Hamiltonians and show that the running time of a parallelized two-qubit gate network simulating the evolution is given by the time integral over…
Quantum information processing is the emerging field that defines and realizes computing devices that make use of quantum mechanical principles, like the superposition principle, entanglement, and interference. In this review we study the…
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…
It is shown that a quantum controlled-NOT gate simultaneously performs the logical functions of three distinct conditional local operations. Each of these local operations can be verified by measuring a corresponding truth table of four…
Quantum random-access look-up of a string of classical bits is a necessary ingredient in several important quantum algorithms. In some cases, the cost of such quantum random-access memory (qRAM) is the limiting factor in the implementation…
Entanglement appears in two different ways in quantum mechanics, namely as a property of states and as a property of measurement outcomes in joint measurements. By combining these two aspects of entanglement, it is possible to generate…
We consider a typical realization of a qubit as a single particle in two-path interferometric circuits built from phase shifters, beam splitters and detectors. This framework is often taken as a standard example illustrating various…
Non-local higher-energy auxiliary states have been successfully used to entangle pairs of qubits in different quantum computing systems. Typically a longer-span non-local state or sequential application of few-qubit entangling gates are…
It has been more than 20 years since Deutsch and Hayden demonstrated that quantum systems can be completely described locally -- notwithstanding Bell's theorem. More recently, Raymond-Robichaud proposed two other approaches to the same…
The cost of enabling connectivity in Noisy-Intermediate-Scale-Quantum devices is an important factor in determining computational power. We have created a qubit routing algorithm which enables efficient global connectivity in a previously…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…