[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3370748.3406586acmconferencesArticle/Chapter ViewAbstractPublication PagesislpedConference Proceedingsconference-collections
research-article

Resiliency analysis and improvement of variational quantum factoring in superconducting qubit

Published: 10 August 2020 Publication History

Abstract

Variational algorithm using Quantum Approximate Optimization Algorithm (QAOA) can solve the prime factorization problem in near-term noisy quantum computers. Conventional Variational Quantum Factoring (VQF) requires a large number of 2-qubit gates (especially for factoring a large number) resulting in deep circuits. The output quality of the deep quantum circuit is degraded due to errors limiting the computational power of quantum computing. In this paper, we explore various transformations to optimize the QAOA circuit for integer factorization. We propose two criteria to select the optimal quantum circuit that can improve the noise resiliency of VQF.

Supplementary Material

MP4 File (3370748.3406586.mp4)
This presentation covers the overview of the paper "Resiliency Analysis and Improvement of Variational Quantum Factoring in Superconducting Qubit".

References

[1]
L. M. Vandersypen, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang, "Experimental realization of shor's quantum factoring algorithm using nuclear magnetic resonance," Nature, vol. 414, no. 6866, p. 883, 2001.
[2]
E. Anschuetz, J. Olson, A. Aspuru-Guzik, and Y. Cao, "Variational quantum factoring," in International Workshop on Quantum Technology and Optimization Problems. Springer, 2019, pp. 74--85.
[3]
E. Farhi, J. Goldstone, and S. Gutmann, "A quantum approximate optimization algorithm," arXiv preprint arXiv:1411.4028, 2014.
[4]
M. Alam, A. Ash-Saki, and S. Ghosh, "Analysis of quantum approximate optimization algorithm under realistic noise in superconducting qubits," arXiv preprint arXiv:1907.09631, 2019.
[5]
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, "Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices," arXiv preprint arXiv:1812.01041, 2018.
[6]
C. J. Burges, "Factoring as optimization," Microsoft Research MSR-TR-200, 2002.
[7]
N. Xu, J. Zhu, D. Lu, X. Zhou, X. Peng, and J. Du, "Quantum factorization of 143 on a dipolar-coupling nuclear magnetic resonance system," Physical review letters, vol. 108, no. 13, p. 130501, 2012.
[8]
R. Dridi and H. Alghassi, "Prime factorization using quantum annealing and computational algebraic geometry," Scientific reports, vol. 7, p. 43048, 2017.
[9]
"Qiskit: An open-source framework for quantum computing," 2019.
[10]
"SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python," arXiv e-prints, p. arXiv:1907.10121, Jul 2019.

Cited By

View all
  • (2023)Near-term quantum computing techniques: Variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulationScience China Physics, Mechanics & Astronomy10.1007/s11433-022-2057-y66:5Online publication date: 10-Apr-2023
  • (2021)Impact of Noise on the Resilience and the Security of Quantum Computing2021 22nd International Symposium on Quality Electronic Design (ISQED)10.1109/ISQED51717.2021.9424258(186-191)Online publication date: 7-Apr-2021
  • (2021)A Survey and Tutorial on Security and Resilience of Quantum Computing2021 IEEE European Test Symposium (ETS)10.1109/ETS50041.2021.9465397(1-10)Online publication date: 24-May-2021

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ISLPED '20: Proceedings of the ACM/IEEE International Symposium on Low Power Electronics and Design
August 2020
263 pages
ISBN:9781450370530
DOI:10.1145/3370748
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

  • IEEE CAS

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 2020

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

ISLPED '20
Sponsor:

Acceptance Rates

Overall Acceptance Rate 398 of 1,159 submissions, 34%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)9
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Near-term quantum computing techniques: Variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulationScience China Physics, Mechanics & Astronomy10.1007/s11433-022-2057-y66:5Online publication date: 10-Apr-2023
  • (2021)Impact of Noise on the Resilience and the Security of Quantum Computing2021 22nd International Symposium on Quality Electronic Design (ISQED)10.1109/ISQED51717.2021.9424258(186-191)Online publication date: 7-Apr-2021
  • (2021)A Survey and Tutorial on Security and Resilience of Quantum Computing2021 IEEE European Test Symposium (ETS)10.1109/ETS50041.2021.9465397(1-10)Online publication date: 24-May-2021

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media