Analysis of quantum particle automata for solving the density classification problem

Analysis of quantum particle automata for solving the density classification problem To advance our understanding of quantum cellular automata in problem solving through parallel and distributed computing, this research quantized the density classification problem and adopted the quantum particle automata (QPA) to solve the quantized problem. In order to solve this problem, the QPA needed a unitary operator to carry out the QPA evolution and a boundary partition to make the classification decisions. We designed a genetic algorithm (GA) to search for the unitary operators and the boundary partitions to classify the density of binary inputs with length 5. The GA was able to find more than one unitary operator that can transform the QPA in ways such that when the particle was measured, it was more likely to collapse to the basis states that were on the correct side of the boundary partition for the QPA to decide whether the binary input had majority density 0 or majority density 1. We analyzed these solutions and found that the QPA evolution dynamic was driven by a particular parameter $$\theta $$ θ of the unitary operator: A small $$\theta $$ θ gave the particle small mass hence fast evolution, while large $$\theta $$ θ had the opposite effect. While these results are encouraging, scaling these solutions for binary inputs of arbitrary length of $$n$$ n requires additional analysis, which we will investigate in our future work. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Analysis of quantum particle automata for solving the density classification problem

Loading next page...
 
/lp/springer_journal/analysis-of-quantum-particle-automata-for-solving-the-density-HVBoRXaPrh
Publisher
Springer Journals
Copyright
Copyright © 2015 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-015-0930-3
Publisher site
See Article on Publisher Site

Abstract

To advance our understanding of quantum cellular automata in problem solving through parallel and distributed computing, this research quantized the density classification problem and adopted the quantum particle automata (QPA) to solve the quantized problem. In order to solve this problem, the QPA needed a unitary operator to carry out the QPA evolution and a boundary partition to make the classification decisions. We designed a genetic algorithm (GA) to search for the unitary operators and the boundary partitions to classify the density of binary inputs with length 5. The GA was able to find more than one unitary operator that can transform the QPA in ways such that when the particle was measured, it was more likely to collapse to the basis states that were on the correct side of the boundary partition for the QPA to decide whether the binary input had majority density 0 or majority density 1. We analyzed these solutions and found that the QPA evolution dynamic was driven by a particular parameter $$\theta $$ θ of the unitary operator: A small $$\theta $$ θ gave the particle small mass hence fast evolution, while large $$\theta $$ θ had the opposite effect. While these results are encouraging, scaling these solutions for binary inputs of arbitrary length of $$n$$ n requires additional analysis, which we will investigate in our future work.

Journal

Quantum Information ProcessingSpringer Journals

Published: Feb 4, 2015

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off