Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IBM Q 53 量子位元量子電腦的Mermin不等式實驗

黃偉家

Published Jan 1, 2020• 0 citations
Publisher

Abstract

The difference between a quantum computer and a classical computer is that the classical computer one bit has zero and one states with only 2^n states for n bits, while the quantum computer has the nature that phase and entanglement, so the quantum computer has more variations and can have nearly infinite possibilities. Therefore, the two principal axes of this paper are to observe the entangled state characteristics of multiple qubits (N=2 to N=7) on the IBM Q 53 qubit quantum computer and the influence of phase on the entangled state properties. The first part, which has been published in Quantum Engineering, is the GHZ-like states of multiple qubits (N = 2 to N = 7) in IBM Rochester, and compares the maximum violation values of Mermin orthogonal polynomials with the analytic results among each other. In another experiment, two qubits with different phase angles were used to analyze the phase trajectory, and the effect on the improved Mermin polynomial in the GHZ-like states was studied. Our results in the first part show that the entanglement nature of IBM Rochester is fairly good when N ≤ 4, while for longer chains, entanglement is only valid for certain special connections. In the other experimental phase trajectory analysis, most of the trajectories are stable circular trajectories, and under certain circumstances the GHZ-like state and its excited state will produce the evolution of resurgence and reignition.

DOI
10.6342/ntu202001657

Related papers

Mermin's inequalities of multiple qubits with orthogonal measurements on IBM Q 53‐qubit system

Wei‐Jia Huang, Wei‐Chen Chien, Chien‐Hung Cho +3 more

Entanglement properties of IBM Q 53-qubit quantum computer are carefully examined with the noisy intermediate-scale quantum technology. We study Greenberger-Horne-Zeilinger-like states with multiple qubits (N = 2 to N = 7) on IBM Rochester and compare their maximal violation values of Mermin's polynomials with analytic results. A rule of N-qubits orthogonal measurements is taken to further justify the entanglement less than maximal values of local realism. The orthogonality of measurements is another reliable criterion for entanglement except the maximal values of LR. Our results indicate that the entanglement of IBM 53 qubits is reasonably good when N ≤ 4, while for the longer entangle chains, the entanglement is only valid for some special connectivity.

arXiv:2005.12504•Quantum Engineering•May 28, 2020•34 citations

Phase analysis on the error scaling of entangled qubits in a 53-qubit system

Wei-Jia Huang, Wei-Chen Chien, Chien-Hung Cho +6 more

We have studied carefully the behaviors of entangled qubits on the IBM Rochester with various connectivities and under a "noisy" environment. A phase trajectory analysis based on our measurements of the GHZ-like states is performed. Our results point to an important fact that entangled qubits are "protected" against environmental noise by a scaling property that impacts only the weighting of their amplitudes. The reproducibility of most measurements has been confirmed within a reasonably short gate operation time. But there still are a few combinations of qubits that show significant entanglement evolution in the form of transitions between quantum states. The phase trajectory of an entangled evolution, and the impact of the sudden death of GHZ-like states and the revival of newly excited states are analyzed in details. All observed trajectories of entangled qubits arise under the influences of the newly excited states in a "noisy" intermediate-scale quantum (NISQ) computer.

arXiv:2010.06339•Scientific Reports•Jul 14, 2021•1 citation

Experimental test of Mermin inequalities on a five-qubit quantum computer

Daniel Arriscado Alsina, José Ignacio Latorre

Violation of Mermin inequalities is tested on the five-qubit IBM quantum computer. For three, four, and five parties, quantum states that violate the corresponding Mermin inequalities are constructed using quantum circuits on superconducting qubits. Measurements on different bases are included as additional final gates in the circuits. The experimental results obtained using the quantum computer show violation of all Mermin inequalities, with a clear degradation of the results in the five-qubit case. Though this quantum computer is not competitive to test Mermin inequalities as compared to other techniques when applied to a few qubits, it does offer the opportunity to explore multipartite entanglement for four and five qubits beyond the reach of other alternative technologies.

arXiv:1605.04220•Physical Review A•Jul 11, 2016•137 citations

Quantum computing on the IBM processor

Marco Ballarin

We analyze the basic aspects of the quantum information theory, namely the quantum version of the theory that is behind all the classical implementations like computers and communications. We focus on quantum computation, defining its fundamental unit: the qubit, namely a quantum two-level system that will be described in detail in this thesis. We then concentrate on the possible transformations gates that can be applied to qubits, both unitary and non-unitary ones. The challenges in the construction of qubits are impressive: in particular, it is difficult to isolate the system from the environment. This interaction is modeled by non-unitary transformations. The characteristic times connected to these processes are the relaxation time, the time in which a state decays in another state, and the decoherence time, the time in which quantum coherence is lost. These times are fundamental in quantum computing since they quantify how many operations can be performed on qubits and still obtain reliable results. We measure these characteristic times on the IBM quantum processor ’ibmq_16_melbourne’ performing three different experiments: one for the relaxation time and two for the decoherence time, namely Ramsey and Echo experiments. Finally, we implement a quantum algorithm, an algorithm that uses the resources of quantum mechanics, like entanglement. We focus on finding a protocol to define the quantum version of the elementary cellular automata, the quantum elementary cellular automata, and run it on the IBM processor. They are dynamical systems defined on a lattice in which the evolution is defined using simple local update rules. Comparing the physical results with theoretical expectations and noise-affected simulations we show the performance of the IBM processor.

•Jul 1, 2019•0 citations

Test of Bell’s and Mermin’s inequalities on Quantum Computer

Yangping Zheng, Xuesi Wang, Le Wang +2 more

Quantum computers have tremendous potential of simulating large quantum systems that classical computers can’t. In the theoretical verification of quantum non-locality principle, Bell’s and Mermin’s inequalities stood out, which proved to be valid in multiple empirical experiments. In this paper we report the tests of Bell and Mermin’s inequalities carried out on the 2- qubit and 3-qubit IBM quantum computer respectively. By comparing the result we obtained and the pattern predicted by the inequalities, our experimental results indicate clear violations of the two inequalities; thereby, we validate postulates in quantum mechanics and disprove the local realism argument in classical hidden variable theories proposed by Einstein, Podolsky, and Rosen on quantum circuits.

International Conference on Information Technology and Computer Application (ITCA)•Dec 1, 2020•0 citations

Hidden variables in Mermin GHZ machine with quantum assistance

Jose C. Moreno

Three experiments, with an IBM superconducting quantum computer, are presented, where the setting combinations on a three qubit GHZ(like) state were selected by two additional assistant qubits. The average of the polynomial of Mermin for the three entangled qubits was calculated; the results showed violation of the inequality of Mermin. However, given that the assistant qubits selected, imposed and informed the type of settings, it was possible to interpret the results in terms of arranged relations among hidden variables of the assistants and the entanglement BEFORE each shot; the hidden variables may or may not be local depending on the way the qubits were initialized.

arXiv:2112.03689•Dec 6, 2021•0 citations
The difference between a quantum computer and a classical computer is that the classical computer one bit has zero and one states with only 2^n states for n bits, while the quantum computer has the nature that phase and entanglement, so the quantum computer has more variations and can have nearly infinite possibilities. Therefore, the two principal axes of this paper are to observe the entangled state characteristics of multiple qubits (N=2 to N=7) on the IBM Q 53 qubit quantum computer and the influence of phase on the entangled state properties. The first part, which has been published in Quantum Engineering, is the GHZ-like states of multiple qubits (N = 2 to N = 7) in IBM Rochester, and compares the maximum violation values of Mermin orthogonal polynomials with the analytic results among each other. In another experiment, two qubits with different phase angles were used to analyze the phase trajectory, and the effect on the improved Mermin polynomial in the GHZ-like states was studied.
Our results in the first part show that the entanglement nature of IBM Rochester is fairly good when N ≤ 4, while for longer chains, entanglement is only valid for certain special connections. In the other experimental phase trajectory analysis, most of the trajectories are stable circular trajectories, and under certain circumstances the GHZ-like state and its excited state will produce the evolution of resurgence and reignition.
Entanglement properties of IBM Q 53-qubit quantum computer are carefully examined with the noisy intermediate-scale quantum technology. We study Greenberger-Horne-Zeilinger-like states with multiple qubits (N = 2 to N = 7) on IBM Rochester and compare their maximal violation values of Mermin's polynomials with analytic results. A rule of N-qubits orthogonal measurements is taken to further justify the entanglement less than maximal values of local realism. The orthogonality of measurements is another reliable criterion for entanglement except the maximal values of LR. Our results indicate that the entanglement of IBM 53 qubits is reasonably good when N ≤ 4, while for the longer entangle chains, the entanglement is only valid for some special connectivity.
We have studied carefully the behaviors of entangled qubits on the IBM Rochester with various connectivities and under a "noisy" environment. A phase trajectory analysis based on our measurements of the GHZ-like states is performed. Our results point to an important fact that entangled qubits are "protected" against environmental noise by a scaling property that impacts only the weighting of their amplitudes. The reproducibility of most measurements has been confirmed within a reasonably short gate operation time. But there still are a few combinations of qubits that show significant entanglement evolution in the form of transitions between quantum states. The phase trajectory of an entangled evolution, and the impact of the sudden death of GHZ-like states and the revival of newly excited states are analyzed in details. All observed trajectories of entangled qubits arise under the influences of the newly excited states in a "noisy" intermediate-scale quantum (NISQ) computer.
Violation of Mermin inequalities is tested on the five-qubit IBM quantum computer. For three, four, and five parties, quantum states that violate the corresponding Mermin inequalities are constructed using quantum circuits on superconducting qubits. Measurements on different bases are included as additional final gates in the circuits. The experimental results obtained using the quantum computer show violation of all Mermin inequalities, with a clear degradation of the results in the five-qubit case. Though this quantum computer is not competitive to test Mermin inequalities as compared to other techniques when applied to a few qubits, it does offer the opportunity to explore multipartite entanglement for four and five qubits beyond the reach of other alternative technologies.
We analyze the basic aspects of the quantum information theory, namely the quantum version of the theory that is behind all the classical implementations like computers and communications. We focus on quantum computation, defining its fundamental unit: the qubit, namely a quantum two-level system that will be described in detail in this thesis. We then concentrate on the possible transformations gates that can be applied to qubits, both unitary and non-unitary ones. The challenges in the construction of qubits are impressive: in particular, it is difficult to isolate the system from the environment. This interaction is modeled by non-unitary transformations. The characteristic times connected to these processes are the relaxation time, the time in which a state decays in another state, and the decoherence time, the time in which quantum coherence is lost. These times are fundamental in quantum computing since they quantify how many operations can be performed on qubits and still obtain reliable results. We measure these characteristic times on the IBM quantum processor ’ibmq_16_melbourne’ performing three different experiments: one for the relaxation time and two for the decoherence time, namely Ramsey and Echo experiments. Finally, we implement a quantum algorithm, an algorithm that uses the resources of quantum mechanics, like entanglement. We focus on finding a protocol to define the quantum version of the elementary cellular automata, the quantum elementary cellular automata, and run it on the IBM processor. They are dynamical systems defined on a lattice in which the evolution is defined using simple local update rules. Comparing the physical results with theoretical expectations and noise-affected simulations we show the performance of the IBM processor.
Quantum computers have tremendous potential of simulating large quantum systems that classical computers can’t. In the theoretical verification of quantum non-locality principle, Bell’s and Mermin’s inequalities stood out, which proved to be valid in multiple empirical experiments. In this paper we report the tests of Bell and Mermin’s inequalities carried out on the 2- qubit and 3-qubit IBM quantum computer respectively. By comparing the result we obtained and the pattern predicted by the inequalities, our experimental results indicate clear violations of the two inequalities; thereby, we validate postulates in quantum mechanics and disprove the local realism argument in classical hidden variable theories proposed by Einstein, Podolsky, and Rosen on quantum circuits.
Three experiments, with an IBM superconducting quantum computer, are presented, where the setting combinations on a three qubit GHZ(like) state were selected by two additional assistant qubits. The average of the polynomial of Mermin for the three entangled qubits was calculated; the results showed violation of the inequality of Mermin. However, given that the assistant qubits selected, imposed and informed the type of settings, it was possible to interpret the results in terms of arranged relations among hidden variables of the assistants and the entanglement BEFORE each shot; the hidden variables may or may not be local depending on the way the qubits were initialized.