A family of quantum von Neumann architecture
- URL: http://arxiv.org/abs/2304.03460v1
- Date: Fri, 7 Apr 2023 03:24:55 GMT
- Title: A family of quantum von Neumann architecture
- Authors: D.-S. Wang
- Abstract summary: We develop a family of quantum von Neumann architecture, with modular units of memory, control, CPU, internet, besides input and output.
Such a family satisfies other desirable engineering requirements on system and algorithm designs, such as the modularity and programmability.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: In this work, we develop universal quantum computing models that form a
family of quantum von Neumann architecture, with modular units of memory,
control, CPU, internet, besides input and output. This family contains three
generations characterized by dynamical quantum resource theory, and it also
circumvents no-go theorems on quantum programming and control. Besides
universality, such a family satisfies other desirable engineering requirements
on system and algorithm designs, such as the modularity and programmability,
hence serves as a unique approach to build universal quantum computers.
Related papers
- The QUATRO Application Suite: Quantum Computing for Models of Human
Cognition [49.038807589598285]
We unlock a new class of applications ripe for quantum computing research -- computational cognitive modeling.
We release QUATRO, a collection of quantum computing applications from cognitive models.
arXiv Detail & Related papers (2023-09-01T17:34:53Z) - A survey of universal quantum von Neumann architecture [0.0]
We study the recently proposed model of quantum von Neumann architecture, by putting it in a practical and broader setting.
We analyze the structures of quantum CPU and quantum control unit, and draw their connections with computational advantages.
arXiv Detail & Related papers (2023-07-26T14:35:40Z) - QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks.
Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture.
We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
arXiv Detail & Related papers (2023-04-14T08:03:20Z) - Universal resources for quantum computing [0.0]
We develop the theory of universal resources in the setting of universal quantum computing model (UQCM)
We study three natural families of UQCMs in details: the amplitude family, the quasi-probability family, and the Hamiltonian family.
It also provides a rigorous framework to resolve puzzles, such as the role of entanglement vs. interference, and unravel resource-theoretic features of quantum algorithms.
arXiv Detail & Related papers (2023-03-07T07:56:38Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Trapped Ions as an Architecture for Quantum Computing [110.83289076967895]
We describe one of the most promising platforms for the construction of a universal quantum computer.
We discuss from the physics involved in trapping ions in electromagnetic potentials to the Hamiltonian engineering needed to generate a universal set of logic gates.
arXiv Detail & Related papers (2022-07-23T22:58:50Z) - Quantum Neural Architecture Search with Quantum Circuits Metric and
Bayesian Optimization [2.20200533591633]
We propose a new quantum gates distance that characterizes the gates' action over every quantum state.
Our approach significantly outperforms the benchmark on three empirical quantum machine learning problems.
arXiv Detail & Related papers (2022-06-28T16:23:24Z) - A prototype of quantum von Neumann architecture [0.0]
We propose a model of universal quantum computer system, the quantum version of the von Neumann architecture.
It uses ebits as elements of the quantum memory unit, and qubits as elements of the quantum control unit and processing unit.
Our primary study demonstrates the manifold power of quantum information and paves the way for the creation of quantum computer systems.
arXiv Detail & Related papers (2021-12-17T06:33:31Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Exploring a Double Full-Stack Communications-Enabled Architecture for
Multi-Core Quantum Computers [0.0]
We propose a double full-stack architecture encompassing quantum computation and quantum communications.
Using behavioral models and actual measurements from existing quantum computers, the results of simulations suggest that multi-core architectures may effectively unleash the full quantum computer potential.
arXiv Detail & Related papers (2020-09-17T09:58:26Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z)
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.