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

arXiv:2110.03709 · Physical Review Applied

Variational Determination of Multiqubit Geometrical Entanglement in Noisy Intermediate-Scale Quantum Computers

Andrés D. Muñoz-Moller, Luciano Pereira, Leonardo Zambrano, J. Cortés-Vega, A. Delgado

Published Aug 17, 2022• 16 citations
arXivHTMLPDF

Abstract

Current noise levels in physical realizations of qubits and quantum operations limit the applicability of conventional methods to characterize entanglement. In this adverse scenario, we follow a quantum variational approach to estimate the geometric measure of entanglement of multiqubit pure states. The algorithm requires only single-qubit gates and measurements, so it is well suited for noisy intermediate-scale quantum devices. This is demonstrated by successfully implementing the method on IBM Quantum devices for Greenberger-Horne-Zeilinger states of three, four, and five qubits. Numerical simulations with random states show the robustness and accuracy of the method. The scalability of the protocol is numerically demonstrated via matrix-product-state techniques up to $25$ qubits.

DOI
10.1103/physrevapplied.18.024048

Related papers

Avoiding barren plateaus in the variational determination of geometric entanglement

Leonardo Zambrano, Andrés D. Muñoz-Moller, Mario Muñoz +2 more

Abstract The barren plateau (BP) phenomenon is one of the main obstacles to implementing variational quantum algorithms in the current generation of quantum processors. Here, we introduce a method capable of avoiding the BP phenomenon in the variational determination of the geometric measure of entanglement for a large number of qubits. The method is based on measuring compatible two-qubit local functions whose optimization allows for achieving a well-suited initial condition from which a global function can be further optimized without encountering a BP. We analytically demonstrate that the local functions can be efficiently estimated and optimized. Numerical simulations up to 18 qubit GHZ and W states demonstrate that the method converges to the exact value. In particular, the method allows for escaping from BPs induced by hardware noise or global functions defined on high-dimensional systems. Numerical simulations with noise agree with experiments carried out on IBM’s quantum processors for seven qubits.

arXiv:2304.13388•Quantum Science and Technology•Feb 16, 2024•11 citations

Scalable estimation of pure multi-qubit states

Luciano Pereira, Leonardo Zambrano, A. Delgado

Abstract We introduce an inductiven-qubit pure-state estimation method based on projective measurements onmn + 1 separable bases ormentangled bases plus the computational basis, withm ≥ 2. The method exhibits a favorable scaling in the number of qubits compared to other estimation schemes. The use of separable bases makes our estimation method particularly well suited for applications in noisy intermediate-scale quantum computers, where entangling gates are much less accurate than local gates. Our method is also capable of estimating the purity of mixed states generated by the action of white noise on pure states. Monte Carlo simulations show that the method achieves a high estimation fidelity. Besides, the fidelity can be improved by increasingmabove 2. We experimentally demonstrate the method on the IBM’s quantum processors by estimating up to 10-qubit separable and entangled states. In particular, a 4-qubit GHZ is estimated with experimental fidelity of 0.875.

arXiv:2107.05691•npj Quantum Information•May 13, 2022•14 citations

Analytical method of multiqubit entanglement robustness in correlated quantum channels

Zhen-Yu Peng, Feng-Lin Wu, Jun Li +3 more

In practice, the interaction between quantum system and environment will lead to the decoherence of entanglement. By quantifying the entanglement through the correlation tensor, we systematically investigate the entanglement robustness of two-qubit states under the four types of noisy channels and corresponding correlated channels. We use an analytical method to find all of the most robust and fragile states under the noisy channels. The puzzling phenomenon that the most robust and fragile states have the same entanglement under noisy channels has been investigated. Moreover, we compare the entanglement robustness of a three-qubit Greenberger-Horne-Zeilinger state with a $W$ state. Our method shows the behavior of entanglement under the noisy channels and characterizes the entanglement robustness of the multiqubit system analytically.

Physical Review A•Feb 7, 2023•11 citations

Characterization of entanglement on superconducting quantum computers of up to 414 qubits

John F. Kam, Haiyue Kang, Charles D. Hill +2 more

As quantum technology advances and the size of quantum computers grow, it becomes increasingly important to understand the extent of quality in the devices. As large-scale entanglement is a quantum resource crucial for achieving quantum advantage, the challenge in its generation makes it a valuable benchmark for measuring the performance of universal quantum devices. In this paper, we study entanglement in Greenberger-Horne-Zeilinger (GHZ) and graph states prepared on the range of IBM Quantum devices. We generate GHZ states and investigate their coherence times with respect to state size and dynamical decoupling techniques. A GHZ fidelity of 0.519 ± 0.014 is measured on a 32-qubit GHZ state, certifying its genuine multipartite entanglement (GME). We show a substantial improvement in GHZ decoherence rates for a seven-qubit GHZ state after implementing dynamical decoupling, and observe a linear trend in the decoherence rate of α = ( 7.13 N + 5.54 ) × 10 − 3 µ s − 1 for up to N = 15 qubits, confirming the absence of superdecoherence. Additionally, we prepare and characterize fully bipartite entangled native-graph states on 22 superconducting quantum devices with qubit counts as high as 414 qubits, all active qubits of the 433-qubit IBM Osprey device. Analysis of the decay of two-qubit entanglement within the prepared states shows suppression of coherent noise signals with the implementation of dynamical decoupling techniques. Additionally, we observe that the entanglement in some qubit pairs oscillates over time, which is likely caused by residual ZZ-interactions. Characterizing entanglement in native-graph states, along with detecting entanglement oscillations, can be an effective approach to low-level device benchmarking that encapsulates two-qubit error rates along with additional sources of noise, with possible applications to quantum circuit compilation. We develop several tools to automate the preparation and entanglement characterization of GHZ and graph states. In particular, a method to characterize graph state bipartite entanglement using just 36 circuits, constant with respect to the number of qubits. Published by the American Physical Society 2024

arXiv:2312.15170•Physical Review Research•Aug 12, 2024•34 citations

Variational approach to the quantum separability problem

Mirko Consiglio, Tony J. G. Apollaro, Marcin Wieśniak

We present the variational separability verifier (VSV), which is a variational quantum algorithm that determines the closest separable state (CSS) of an arbitrary quantum state with respect to the Hilbert-Schmidt distance (HSD). We first assess the performance of the VSV by investigating the convergence of the optimization procedure for Greenberger-Horne-Zeilinger states of up to seven qubits, using both state-vector and shot-based simulations. We also numerically determine the CSS of maximally entangled mixed $X$ states, and subsequently use the results of the algorithm to surmise the analytical form of the aforementioned CSS. Our results indicate that current noisy intermediate-scale quantum devices may be useful in addressing the NP-hard full separability problem using the VSV, due to the shallow quantum circuit imposed by employing the destructive swap test to evaluate the HSD. The VSV may also possibly lead to the characterization of multipartite quantum states, once the algorithm is adapted and improved to obtain the closest $k$-separable state of a multipartite entangled state.

arXiv:2209.01430•Physical Review A•Dec 13, 2022•19 citations

Entanglement spectroscopy with a depth-two quantum circuit

Yiğit Subaşı, Łukasz Cincio, Patrick J. Coles

Abstract Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing the qubit count. Here, we exploit this trade-off for an application called entanglement spectroscopy, where one computes the entanglement of a state on systems by evaluating the Rényi entropy of the reduced state . For a -qubit state , the Rényi entropy of order is computed via , with the complexity growing exponentially in for classical computers. Johri et al (2017 Phys. Rev . B 96 195136) introduced a quantum algorithm that requires copies of and whose depth scales linearly in . Here, we present a quantum algorithm requiring twice the qubit resources ( copies of ) but with a depth that is independent of both and . Surprisingly this depth is only two gates. Our numerical simulations show that this short depth leads to an increased robustness to noise.

arXiv:1806.08863•Journal of Physics A Mathematical and Theoretical•Nov 30, 2018•60 citations
Current noise levels in physical realizations of qubits and quantum operations limit the applicability of conventional methods to characterize entanglement. In this adverse scenario, we follow a quantum variational approach to estimate the geometric measure of entanglement of multiqubit pure states. The algorithm requires only single-qubit gates and measurements, so it is well suited for noisy intermediate-scale quantum devices. This is demonstrated by successfully implementing the method on IBM Quantum devices for Greenberger-Horne-Zeilinger states of three, four, and five qubits. Numerical simulations with random states show the robustness and accuracy of the method. The scalability of the protocol is numerically demonstrated via matrix-product-state techniques up to 252525 qubits.
Abstract The barren plateau (BP) phenomenon is one of the main obstacles to implementing variational quantum algorithms in the current generation of quantum processors. Here, we introduce a method capable of avoiding the BP phenomenon in the variational determination of the geometric measure of entanglement for a large number of qubits. The method is based on measuring compatible two-qubit local functions whose optimization allows for achieving a well-suited initial condition from which a global function can be further optimized without encountering a BP. We analytically demonstrate that the local functions can be efficiently estimated and optimized. Numerical simulations up to 18 qubit GHZ and W states demonstrate that the method converges to the exact value. In particular, the method allows for escaping from BPs induced by hardware noise or global functions defined on high-dimensional systems. Numerical simulations with noise agree with experiments carried out on IBM’s quantum processors for seven qubits.
Abstract We introduce an inductiven-qubit pure-state estimation method based on projective measurements onmn + 1 separable bases ormentangled bases plus the computational basis, withm ≥ 2. The method exhibits a favorable scaling in the number of qubits compared to other estimation schemes. The use of separable bases makes our estimation method particularly well suited for applications in noisy intermediate-scale quantum computers, where entangling gates are much less accurate than local gates. Our method is also capable of estimating the purity of mixed states generated by the action of white noise on pure states. Monte Carlo simulations show that the method achieves a high estimation fidelity. Besides, the fidelity can be improved by increasingmabove 2. We experimentally demonstrate the method on the IBM’s quantum processors by estimating up to 10-qubit separable and entangled states. In particular, a 4-qubit GHZ is estimated with experimental fidelity of 0.875.
In practice, the interaction between quantum system and environment will lead to the decoherence of entanglement. By quantifying the entanglement through the correlation tensor, we systematically investigate the entanglement robustness of two-qubit states under the four types of noisy channels and corresponding correlated channels. We use an analytical method to find all of the most robust and fragile states under the noisy channels. The puzzling phenomenon that the most robust and fragile states have the same entanglement under noisy channels has been investigated. Moreover, we compare the entanglement robustness of a three-qubit Greenberger-Horne-Zeilinger state with a WWW state. Our method shows the behavior of entanglement under the noisy channels and characterizes the entanglement robustness of the multiqubit system analytically.
As quantum technology advances and the size of quantum computers grow, it becomes increasingly important to understand the extent of quality in the devices. As large-scale entanglement is a quantum resource crucial for achieving quantum advantage, the challenge in its generation makes it a valuable benchmark for measuring the performance of universal quantum devices. In this paper, we study entanglement in Greenberger-Horne-Zeilinger (GHZ) and graph states prepared on the range of IBM Quantum devices. We generate GHZ states and investigate their coherence times with respect to state size and dynamical decoupling techniques. A GHZ fidelity of 0.519 ± 0.014 is measured on a 32-qubit GHZ state, certifying its genuine multipartite entanglement (GME). We show a substantial improvement in GHZ decoherence rates for a seven-qubit GHZ state after implementing dynamical decoupling, and observe a linear trend in the decoherence rate of α = ( 7.13 N + 5.54 ) × 10 − 3 µ s − 1 for up to N = 15 qubits, confirming the absence of superdecoherence. Additionally, we prepare and characterize fully bipartite entangled native-graph states on 22 superconducting quantum devices with qubit counts as high as 414 qubits, all active qubits of the 433-qubit IBM Osprey device. Analysis of the decay of two-qubit entanglement within the prepared states shows suppression of coherent noise signals with the implementation of dynamical decoupling techniques. Additionally, we observe that the entanglement in some qubit pairs oscillates over time, which is likely caused by residual ZZ-interactions. Characterizing entanglement in native-graph states, along with detecting entanglement oscillations, can be an effective approach to low-level device benchmarking that encapsulates two-qubit error rates along with additional sources of noise, with possible applications to quantum circuit compilation. We develop several tools to automate the preparation and entanglement characterization of GHZ and graph states. In particular, a method to characterize graph state bipartite entanglement using just 36 circuits, constant with respect to the number of qubits. Published by the American Physical Society 2024
We present the variational separability verifier (VSV), which is a variational quantum algorithm that determines the closest separable state (CSS) of an arbitrary quantum state with respect to the Hilbert-Schmidt distance (HSD). We first assess the performance of the VSV by investigating the convergence of the optimization procedure for Greenberger-Horne-Zeilinger states of up to seven qubits, using both state-vector and shot-based simulations. We also numerically determine the CSS of maximally entangled mixed XXX states, and subsequently use the results of the algorithm to surmise the analytical form of the aforementioned CSS. Our results indicate that current noisy intermediate-scale quantum devices may be useful in addressing the NP-hard full separability problem using the VSV, due to the shallow quantum circuit imposed by employing the destructive swap test to evaluate the HSD. The VSV may also possibly lead to the characterization of multipartite quantum states, once the algorithm is adapted and improved to obtain the closest kkk-separable state of a multipartite entangled state.
Abstract Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing the qubit count. Here, we exploit this trade-off for an application called entanglement spectroscopy, where one computes the entanglement of a state on systems by evaluating the Rényi entropy of the reduced state . For a -qubit state , the Rényi entropy of order is computed via , with the complexity growing exponentially in for classical computers. Johri et al (2017 Phys. Rev . B 96 195136) introduced a quantum algorithm that requires copies of and whose depth scales linearly in . Here, we present a quantum algorithm requiring twice the qubit resources ( copies of ) but with a depth that is independent of both and . Surprisingly this depth is only two gates. Our numerical simulations show that this short depth leads to an increased robustness to noise.