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.

scholarly journals The computational power of matchgates and the XY interaction on arbitrary graphs

2014 ◽  
Vol 14 (11&12) ◽  
pp. 901-916
Author(s):  
Daniel J. Brod ◽  
Andrew M. Childs
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Connected Graph ◽  
Nearest Neighbor ◽  
Proper Subset ◽  
Computational Power ◽  
Arbitrary Graphs

Matchgates are a restricted set of two-qubit gates known to be classically simulable when acting on nearest-neighbor qubits on a path, but universal for quantum computation when the qubits are arranged on certain other graphs. Here we characterize the power of matchgates acting on arbitrary graphs. Specifically, we show that they are universal on any connected graph other than a path or a cycle, and that they are classically simulable on a cycle. We also prove the same dichotomy for the XY interaction, a proper subset of matchgates related to some implementations of quantum computing.

On the Number of Zeros Over a Finite Field of Certain Symmetric Polynomials

1980 ◽  
Vol 23 (3) ◽  
pp. 327-332
Author(s):  
P. V. Ceccherini ◽  
J. W. P. Hirschfeld
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Polynomial Equations ◽  
Symmetric Polynomials ◽  
Number Of Solutions ◽  
Number Of Zeros

A variety of applications depend on the number of solutions of polynomial equations over finite fields. Here the usual situation is reversed and we show how to use geometrical methods to estimate the number of solutions of a non-homogeneous symmetric equation in three variables.

AN APPROXIMATELY UNIVERSAL SET CONSISTING OF TWO OBSERVABLES

2011 ◽  
Vol 09 (06) ◽  
pp. 1393-1412
Author(s):  
YASUHIRO TAKAHASHI
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Computational Power ◽  
Graph State ◽  
State Preparation ◽  
Projective Measurements

We consider the problem of minimizing the resources required for approximate universality in measurement-only quantum computation. This problem is important not only for realizing a quantum computer, but also for understanding the computational power of quantum computation. The resources we focus on are observables, which describe projective measurements, and ancillary qubits. We show that, if we are allowed to use two ancillary qubits, the set of observables { cos (π/8)X - sin (π/8)Y ,Z ⊗ X} is approximately universal for quantum computation. This is the first construction of an approximately universal set consisting only of one one-qubit observable and one two-qubit observable. Using the proof of the approximate universality, we also show that, if we are allowed to use two initialized ancillary qubits, one two-qubit observable is sufficient for graph state preparation. The use of only one two-qubit observable is optimal in terms of the number of observables available and the number of qubits to be measured jointly.

scholarly journals Quantum Computing Concepts with Deutsch Jozsa Algorithm

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Poornima Aradyamath ◽  
Naghabhushana N M ◽  
Rohitha Ujjinimatad
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Computation ◽  
Mathematical Description ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Quantum Fourier Transform ◽  
Basic Concepts ◽  
Classical Computer

In this paper, we briefly review the basic concepts of quantum computation,  entanglement,  quantum cryptography and quantum fourier  transform.   Quantum algorithms like Deutsch Jozsa, Shor’s   factorization and Grover’s data search are developed using fourier  transform  and quantum computation concepts to build quantum computers.  Researchers are finding a way to build quantum computer that works more efficiently than classical computer.  Among the  standard well known  algorithms  in the field of quantum computation  and communication we  describe  mathematically Deutsch Jozsa algorithm  in detail for  2  and 3 qubits.  Calculation of balanced and unbalanced states is shown in the mathematical description of the algorithm.

scholarly journals Programming gate-based hardware quantum computers for music

Muzikologija ◽  
2018 ◽  
pp. 21-37
Author(s):  
Alexis Kirke
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computing ◽  
Quantum Computation ◽  
Computer Music ◽  
Quantum Computer ◽  
Quantum Computers ◽  
Future Contribution ◽  
Computer Algorithms ◽  
Quantum Processes ◽  
D Wave

There have been significant attempts previously to use the equations of quantum mechanics for generating sound, and to sonify simulated quantum processes. For new forms of computation to be utilized in computer music, eventually hardware must be utilized. This has rarely happened with quantum computer music. One reason for this is that it is currently not easy to get access to such hardware. A second is that the hardware available requires some understanding of quantum computing theory. This paper moves forward the process by utilizing two hardware quantum computation systems: IBMQASM v1.1 and a D-Wave 2X. It also introduces the ideas behind the gate-based IBM system, in a way hopefully more accessible to computerliterate readers. This is a presentation of the first hybrid quantum computer algorithm, involving two hardware machines. Although neither of these algorithms explicitly utilize the promised quantum speed-ups, they are a vital first step in introducing QC to the musical field. The article also introduces some key quantum computer algorithms and discusses their possible future contribution to computer music.

Guest Column

2021 ◽  
Vol 52 (3) ◽  
pp. 38-59
Author(s):  
Carlo Mereghetti ◽  
Beatrice Palano
Keyword(s):  
Quantum Computing ◽  
Complexity Theory ◽  
Quantum Computer ◽  
Structural Complexity ◽  
Research Area ◽  
Point Of View ◽  
Quantum Mechanical ◽  
Turing Machines ◽  
Computational Power ◽  
Quantum Turing Machine

Quantum computing is a prolific research area, halfway between physics and computer science [27, 29, 52]. Most likely, its origins may be dated back to 70's, when some works on quantum information began to appear (see, e.g., [34, 37]). In early 80's, R.P. Feynman suggested that the computational power of quantum mechanical processes might be beyond that of traditional computation models [25]. Almost at the same time, P. Benioff already proved that such processes are at least as powerful as Turing machines [9]. In 1985, D. Deutsch [22] proposed the notion of a quantum Turing machine as a physically realizable model for a quantum computer. From the point of view of structural complexity, E. Bernstein and U. Vazirani introduced in [20] the class BQP of problems solvable in polynomial time on quantum Turing machines, focusing attention on relations with the corresponding deterministic and probabilistic classes P and BPP, respectively. Several works in the literature explored classical issues in complexity theory from the quantum paradigm perspective (see, e.g., [7, 60, 61]).

scholarly journals Universal quantum computation via quantum controlled classical operations

2021 ◽  
Author(s):  
Sebastian Horvat ◽  
Xiaoqin Gao ◽  
Borivoje Dakic
Keyword(s):  
Quantum Computing ◽  
Control System ◽  
Quantum Computation ◽  
Quantum Control ◽  
Quantum Computer ◽  
Affirmative Answer ◽  
Quantum Gates ◽  
Processing Power ◽  
Universal Quantum ◽  
Hadamard Gate

Abstract A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results in universal quantum computing. Motivated by the latter, we pose the following question: can one perform universal quantum computation by supplementing a set of classical gates with a quantum control, and a set of quantum gates operating solely on the latter? In this work we provide an affirmative answer to this question by considering a computational model that consists of 2n target bits together with a set of classical gates controlled by log(2n + 1) ancillary qubits. We show that this model is equivalent to a quantum computer operating on n qubits. Furthermore, we show that even a primitive computer that is capable of implementing only SWAP gates, can be lifted to universal quantum computing, if aided with an appropriate quantum control of logarithmic size. Our results thus exemplify the information processing power brought forth by the quantum control system.

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 Ranked solutions of the matric equationA1X1=A2X2

1980 ◽  
Vol 3 (2) ◽  
pp. 293-304 ◽  
Author(s):  
A. Duane Porter ◽  
Nick Mousouris
Keyword(s):  
Finite Field ◽  
Number Of Solutions

LetGF(pz)denote the finite field ofpzelements. LetA1bes×mof rankr1andA2bes×nof rankr2with elements fromGF(pz). In this paper, formulas are given for finding the number ofX1,X2overGF(pz)which satisfy the matric equationA1X1=A2X2, whereX1ism×tof rankk1, andX2isn×tof rankk2. These results are then used to find the number of solutionsX1,…,Xn,Y1,…,Ym,m,n>1, of the matric equationA1X1…Xn=A2Y1…Ym.

Sign in / Sign up

Export Citation Format

Share Document