Related papers: Separation and approximate separation of multipart…

Universal fault-tolerant quantum computers require millions of qubits with low error rates. Since this technology is years ahead, noisy intermediate-scale quantum (NISQ) computation is receiving tremendous interest. In this setup, quantum…

We propose a two-qubit collisional phase gate that can be implemented with available atom chip technology, and present a detailed theoretical analysis of its performance. The gate is based on earlier phase gate schemes, but uses a qubit…

As the field of quantum computing grows, novel algorithms which take advantage of quantum phenomena need to be developed. As we are currently in the NISQ (noisy intermediate scale quantum) era, quantum algorithm researchers cannot reliably…

The concept of entanglement and separability of quantum states is relevant for several fields in physics. Still, there is a lack of effective operational methods to characterise these features. We propose a method to certify quantum…

Semiconductors, a significant type of material in the information era, are becoming more and more powerful in the field of quantum information. In the last decades, semiconductor quantum computation was investigated thoroughly across the…

The computational power of a quantum computer is limited by the number of qubits available for information processing. Increasing this number within a single device is difficult; it is widely accepted that distributed modular architectures…

In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…

We theoretically study specific schemes for performing a fundamental two-qubit quantum gate via controlled atomic collisions by switching microscopic potentials. In particular we calculate the fidelity of a gate operation for a…

It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly…

Quantum computing is a new way of data processing based on the concept of quantum mechanics. Quantum circuit design is a process of converting a quantum gate to a series of basic gates and is divided into two general categories based on the…

Large-scale quantum computers will require quantum gate operations between widely separated qubits. A method for implementing such operations, known as quantum gate teleportation (QGT), requires only local operations, classical…

Quantum computing holds great promise for surpassing the limits of classical devices in many fields. Despite impressive developments, however, current research is primarily focused on qubits. At the same time, quantum hardware based on…

Multipartite entanglement is an essential aspect of quantum systems, needed to execute quantum algorithms, implement error correction, and achieve quantum-enhanced sensing. In solid-state quantum registers such nitrogen-vacancy (NV) centers…

Adversarial robustness in quantum classifiers is a critical area of study, providing insights into their performance compared to classical models and uncovering potential advantages inherent to quantum machine learning. In the NISQ era of…

We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…

The purpose of this paper is to explore the applications of quantum computing to energy systems optimization problems and discuss some of the challenges faced by quantum computers with techniques to overcome them. The basic concepts…

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,…

A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…

Qubit loss and gate failure are significant obstacles for the implementation of scalable quantum computation. Recently there have been several proposals for overcoming these problems, including schemes based on parity and cluster states.…

We study separability criteria in multipartite quantum systems of arbitrary dimensions by using the Bloch representation of density matrices. We first derive the norms of the correlation tensors and obtain the necessary conditions for…