Feasibility study of quantum computing using trapped electrons
- URL: http://arxiv.org/abs/2112.04034v1
- Date: Tue, 7 Dec 2021 23:10:19 GMT
- Title: Feasibility study of quantum computing using trapped electrons
- Authors: Qian Yu, Alberto M. Alonso, Jackie Caminiti, Kristin M. Beck, R. Tyler
Sutherland, Dietrich Leibfried, Kayla J. Rodriguez, Madhav Dhital, Boerge
Hemmerling, Hartmut H\"affner
- Abstract summary: We discuss the necessary experimental steps to realize such a device through a concrete design proposal.
simulations indicate that two-qubit Bell-state fidelities of order 99.99% can be achieved.
- Score: 5.728925295115729
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We investigate the feasibility of using electrons in a linear Paul trap as
qubits in a future quantum computer. We discuss the necessary experimental
steps to realize such a device through a concrete design proposal, including
trapping, cooling, electronic detection, spin readout and single and
multi-qubit gate operations. Numeric simulations indicate that two-qubit
Bell-state fidelities of order 99.99% can be achieved assuming reasonable
experimental parameters.
Related papers
- An Improved Quantum Algorithm of the Multislice Method [0.716879432974126]
The multisilce method is an important algorithm for electron diffraction and image simulations in transmission electron microscopy.
In this work we have developed an improved quantum algorithm.
We reconstruct the phase-shifting quantum circuit without using the multi-controlled quantum gates, thereby significantly improve the computation efficiency.
arXiv Detail & Related papers (2024-11-26T14:47:51Z) - 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) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Simulating electronic structure on bosonic quantum computers [34.84696943963362]
We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.
This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
arXiv Detail & Related papers (2024-04-16T02:04:11Z) - On the feasibility of quantum teleportation protocols implemented with Silicon devices [0.3222802562733786]
Silicon-based spin quantum bit (qubit) have emerged as promising candidates for scalable quantum computing.
We present a computational investigation of entanglement-based quantum information applications implemented on an electrically defined quantum dot structure in Silicon.
arXiv Detail & Related papers (2024-03-28T16:35:39Z) - Toward coherent quantum computation of scattering amplitudes with a
measurement-based photonic quantum processor [0.0]
We discuss the feasibility of using quantum optical simulation for studying scattering observables that are presently inaccessible via lattice QCD.
We show that recent progress in measurement-based photonic quantum computing can be leveraged to provide deterministic generation of required exotic gates.
arXiv Detail & Related papers (2023-12-19T21:36:07Z) - 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) - An Amplitude-Based Implementation of the Unit Step Function on a Quantum
Computer [0.0]
We introduce an amplitude-based implementation for approximating non-linearity in the form of the unit step function on a quantum computer.
We describe two distinct circuit types which receive their input either directly from a classical computer, or as a quantum state when embedded in a more advanced quantum algorithm.
arXiv Detail & Related papers (2022-06-07T07:14:12Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator [41.74498230885008]
We demonstrate a programmable quantum simulator based on deterministically prepared two-dimensional arrays of neutral atoms.
We benchmark the system by creating and characterizing high-fidelity antiferromagnetically ordered states.
We then create and study several new quantum phases that arise from the interplay between interactions and coherent laser excitation.
arXiv Detail & Related papers (2020-12-22T19:00:04Z)
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.