Multiple Silicon Dangling-Bond Charge qubits for quantum computing: A
Hilbert-Space Analysis of the Hamiltonian
- URL: http://arxiv.org/abs/2304.00283v2
- Date: Wed, 19 Apr 2023 05:40:00 GMT
- Title: Multiple Silicon Dangling-Bond Charge qubits for quantum computing: A
Hilbert-Space Analysis of the Hamiltonian
- Authors: Zahra Shaterzadeh-Yazdi
- Abstract summary: In universal quantum computing, it is crucial to evaluate and characterize the computational Hilbert space.
Here, we recognize this problem to understand the complexity and characteristics of the Hilbert space in our dangling-bond qubit model.
The required classical memory for storage of the qubit information is analysed when the number of qubits grows.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: Silicon-based dangling-bond charge qubit is one of the auspicious models for
universal fault-tolerant solid-state quantum computing. In universal quantum
computing, it is crucial to evaluate and characterize the computational Hilbert
space and reduce the complexity and size of the computational space. Here, we
recognize this problem to understand the complexity and characteristics of the
Hilbert space in our dangling-bond qubit model. The size of the desired Hilbert
space can prominently be reduced by considering assumptions regarding the qubit
loss. Moreover, the dimension of the desired subsets in the space shrinks by a
factor of two due to the spin preservation property. Finally, the required
classical memory for storage of the qubit information, Hamiltonian and Hilbert
space is analysed when the number of qubits grows.
Related papers
- Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
Storing quantum information requires battling quantum decoherence, which results in a loss of information over time.
To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another.
We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
arXiv Detail & Related papers (2024-07-08T12:46:08Z) - Quantum Simulation of SU(3) Lattice Yang Mills Theory at Leading Order in Large N [0.0]
We show how the Hilbert space and interactions can be expanded in inverse powers of N_c.
We give explicit constructions that allow simple representations of SU(3) gauge fields on qubits and qutrits.
This formulation allows a simulation of the real time dynamics of a SU(3) lattice gauge theory on a 5x5 and 8x8 lattice on ibm_torino with a CNOT depth of 113.
arXiv Detail & Related papers (2024-02-15T19:00:01Z) - Simulating the Femtouniverse on a Quantum Computer [0.0]
We compute the low-lying spectrum of 4D SU(2) Yang-Mills in a finite volume using quantum simulations.
In this limit the theory is equivalent to the quantum mechanics of three interacting particles moving inside a 3-ball with certain boundary conditions.
arXiv Detail & Related papers (2022-11-20T05:09:01Z) - Continuous percolation in a Hilbert space for a large system of qubits [58.720142291102135]
The percolation transition is defined through the appearance of the infinite cluster.
We show that the exponentially increasing dimensionality of the Hilbert space makes its covering by finite-size hyperspheres inefficient.
Our approach to the percolation transition in compact metric spaces may prove useful for its rigorous treatment in other contexts.
arXiv Detail & Related papers (2022-10-15T13:53:21Z) - Constraint Inequalities from Hilbert Space Geometry & Efficient Quantum
Computation [0.0]
Useful relations describing arbitrary parameters of given quantum systems can be derived from simple physical constraints imposed on the vectors in the corresponding Hilbert space.
We describe the procedure and point out that this parallels the necessary considerations that make Quantum Simulation of quantum fields possible.
We suggest how to use these ideas to guide and improve parameterized quantum circuits.
arXiv Detail & Related papers (2022-10-13T22:13:43Z) - Quantum dynamics corresponding to chaotic BKL scenario [62.997667081978825]
Quantization smears the gravitational singularity avoiding its localization in the configuration space.
Results suggest that the generic singularity of general relativity can be avoided at quantum level.
arXiv Detail & Related papers (2022-04-24T13:32:45Z) - Bosonic field digitization for quantum computers [62.997667081978825]
We address the representation of lattice bosonic fields in a discretized field amplitude basis.
We develop methods to predict error scaling and present efficient qubit implementation strategies.
arXiv Detail & Related papers (2021-08-24T15:30:04Z) - Constructing Qudits from Infinite Dimensional Oscillators by Coupling to
Qubits [3.161454999079499]
We show how a Hilbert space can be analytically constructed from the lowest energy states of a qubit-oscillator system.
This work suggests that the combination of a qubit and a bosonic system may serve as hardware-efficient quantum resources for quantum information processing.
arXiv Detail & Related papers (2021-05-06T18:00:31Z) - Qubit regularization of asymptotic freedom [35.37983668316551]
Heisenberg-comb acts on a Hilbert space with only two qubits per spatial lattice site.
We show that the model reproduces the universal step-scaling function of the traditional model up to correlation lengths of 200,000 in lattice units.
We argue that near-term quantum computers may suffice to demonstrate freedom.
arXiv Detail & Related papers (2020-12-03T18:41:07Z) - Quantum Space, Quantum Time, and Relativistic Quantum Mechanics [0.0]
We treat space and time as quantum degrees of freedom on an equal footing in Hilbert space.
Motivated by considerations in quantum gravity, we focus on a paradigm dealing with linear, first-order translations Hamiltonian and momentum constraints.
arXiv Detail & Related papers (2020-04-20T09:04:15Z) - Quantum Statistical Complexity Measure as a Signalling of Correlation
Transitions [55.41644538483948]
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions.
We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain.
We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
arXiv Detail & Related papers (2020-02-05T00:45:21Z)
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.