Related papers: Classification of nonlocal two-qubit gates using S…
We consider quantum circuits composed of Clifford and T gates. In this context the T gate has a special status since it confers universal computation when added to the (classically simulable) Clifford gates. However it can be very expensive…
The phenomenon of quantum entanglement is fundamental to the implementation of quantum computation, and requires at least two qubits for its demonstration. However, both Deutsch algorithm and Grover's search algorithm for two bits do not…
In this paper we apply the canonical decomposition of two qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the CNOT, swap, square root of swap and controlled Z…
We study how much noise can be tolerated by a universal gate set before it loses its quantum-computational power. Specifically we look at circuits with perfect stabilizer operations in addition to imperfect non-stabilizer gates. We prove…
Multi-controlled Pauli gates are typical high-level qubit operations that appear in the quantum circuits of various quantum algorithms. We find multi-controlled Pauli gate decompositions with smaller CNOT-count or $T$-depth while keeping…
The thesis includes the original results of our articles [30, 37, 40, 42, 51, 53, 75]. A method is developed to compute analytically entanglement measures of three-qubit pure states. Owing to it closed-form expressions are presented for the…
Multi-controlled single-target (MC) gates are some of the most crucial building blocks for varied quantum algorithms. How to implement them optimally is thus a pivotal question. To answer this question in an architecture-independent manner,…
We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of Controlled-NOT (C-NOT) gates required (single-qubit gates are free). We consider three…
The bipartite entanglement of a pure quantum state is known to be characterized by its Schmidt decomposition. In particular the state is maximally entangled when all the Schmidt coefficients are equal. We point out a convenient method which…
The Schmidt number is an important kind of characterization of quantum entanglement. Quantum states with higher Schmidt numbers demonstrate significant advantages in various quantum information processing tasks. By deriving a class of…
Implementation of high-dimensional (HD) quantum gates shows very promising perspectives for HD quantum computation. A bipartite quantum system with arbitrary dimensions $n$ and $m$ is termed a quNit-quMit. Here we propose a synthesis scheme…
The realization of strong photon-photon interactions has presented an enduring challenge across photonics, particularly in quantum computing, where two-photon gates form essential components for scalable quantum information processing…
Given a quantum gate $U$ acting on a bipartite quantum system, its maximum (average, minimum) entangling power is the maximum (average, minimum) entanglement generation with respect to certain entanglement measure when the inputs are…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
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…
We combine numerical optimization techniques [Uskov et al., Phys. Rev. A 79, 042326 (2009)] with symmetries of the Weyl chamber to obtain optimal implementations of generic linear-optical KLM-type two-qubit entangling gates. We find that…
Calibration of quantum gates is a necessary hurdle to overcome on the way to a reliable quantum computer. In a recent paper, a protocol called Gate Set Calibration protocol (GSC) has been introduced and used to learn coherent errors from…
High-dimensional entanglement, captured by the Schmidt number, underpins advantages in quantum information tasks, yet a unified resource-theoretic description across different Buscemi-type operational objects has been missing. Here we…
Quantum gates, that play a fundamental role in quantum computation and other quantum information processes, are unitary evolution operators $\hat U$ that act on a composite system changing its entanglement. In the present contribution we…
When two or more subsystems of a quantum system interact with each other they can become entangled. In this case the individual subsystems can no longer be described as pure quantum states. For systems with only 2 subsystems this…