English
Related papers

Related papers: Characterization of two-qubit perfect entanglers

200 papers

The information obtained from the operation of a quantum gate on only two complementary sets of input states is sufficient to estimate the quantum process fidelity of the gate. In the case of entangling gates, these conditions can be used…

Quantum Physics · Physics 2017-08-23 Holger F. Hofmann , Ryo Okamoto , Shigeki Takeuchi

Non-local properties of ensembles of quantum gates induced by the Haar measure on the unitary group are investigated. We analyze the entropy of entanglement of a unitary matrix U equal to the Shannon entropy of the vector of singular values…

Quantum Physics · Physics 2013-05-01 Marcin Musz , Marek Kus , Karol Zyczkowski

We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…

Quantum Physics · Physics 2013-05-29 C. Kruszynska , B. Kraus

Until recently, it was an important open problem in Fractal Geometry to determine whether there exists an iterated function system acting on $\mathbb{R}$ with no exact overlaps for which cylinders are super-exponentially close at all small…

Dynamical Systems · Mathematics 2020-07-23 Simon Baker

We demonstrate that conditional as well as unconditional basic operations which are prerequisite for universal quantum gates can be performed with almost 100% fidelity within a strongly interacting two-electron quantum ring. Both sets of…

Mesoscale and Nanoscale Physics · Physics 2016-08-14 Lene Sælen , Erik Waltersson , J. P. Hansen , Eva Lindroth

Exact synthesis provides unconditional optimality and canonical structure, but is often limited to small, carefully scoped regimes. We present an exact synthesis framework for two-qubit circuits over the Clifford+$T$ gate set that optimizes…

Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such…

A quantum algorithm can be decomposed into a sequence consisting of single qubit and 2-qubit entangling gates. To optimize the decomposition and achieve more efficient construction of the quantum circuit, we can replace multiple 2-qubit…

While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and…

Quantum Physics · Physics 2025-09-15 Sergey Mironov , Andrey Morozov

The quantum computing paradigm in photonics currently relies on the multi-port interference in linear optical devices, which is intrinsically based on probabilistic measurements outcome and thus non-deterministic. Devising a fully…

Quantum Physics · Physics 2024-05-10 Francesco Scala , Davide Nigro , Dario Gerace

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…

Quantum Physics · Physics 2023-03-22 Javed Akram

The ability to perform entangling quantum operations with low error rates in a scalable fashion is a central element of useful quantum information processing. Neutral atom arrays have recently emerged as a promising quantum computing…

One of the essential features of quantum mechanics is that most pairs of observables cannot be measured simultaneously. This phenomenon is most strongly manifested when observables are related to mutually unbiased bases. In this paper, we…

Quantum Physics · Physics 2015-05-27 M. Wiesniak , T. Paterek , A. Zeilinger

When a two-qubit system is initially maximally-entangled, two independent decoherence channels, one per qubit, would greatly reduce the entanglement of the two-qubit system when it reaches its stationary state. We propose a method on how to…

Quantum Physics · Physics 2009-09-30 Jing Zhang , Yu-xi Liu , Chun-Wen Li , Tzyh-Jong Tarn , Franco Nori

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…

Quantum Physics · Physics 2022-09-23 M. Pechal , G. Salis , M. Ganzhorn , D. J. Egger , M. Werninghaus , S. Filipp

Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…

Quantum Physics · Physics 2008-12-18 Michel Planat , Philippe Jorrand

A generic scheme for the parametrization of mixed state systems is introduced, which is then adapted to bipartite systems, especially to a 2-qubit system. Various features of 2-qubit entanglement are analyzed based on the scheme. Our…

Quantum Physics · Physics 2022-07-15 Otto C. W. Kong , Hock King Ting

A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…

Condensed Matter · Physics 2009-10-22 David P. Divincenzo

We study the set of two-qubit pure states with real amplitudes and their geometrical representation in the three-dimensional sphere. In this representation, we show that the maximally entangled states --those locally equivalent to the Bell…

Quantum Physics · Physics 2019-12-12 Oscar Perdomo , Vicente Leyton-Ortega , Alejandro Perdomo-Ortiz

We characterize entanglement subject to its definition over real and complex, composite quantum systems. In particular, a method is established to assess quantum correlations with respect to a selected number system, illuminating the deeply…

‹ Prev 1 3 4 5 6 7 10 Next ›