Superconducting Quantum Computing: A Review

• URL: http://arxiv.org/abs/2006.10433v3
• Date: Mon, 2 Nov 2020 12:56:49 GMT
• Title: Superconducting Quantum Computing: A Review
• Authors: He-Liang Huang, Dachao Wu, Daojin Fan, Xiaobo Zhu
• Abstract summary: We provide a brief review on the experimental efforts towards building a large-scale superconducting quantum computer. We discuss qubit design, quantum control, readout techniques, and the implementations of error correction and quantum algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Over the last two decades, tremendous advances have been made for constructing large-scale quantum computers. In particular, the quantum processor architecture based on superconducting qubits has become the leading candidate for scalable quantum computing platform, and the milestone of demonstrating quantum supremacy was first achieved using 53 superconducting qubits in 2019. In this work, we provide a brief review on the experimental efforts towards building a large-scale superconducting quantum computer, including qubit design, quantum control, readout techniques, and the implementations of error correction and quantum algorithms. Besides the state of the art, we finally discuss future perspectives, and which we hope will motivate further research.

Related papers

• Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer [56.435136806763055]
  IQM Quantum Computers is described covering both the QPU and the rest of the full-stack quantum computer. The focus is on a 20-qubit quantum computer featuring the Garnet QPU and its architecture, which we will scale up to 150 qubits. We present QPU and system-level benchmarks, including a median 2-qubit gate fidelity of 99.5% and genuinely entangling all 20 qubits in a Greenberger-Horne-Zeilinger (GHZ) state.
  arXiv  Detail & Related papers  (2024-08-22T14:26:10Z)
• On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Program Scheduling [48.142860424323395]
  We introduce the Quantum Program Scheduling Problem (QPSP) to improve the utility efficiency of quantum resources. Specifically, a quantum program scheduling method concerning the circuit width, number of measurement shots, and submission time of quantum programs is proposed to reduce the execution latency.
  arXiv  Detail & Related papers  (2024-04-11T16:12:01Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Demonstrating Quantum Computation for Quasiparticle Band Structures [0.0]
  We demonstrate the first-principles calculation of a quasiparticle band structure on actual quantum computers. This is achieved by hybrid quantum-classical algorithms in conjunction with qubit-reduction and error-mitigation techniques.
  arXiv  Detail & Related papers  (2023-07-27T03:45:05Z)
• Quantum information processing with superconducting circuits: a perspective [0.0]
  Key issues involve how to achieve quantum advantage in useful applications for quantum optimization and materials science. Recent work on applications of variational quantum algorithms for optimization and electronic structure determination. Current work and ideas about how to scale up to competitive quantum systems.
  arXiv  Detail & Related papers  (2023-02-09T10:49:56Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Quantum Proof of Work with Parametrized Quantum Circuits [0.0]
  There is still a dearth of practical applications for quantum computers with a small number of noisy qubits. We proposed a scheme for quantum-computer compatible proof of work (cryptographic mechanism used in Bitcoin mining) and verified it on a 4-qubit superconducting quantum node.
  arXiv  Detail & Related papers  (2022-04-22T11:26:16Z)
• Summary: Chicago Quantum Exchange (CQE) Pulse-level Quantum Control Workshop [4.279232730307778]
  Quantum information processing holds great promise for pushing beyond the current frontiers in computing. We must not only place emphasis on manufacturing better qubits, advancing our algorithms, and developing quantum software. To scale devices to the fault tolerant regime, we must refine device-level quantum control.
  arXiv  Detail & Related papers  (2022-02-28T08:18:59Z)
• Quantum design for advanced qubits: plasmonium [4.51227657808872]
  We demonstrate variational quantum eigensolvers to simulate superconducting quantum circuits with varying parameters covering a plasmon-transition regime. We fabricate an advanced post-transmon qubit, "plasmonium", which exhibits high single- and two-qubit gate fidelities. Our work opens the way to designing advanced quantum processors using existing quantum computing resources.
  arXiv  Detail & Related papers  (2021-09-02T14:48:39Z)
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface [68.8204255655161]
  Advances in isolating, controlling and entangling quantum systems are transforming what was once a curious feature of quantum mechanics into a vehicle for disruptive scientific and technological progress. From the perspective of three domain science theorists, this article compiles thoughts about the interface on entanglement, complexity, and quantum simulation.
  arXiv  Detail & Related papers  (2021-07-10T06:12:06Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.