相关论文: Complete Characterization of a Quantum Process: th…
The characterization of a unitary gate is experimentally accomplished via Quantum Process Tomography, which combines the outcomes of different projective measurements to reconstruct the underlying operator. The process matrix is typically…
In this brief report, we discuss the characteristics of B$^{\alpha}$ gates. We provide the conditions for the two-qubit gates generated by two applications of a B$^{\alpha}$ gate. We propose an experimental scheme to implement B$^{\alpha}$…
This paper introduces a formalism that aims to describe the intricacies of quantum computation by establishing a connection with the mathematical foundations of tensor theory and multilinear maps. The focus is on providing a comprehensive…
Quantum computers are the promising candidates for simulation of large quantum systems, which is a daunting task to perform in a classical computer. Here, we report the experimental realization of quantum tunneling of a single particle…
Quantum processes describe concurrent communicating systems that may involve quantum information. We propose a notion of open bisimulation for quantum processes and show that it provides both a sound and complete proof methodology for a…
Physical processes in the quantum regime possess non-classical properties of quantum mechanics. However, methods for quantitatively identifying such processes are still lacking. Accordingly, in this study, we develop a framework for…
We present a method to characterise qubit gates. Utilising the supermap formalism, we create a scheme for deterministic single-qubit gate analysis. Our approach introduces a new twirling process that is applied directly through fixed…
Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the B gate is the unique gate that can…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement…
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…
We demonstrate universal quantum control over chains of ions in a surface-electrode ion trap, including all the fundamental operations necessary to perform algorithms in a one-dimensional, nearest-neighbor quantum computing architecture. We…
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…
We study the achievements of quantum circuits comprised of several one- and two-qubit gates. Quantum process matrices are determined for the basic one- and two-qubit gate operations and concatenated to yield the process matrix of the…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…
We consider interactions that generate a universal set of quantum gates on logical qubits encoded in a collective-dephasing-free subspace, and discuss their implementations with trapped ions. This allows for the removal of the by-far…
We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the…
We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.
The implementation of holonomic quantum computation is meaningful. We can effectively resist local and collective noise in the process of physical implementation by using the advantage of non-Abelian geometric phase. In this paper, we set…