Experimental topological quantum computing with electric circuits
- URL: http://arxiv.org/abs/2309.04896v1
- Date: Sat, 9 Sep 2023 23:25:46 GMT
- Title: Experimental topological quantum computing with electric circuits
- Authors: Deyuan Zou, Naiqiao Pan, Tian Chen, Houjun Sun, and Xiangdong Zhang
- Abstract summary: We report the first experimental realization of topological quantum computation with electric circuits.
Based on our proposed new scheme with circuits, Majorana-like edge states are observed experimentally.
We demonstrate the feasibility of topological quantum computing through a set of one- and two-qubit unitary operations.
- Score: 5.093683847211242
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The key obstacle to the realization of a scalable quantum computer is
overcoming environmental and control errors. Topological quantum computation
has attracted great attention because it has emerged as one of the most
promising approaches to solving these problems. Various theoretical schemes for
building topological quantum computation have been proposed. However,
experimental implementation has always been a great challenge because it has
proved to be extremely difficult to create and manipulate topological qubits in
real systems. Therefore, topological quantum computation has not been realized
in experiments yet. Here, we report the first experimental realization of
topological quantum computation with electric circuits. Based on our proposed
new scheme with circuits, Majorana-like edge states are not only observed
experimentally, but also T junctions are constructed for the braiding process.
Furthermore, we demonstrate the feasibility of topological quantum computing
through a set of one- and two-qubit unitary operations. Finally, our
implementation of Grover's search algorithm demonstrates that topological
quantum computation is ideally suited for such tasks.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation [0.0]
Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing.
This paper presents a novel theoretical approach that achieves exponential speedups (polynomial runtime) over existing simulators.
The findings may have implications for quantum algorithm design, error correction, and the development of more efficient quantum simulators.
arXiv Detail & Related papers (2024-07-28T20:02:21Z) - Quantum computing topological invariants of two-dimensional quantum matter [0.0]
We present two quantum circuits for calculating Chern numbers of two-dimensional quantum matter on quantum computers.
First algorithm uses many qubits, and we analyze it using a tensor-network simulator of quantum circuits.
Second circuit uses fewer qubits, and we implement it experimentally on a quantum computer based on superconducting qubits.
arXiv Detail & Related papers (2024-04-09T06:22:50Z) - Realistic Runtime Analysis for Quantum Simplex Computation [0.4407851469168588]
We present a quantum analog for classical runtime analysis when solving real-world instances of important optimization problems.
We show that a practical quantum advantage for realistic problem sizes would require quantum gate operation times that are considerably below current physical limitations.
arXiv Detail & Related papers (2023-11-16T16:11:44Z) - Hamiltonian Encoding for Quantum Approximate Time Evolution of Kinetic
Energy Operator [2.184775414778289]
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers.
We have proposed a new encoding method, namely quantum approximate time evolution (QATE) for the quantum implementation of the kinetic energy operator.
arXiv Detail & Related papers (2023-10-05T05:25:38Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Gaussian initializations help deep variational quantum circuits escape
from the barren plateau [87.04438831673063]
Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.
However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.
This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
arXiv Detail & Related papers (2022-03-17T15:06:40Z) - On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
We devise three effective QAE-based learning protocols to address three classically computational hard learning problems.
Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Realizing topologically ordered states on a quantum processor [0.0845004185087851]
Topologically ordered states has proven to be extremely challenging in both condensed matter and synthetic quantum systems.
We prepare the ground state of the toric code Hamiltonian using an efficient quantum circuit on a superconducting quantum processor.
arXiv Detail & Related papers (2021-04-02T18:00:01Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
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.