A comparative study of universal quantum computing models: Toward a physical unification
DS Wang - Quantum Engineering, 2021 - Wiley Online Library
Quantum computing has been a fascinating research field in quantum physics. Recent
progresses motivate us to study in depth the universal quantum computing models …
progresses motivate us to study in depth the universal quantum computing models …
quapl: Modeling quantum computation in an array programming language
S Núñcz-Corrales, M Frenkel… - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
Most contemporary quantum programming languages describe computation as circuits,
using a host classical counterpart to drive the execution of quantum programs. However, the …
using a host classical counterpart to drive the execution of quantum programs. However, the …
Quantum abstract machines without circuits: the need for higher algorithmic expressiveness
S Núñez-Corrales - arXiv preprint arXiv:2307.08422, 2023 - arxiv.org
Existing abstract models of quantum computation make reference to circuit elements, much
in contrast to their classical counterparts. Circuits, as a model of computation, substantially …
in contrast to their classical counterparts. Circuits, as a model of computation, substantially …
Understanding the Computational Complexity of Diverse Classes of Turing and Super-Turing Computational Models
G Abdelmoumin, C Liu, D Rawat - … International Conference on …, 2023 - ieeexplore.ieee.org
The need to solve scientific problems using automated means and hence analyze the
performance and measure the complexities of their algorithmic solutions had led to the …
performance and measure the complexities of their algorithmic solutions had led to the …
Comparison among Classical, Probabilistic and Quantum Algorithms for Hamiltonian Cycle problem
G Corrente, CV Stanzione, V Stanzione - arXiv preprint arXiv:2311.10941, 2023 - arxiv.org
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having
a graph G with n nodes and m edges and finding the path that connects each node exactly …
a graph G with n nodes and m edges and finding the path that connects each node exactly …
Quantum circuit design for universal distribution using a superposition of classical automata
In this research, we present a quantum circuit design and implementation for a parallel
universal linear bounded automata. This circuit is able to accelerate the inference of …
universal linear bounded automata. This circuit is able to accelerate the inference of …
Theoretical and Mathematical Physics Seminar
НМ Николов - theo.inrne.bas.bg
Квантовата теория преобръща представите ни за света, в това число и за компютрите.
Докато за класическите компютри един от въпросите пред начинаещите е" как се …
Докато за класическите компютри един от въпросите пред начинаещите е" как се …