Related papers: Mapping of Quantum Systems to the Probability Simp…
The qubit SWAP gate has been shown to be an integral component of quantum circuitry design. It permutes the states of two qubits and allows for the storage quantum information, teleportation of atomic or ionic states, and is a fundamental…
An algebraic analysis of Grover's quantum search algorithm is presented for the case in which the initial state is an arbitrary pure quantum state of n qubits. This approach reveals the geometrical structure of the quantum search process,…
Quantum state tomography is the experimental procedure of determining an unknown state. It is not only essential for the verification of resources and processors of quantum information but is also important in its own right with regard to…
Is it possible to infer the time evolving quantum state of a multichromophoric system from a sequence of two-dimensional electronic spectra (2D-ES) as a function of waiting time? Here we provide a positive answer for a tractable model…
It is well-known that maximally entangled states such as the Greenberger-Horne-Zeilinger (GHZ) states, with the Bell states as the simplest examples, are widely exploited in quantum information and computation. We study the application of…
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically…
In this paper we propose the idea that there is a corresponding relation between quantum states and points of the complex projective space, given that the number of dimensions of the Hilbert space is finite. We check this idea through…
We introduce a new gate that transfers an arbitrary state of a qubit into a superposition of two quasi-orthogonal coherent states of a cavity mode, with opposite phases. This qcMAP gate is based on conditional qubit and cavity operations…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
The role of the off-diagonal density matrix elements of the entangled pair is investigated in quantum teleportation of a qbit. The dependence between them and the off-diagonal elements of the teleported density matrix is shown to be linear.…
The geometric separability probability of composite quantum systems is extensively studied in the last decades. One of most simple but strikingly difficult problem is to compute the separability probability of qubit-qubit and rebit-rebit…
The simulation of quantum many-body systems, relevant for quantum chemistry and condensed matter physics, is one of the most promising applications of near-term quantum computers before fault-tolerance. However, since the vast majority of…
Although the path-integral formalism is known to be equivalent to conventional quantum mechanics, it is not generally obvious how to implement path-based calculations for multi-qubit entangled states. Whether one takes the formal view of…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…
Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and the vectors modeling qubit states grow exponentially with an increase in the number of qubits. However, by using a…
This paper considers the control landscape of quantum transitions in multi-qubit systems driven by unitary transformations with single-qubit interaction terms. The two-qubit case is fully analyzed to reveal the features of the landscape…
Motivated by recent quantum gas microscope experiments for fermions in optical lattices, we present proof of principle calculations showing that it is possible to obtain the complete information about the quantum state on a small subsystem…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms.…
A hierarchical, reversible mapping between levels of tree structured computation, applicable for structuring the Quantum Computation algorithm for NP-complete problem is presented. It is proven that confining the state of a quantum computer…