Related papers: A geometric theory of non-local two-qubit operatio…

Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal…

This study examines the possibility of finding perfect entanglers for a Hamiltonian which corresponds to several quantum information platforms of interest at the present time. However, in this study, we use a superconducting circuit that…

The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear…

The characterization of quantum correlations, being stronger than classical, yet weaker than those appearing in non-signaling models, still poses many riddles. In this work we show that the extent of binary correlations in a general class…

The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two…

Achieving high-fidelity two-qubit gates is crucial for spin qubits in silicon double quantum dots. However, the two-qubit gates in experiments are easily suffered from charge noise, which is still a key challenge. Geometric gates which…

Quantum nonlocality has recently been intensively studied in connection to device-independent quantum information processing, where the extremal points of the set of quantum correlations play a crucial role through self-testing. In most…

We construct a quantum algorithm that creates the Laughlin state for an arbitrary number of particles $n$ in the case of filling fraction one. This quantum circuit is efficient since it only uses $n(n-1)/2$ local qudit gates and its depth…

An important result in the theory of quantum control is the "universality" of $2$-local unitary gates, i.e. the fact that any global unitary evolution of a system of $L$ qudits can be implemented by composition of $2$-local unitary gates.…

We provide several applications of a previously introduced isomorphism between physical operations acting on two systems and entangled states [1]. We show: (i) how to implement (weakly) non-local two qubit unitary operations with a small…

An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single…

Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…

We provide exact results for the dynamics of local-operator entanglement in quantum circuits with two-dimensional wires featuring ultralocal solitons, i.e. single-site operators which, up to a phase, are simply shifted by the time…

We study bipartite unitary operators which stay invariant under the local actions of diagonal unitary and orthogonal groups. We investigate structural properties of these operators, arguing that the diagonal symmetry makes them suitable for…

The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally,…

We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…

A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…

To each local field (including the real or complex numbers) we associate a quantum dilogarithm and show that it satisfies a pentagon identity and some symmetries. Using an angled version of these quantum dilogarithms, we construct three…

Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…

Instantaneous non-local quantum computation requires multiple parties to jointly perform a quantum operation, using pre-shared entanglement and a single round of simultaneous communication. We study this task for its close connection to…