scholarly journals Natural Argument by a Quantum Computer

2020 ◽  
Author(s):  
Vasil Dinev Penchev
Keyword(s):  
Quantum Computation ◽  
Turing Machine ◽  
Quantum Computer ◽  
Irrational Number ◽  
Computational Process

Natural argument is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary natural arguments in any data.That ability of natural argument is interpreted as an intellect featuring any quantum computer.The property is valid only within a quantum computer: To utilize it, the observer should be sitedinside it. Being outside it, the observer would obtain quite different result depending on thedegree of the entanglement of the quantum computer and observer. All extraordinary propertiesof a quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three typesof quantum computation can be distinguished according to whether the series is a finite one, aninfinite rational or irrational number

scholarly journals A Quantum Computer in a “Chinese Room”

2020 ◽  
Author(s):  
Vasil Penchev
Keyword(s):  
Pattern Recognition ◽  
Quantum Computation ◽  
Turing Machine ◽  
Quantum Computer ◽  
Irrational Number ◽  
Computational Process ◽  
Chinese Room ◽  
Universal Pattern ◽  
Quantum Turing Machine

<div>Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.</div>

scholarly journals A Quantum Computer in a “Chinese Room”

2020 ◽  
Author(s):  
Vasil Penchev
Keyword(s):  
Pattern Recognition ◽  
Quantum Computation ◽  
Turing Machine ◽  
Quantum Computer ◽  
Irrational Number ◽  
Computational Process ◽  
Chinese Room ◽  
Universal Pattern ◽  
Quantum Turing Machine

<div>Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.</div>

scholarly journals A Quantum Computer in a “Chinese Room”

2020 ◽  
Author(s):  
Vasil Dinev Penchev
Keyword(s):  
Pattern Recognition ◽  
Turing Machine ◽  
Quantum Computer ◽  
Irrational Number ◽  
Computational Process ◽  
Chinese Room

Pattern recognition is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary patterns in any data. That ability ofuniversal pattern recognition is interpreted as an intellect featuring any quantum computer. Theproperty is valid only within a quantum computer: To utilize it, the observer should be sited insideit. Being outside it, the observer would obtain quite different result depending on the degreeof the entanglement of the quantum computer and observer. All extraordinary properties ofa quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three types ofquantum computation can be distinguished according to whether the series is a finite one, an infiniterational or irrational number.

scholarly journals Quantum Computer: Quantum Model and Reality

2020 ◽  
Author(s):  
Vasil Dinev Penchev
Keyword(s):  
Quantum Mechanics ◽  
Turing Machine ◽  
Quantum Computer ◽  
Classical Model ◽  
Hidden Variables ◽  
Quantum Model ◽  
Computational Process ◽  
Intermediate Domain ◽  
And Mathematics ◽  
The Axiom Of Choice

Any computer can create a model of reality. The hypothesis that quantum computer can generate such a model designated as quantum, which coincides with the modeled reality, is discussed. Its reasons are the theorems about the absence of “hidden variables” in quantum mechanics. The quantum modeling requires the axiom of choice. The following conclusions are deduced from the hypothesis. A quantum model unlike a classical model can coincide with reality. Reality can be interpreted as a quantum computer. The physical processes represent computations of the quantum computer. Quantum information is the real fundament of the world. The conception of quantum computer unifies physics and mathematics and thus the material and the ideal world. Quantum computer is a non-Turing machine in principle. Any quantum computing can be interpreted as an infinite classical computational process of a Turing machine. Quantum computer introduces the notion of “actually infinite computational process”. The discussed hypothesis is consistent with all quantum mechanics. The conclusions address a form of neo-Pythagoreanism: Unifying the mathematical and physical, quantum computer is situated in an intermediate domain of their mutual transformations.

scholarly journals Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Ismail Ghodsollahee ◽  
Zohreh Davarzani ◽  
Mariam Zomorodi ◽  
Paweł Pławiak ◽  
Monireh Houshmand ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Connectivity Matrix ◽  
Circuit Optimization ◽  
Novel Approach ◽  
The Matrix ◽  
Minimum Number ◽  
Two Phases

AbstractAs quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.

scholarly journals MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES

2009 ◽  
Vol 07 (06) ◽  
pp. 1053-1203 ◽  
Author(s):  
ROBERT RAUßENDORF
Keyword(s):  
Computational Model ◽  
Quantum Computation ◽  
Quantum Logic ◽  
Network Model ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
Cluster State ◽  
Building Blocks ◽  
Network Simulator ◽  
Classical Level

In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.

TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT

2007 ◽  
Vol 05 (01n02) ◽  
pp. 223-228 ◽  
Author(s):  
ANNALISA MARZUOLI ◽  
MARIO RASETTI
Keyword(s):  
Field Theory ◽  
Quantum Field Theory ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Algorithm ◽  
Topological Quantum Field Theory ◽  
Quantum Field ◽  
Topological Quantum

We resort to considerations based on topological quantum field theory to outline the development of a possible quantum algorithm for the evaluation of the permanent of a 0 - 1 matrix. Such an algorithm might represent a breakthrough for quantum computation, since computing the permanent is considered a "universal problem", namely, one among the hardest problems that a quantum computer can efficiently handle.

scholarly journals Quantum Circuits for Dynamic Runtime Assertions in Quantum Computation

2019 ◽  
Author(s):  
Ji Liu ◽  
Greg Byrd ◽  
Huiyang Zhou
Keyword(s):  
Open Source ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Circuits ◽  
Intermediate Scale

In this paper, we propose quantum circuits to enable dynamic assertions for classical values, entanglement, and superposition. This enables a dynamic debugging primitive, driven by a programmer’s understanding of the correct behavior of the quantum program. We show that besides generating assertion errors, the assertion logic may also force the qubits under test to be into the desired state. Besides debugging, our proposed assertion logic can also be used in noisy intermediate scale quantum (NISQ) systems to filter out erroneous results, as demonstrated on a 20-qubit IBM Q quantum computer. Our proposed assertion circuits have been implemented as functions in the open-source Qiskit tool.

Quantum computing and polynomial equations over Z_2

2005 ◽  
Vol 5 (2) ◽  
pp. 102-112
Author(s):  
C.M. Dawson ◽  
H.L. Haselgrove ◽  
A.P. Hines ◽  
D. Mortimer ◽  
M.A. Nielsen ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Finite Field ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Complexity Classes ◽  
Polynomial Equations ◽  
Computational Power ◽  
Number Of Solutions

What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field Z_2. This connection allows simple proofs to be given for two known relationships between quantum and classical complexity classes, namely BQP/P/\#P and BQP/PP.

Quantum Algorithms

2021 ◽  
pp. 82-101
Author(s):  
Renata Wong ◽  
Amandeep Singh Bhatia
Keyword(s):  
Quantum Computing ◽  
Fault Tolerance ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Computer Hardware ◽  
Quantum Mechanical ◽  
Computational Power ◽  
Quantum Devices ◽  
The Core

In the last two decades, the interest in quantum computation has increased significantly among research communities. Quantum computing is the field that investigates the computational power and other properties of computers on the basis of the underlying quantum-mechanical principles. The main purpose is to find quantum algorithms that are significantly faster than any existing classical algorithms solving the same problem. While the quantum computers currently freely available to wider public count no more than two dozens of qubits, and most recently developed quantum devices offer some 50-60 qubits, quantum computer hardware is expected to grow in terms of qubit counts, fault tolerance, and resistance to decoherence. The main objective of this chapter is to present an introduction to the core quantum computing algorithms developed thus far for the field of cryptography.

Sign in / Sign up

Export Citation Format

Share Document