Related papers: Use of global interactions in efficient quantum ci…
We show that parametric coupling techniques can be used to generate selective entangling interactions for multi-qubit processors. By inducing coherent population exchange between adjacent qubits under frequency modulation, we implement a…
Fast entangling gate operations are a fundamental prerequisite for quantum simulation and computation. We propose an entangling scheme for arbitrary pairs of ions in a linear crystal, harnessing the high electric polarizability of highly…
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…
This paper investigates quantum communication using superconducting qubits, emphasizing the simulation and control of quantum systems via IBM Brisbane quantum processor. We focus on implementing fundamental quantum gates and analyzing the…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
We construct a quantum gate entangler based on selective phase rotation transform. In particular, we established a relation between quantum integral transform and quantum gates entangler in terms of universal controlled gates for…
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of near-term quantum devices. We introduce…
We construct quantum gate entangler for general multipartite states based on topological unitary operators. We show that these operators can entangle quantum states if they satisfy the separability condition that is given by the complex…
The execution of quantum circuits on real systems has largely been limited to those which are simply time-ordered sequences of unitary operations followed by a projective measurement. As hardware platforms for quantum computing continue to…
We consider the entanglement manipulation capabilities of the universal covariant quantum cloner or quantum processor circuit for quantum bits. We investigate its use for cloning a member of a bipartite or a genuine tripartite entangled…
Implementation of logical entangling gates is an important step towards realizing a quantum computer. We use a gradient-based optimization approach to find single-qubit rotations which can be interleaved between applications of a noisy…
We establish the entangling power of a unitary operator on a general finite-dimensional bipartite quantum system with and without ancillas, and give relations between the entangling power based on the von Neumann entropy and the entangling…
We present a theoretical analysis of the paradigm of encoded universality, using a Lie algebraic analysis to derive specific conditions under which physical interactions can provide universality. We discuss the significance of the tensor…
We demonstrate high fidelity entangling quantum gates within a chain of five trapped ion qubits by optimally shaping optical fields that couple to multiple collective modes of motion. We individually address qubits with segmented optical…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…
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…
Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…