Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm

Huang, He-Liang; Goswami, Ashutosh; Bao, Wan-Su; Panigrahi, Prasanta K.

doi:10.1007/s11433-018-9175-2

Cited by 22 publications

(7 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, thanks to the significant progress in superconducting and photonic platforms, the longanticipated milestone of quantum computational advantage or supremacy [4][5][6][7] has been achieved by using the quantum processors Sycamore [8], Jiuzhang [9,10], and Zuchongzhi [11] successively. These quantum processors with dozens of qubits reveal remarkable potential for quantum computing to offer new capabilities for near-term applications in the noisy intermediate scale quantum (NISQ) area, such as quantum simulation [12][13][14][15][16][17][18][19][20][21][22][23][24][25], quantum machine learning [26][27][28][29][30][31][32], and cloud quantum computing [33][34][35][36][37][38].…”

Section: Introductionmentioning

confidence: 99%

Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling

Zhu¹,

Cao²,

Chen³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

To ensure a long-term quantum computational advantage, the quantum hardware should be upgraded to withstand the competition of continuously improved classical algorithms and hardwares. Here, we demonstrate a superconducting quantum computing systems Zuchongzhi 2.1, which has 66 qubits in a two-dimensional array in a tunable coupler architecture. The readout fidelity of Zuchongzhi 2.1 is considerably improved to an average of 97.74%. The more powerful quantum processor enables us to achieve larger-scale random quantum circuit sampling, with a system scale of up to 60 qubits and 24 cycles. The achieved sampling task is about 6 orders of magnitude more difficult than that of Sycamore [Nature 574, 505 (2019)] in the classic simulation, and 3 orders of magnitude more difficult than the sampling task on Zuchongzhi 2.0 [arXiv: 2106.14734 (2021)]. The time consumption of classically simulating random circuit sampling experiment using state-of-the-art classical algorithm and supercomputer is extended to tens of thousands of years (about 4.8 × 10 4 years), while Zuchongzhi 2.1 only takes about 4.2 hours, thereby significantly enhancing the quantum computational advantage.

show abstract

Section: Introductionmentioning

confidence: 99%

Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling

Zhu¹,

Cao²,

Chen³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…When f (1) = 1, probabilities are just the opposite. To characterize the overlap between experimental and theoretical results, we adopt the statistical fidelity [25,26]…”

Section: Experimental Implementationmentioning

confidence: 99%

Exact quantum search based on analytical multiphase matching for known number of target items and the experimental demonstration on IBM Q

Li,

Fu,

Wang

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

In [Phys. Rev. Lett. 113, 210501 (2014)], to achieve the optimal fixedpoint quantum search in the case of unknown fraction (denoted by λ) of target items, the analytical multiphase matching (AMPM) condition has been proposed. In this paper, we find out that the AMPM condition can also be used to design the exact quantum search algorithm in the case of known λ, and the minimum number of iterations reaches the optimal level of existing exact algorithms. Experiments are performed to demonstrate the proposed algorithm on IBM's quantum computer. In addition, we theoretically find two coincidental phases with equal absolute value in our algorithm based on the AMPM condition and that algorithm based on single-phase matching. Our work confirms the practicability of the AMPM condition in the case of known λ, and is helpful to understand the mechanism of this condition.

show abstract

“…Entanglement is one of the most remarkable phenomena in quantum mechanics, which is also the most important resources in quantum information processing and communication. [1][2][3][4] In recent years, great efforts have been made toward the understanding of the role played by the entanglement in quantum information theory such as quantum teleportation, [5] quantum key distribution, [6] and quantum computing. [7] An important problem in the theory of quantum entanglement is the quantification of entanglement.…”

Section: Introductionmentioning

confidence: 99%

Parameterized monogamy and polygamy relations of multipartite entanglement

Shen 沈,

Wang 王,

Fei 费

2023

Chinese Phys. B

View full text Add to dashboard Cite

Monogamy and polygamy relations are important properties of entanglement, which characterize the entanglement distribution of multipartite systems. We explore monogamy and polygamy relations of entanglement in multipartite systems by using two newly derived parameterized mathematical inequalities, and establish classes of parameterized monogamy and polygamy relations of multiqubit entanglement in terms of concurrence and entanglement of formation. We show that these new parameterized monogamy and poelygamy inequalities are tighter than the existing ones by detailed examples.

show abstract

Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm

Cited by 22 publications

References 46 publications

Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling

Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling

Exact quantum search based on analytical multiphase matching for known number of target items and the experimental demonstration on IBM Q

Parameterized monogamy and polygamy relations of multipartite entanglement

Contact Info

Product

Resources

About