Related papers: Interaction cost of non-local gates

Interactions among qubits are essential for performing two-qubit quantum logic operations. However, nature gives us only nearest neighbor interactions in simple and controllable settings. Here we propose a strategy to induce interactions…

The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets…

In this paper, we show that the ability to switch globally between two 2-local Hamiltonians on n qubits is sufficient for achieving universal unitary dynamics on those n qubits. Of the two Hamiltonians used in the construction, one is…

Simulating quantum nonlocality and steering requires augmenting pre-shared randomness with non-vanishing communication cost. This prompts the question of how one may provide such an operational characterization for the quantumness of…

Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…

The concept of negative probabilities can be used to decompose the interaction of two qubits mediated by a quantum controlled-NOT into three operations that require only classical interactions (that is, local operations and classical…

We consider the simulation of the dynamics of one nonlocal Hamiltonian by another, allowing arbitrary local resources but no entanglement nor classical communication. We characterize notions of simulation, and proceed to focus on…

In circuit-based quantum computing, the available gate set typically consists of single-qubit gates acting on each individual qubit and at least one entangling gate between pairs of qubits. In certain physical architectures, however, some…

Effective quantum information processing is tantamount in part to the minimization the quantum resources needed by quantum logic gates. Here, we propose an optimization of an n-controlled-qubit Fredkin gate with a maximum of 2n+1 two-qubit…

Achieving low-error, exchange-interaction operations in quantum dots for quantum computing imposes simultaneous requirements on the exchange energy's dependence on applied voltages. A double quantum dot (DQD) qubit, approximated with a…

The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…

We quantify the capability of creating entanglement for a general physical interaction acting on two qubits. We give a procedure for optimizing the generation of entanglement. We also show that a Hamiltonian can create more entanglement if…

Several proposed quantum computer models include measurement processes, in order to implement nonlocal gates and create necessary entanglement resources during the computation. We introduce a scheme in which the measurements can be delayed…

The "entanglement cost" of a bipartite measurement is the amount of shared entanglement two participants need to use up in order to carry out the given measurement by means of local operations and classical communication. Here we…

We propose general methodology of deterministic single-mode quantum interaction nonlinearly modifying single quadrature variable of a continuous variable system. The methodology is based on linear coupling of the system to ancillary systems…

Quantifying the effect of noise on unitary operations is an essential task in quantum information processing. We propose the quantum Wasserstein distance between unitary operations, which shows an explanation for quantum circuit complexity…

By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with…

We introduce an alternative way to understand the decomposition of a quantum system into interacting parts and show that it is natural in several physical models. This enables us to define a reduced density operator for a working system…

An implementation method of a gate in a quantum computer is studied in terms of a finite number of steps evolving in time according to a finite number of basic Hamiltonians, which are controlled by on-off switches. As a working example, the…

We study the low energy states of finite spin chains with isotropic (Heisenberg) and anisotropic (XY and Ising-like) exchange interaction with uniform and non-uniform coupling constants. We show that for an odd number of sites a spin…