Related papers: Three-Qubit State Preparation: Classification and …
The spin states of single electrons in gate-defined quantum dots satisfy crucial requirements for a practical quantum computer. These include extremely long coherence times, high-fidelity quantum operation, and the ability to shuttle…
If a pure state of a qubit pair is developed over the four basis states, it is known that an equality between the four coefficients of that development exists if and only if that state is unentangled. This paper considers an arbitrary pure…
In this work, we present a quantum circuit for a binary classification prediction algorithm using a random forest model. The quantum prediction algorithm is presented in our previous works. We construct a circuit and implement it using…
We classify the local unitary equivalence classes of absolutely maximally entangled (AME) states of five qubits. We show that every 5-qubit AME state is equivalent to a state within the unique ((5,2,3)) quantum error-correcting code…
Efficient encoding of classical information plays a fundamental role in numerous practical quantum algorithms. However, the preparation of an arbitrary amplitude-encoded state has been proven to be time-consuming, and its deployment on…
In recent years, the quantum computing community has seen an explosion of novel methods to implement non-trivial quantum computations on near-term hardware. An important direction of research has been to decompose an arbitrary entangled…
Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…
We put forward an alternative approach to the SLOCC classification of entanglement states of three-qubit and four-qubit systems. By directly solving matrix equations, we obtain the relations satisfied by the amplitudes of states. The…
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $\left |b \right >$. However, efficiently…
A complete analysis of entangled triqubit pure states is carried out based on a new simple entanglement measure. An analysis of all possible extremally entangled pure triqubit states with up to eight terms is shown to reduce, with the help…
We can uniquely calculate almost all entangled state vectors of tripartite systems ABC if we know the reduced states of any two bipartite subsystems, e.g., of AB and of BC. We construct the explicit solution.
We consider the task of deciding whether an unknown qubit state falls in a prescribed neighborhood of a reference state. We assume that several copies of the unknown state are given and apply a unitary operation pairwise on them combined…
A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a a unitary matrix U, into a product of simpler U j via a neural network. These U j can then be decomposed…
Quantum process tomography (QPT) methods aim at identifying a given quantum process. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the…
Efficiently uploading data into quantum states is essential for many quantum algorithms to achieve advantage across various applications. In this paper, we address this challenge by developing a method to upload a polynomial function $f(x)$…
Entanglement is a purely quantum mechanical phenomenon and thus it has no classical analog. On the other hand, coherence is a well-known phenomenon in classical optics and in quantum mechanics. Recent research shows that quantum coherence…
We present an algorithm that decomposes any $n$-qubit Clifford operator into a circuit consisting of three subcircuits containing only CNOT or CPHASE gates with layers of one-qubit gates before and after each of these subcircuits. As with…
The optimal estimation of a quantum mechanical 2-state system (qubit) - with N identically prepared qubits available - is obtained by measuring all qubits simultaneously in an entangled basis. We report the experimental estimation of qubits…
Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in…
The decomposition of matrices associated to two-qubit and three-qubit orthogonal gates is studied, and based on the decomposition the synthesis of these gates is investigated. The optimal synthesis of general two-qubit orthogonal gate is…