Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDistinguishing Unitary Gates on the IBM Quantum Processor
89
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
An unknown unitary gates, which is secretly chosen from several known ones, can always be distinguished perfectly. In this paper, we implement such a task on IBMs quantum processor. More precisely, we experimentally demonstrate the discrimination of two qubit unitary gates, the identity gate and the $frac{2}{3}pi$-phase shift gate, using two discrimination schemes -- the parallel scheme and the sequential scheme. We program these two schemes on the emph{ibmqx4}, a $5$-qubit superconducting quantum processor via IBM cloud, with the help of the $QSI$ modules [S. Liu et al.,~arXiv:1710.09500, 2017]. We report that both discrimination schemes achieve success probabilities at least 85%.
rate research
Read More
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 of the reshuffled matrix. Averaging the entropy over the Haar measure on U(N^2) we find its asymptotic behaviour. For two--qubit quantum gates we derive the induced probability distribution of the interaction content and show that the relative volume of the set of perfect entanglers reads 8/3 pi approx 0.85. We establish explicit conditions under which a given one-qubit bistochastic map is unistochastic, so it can be obtained by partial trace over a one--qubit environment initially prepared in the maximally mixed state.
We report the first experimental demonstration of quantum synchronization. This is achieved by performing a digital simulation of a single spin-$1$ limit-cycle oscillator on the quantum computers of the IBM Q System. Applying an external signal to the oscillator, we verify typical features of quantum synchronization and demonstrate an interference-based quantum synchronization blockade. Our results show that state-of-the-art noisy intermediate-scale quantum computers are powerful enough to implement realistic dissipative quantum systems. Finally, we discuss limitations of current quantum hardware and define requirements necessary to investigate more complex problems.
We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are conjectured to converge to diagonal gates doubly exponentially fast and are verified for small integers. We systemically study this conjecture and prove several important partial results. Some techniques are developed to pave the way for a final resolution of the conjecture. The sequences provided here have applications in quantum search algorithms, quantum circuit compilation, generation of leakage-free entangled gates in topological quantum computing, etc.
We show that a set of optical memories can act as a configurable linear optical network operating on frequency-multiplexed optical states. Our protocol is applicable to any quantum memories that employ off-resonant Raman transitions to store optical information in atomic spins. In addition to the configurability, the protocol also offers favourable scaling with an increasing number of modes where N memories can be configured to implement an arbitrary N-mode unitary operations during storage and readout. We demonstrate the versatility of this protocol by showing an example where cascaded memories are used to implement a conditional CZ gate.
Using a braid group representation based on the Temperley-Lieb algebra, we construct braid quantum gates that could generate entangled $n$-partite $D$-level qudit states. $D$ different sets of $D^ntimes D^n$ unitary representation of the braid group generators are presented. With these generators the desired braid quantum gates are obtained. We show that the generalized GHZ states, which are maximally entangled states, can be obtained directly from these braid quantum gates without resorting to further local unitary transformations. We also point out an interesting observation, namely for a general multi-qudit state there exists a unitary braid quantum gate based on the Temperley-Lieb algebra that connects it from one of its component basis states, if the coefficient of the component state is such that the square of its norm is no less than $1/4$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
