Title
Automated Quantum Circuit Synthesis and Cost Estimation for the Binary Welded Tree Oracle
Abstract
Quantum computing is a new computational paradigm that promises an exponential speed-up over classical algorithms. To develop efficient quantum algorithms for problems of a non-deterministic nature, random walk is one of the most successful concepts employed. In this article, we target both continuous-time and discrete-time random walk in both the classical and quantum regimes. Binary Welded Tree (BWT), or glued tree, is one of the most well-known quantum walk algorithms in the continuous-time domain. Prior work implements quantum walk on the BWT with static welding. In this context, static welding is randomized but case-specific. We propose a solution to automatically generate the circuit for the Oracle for welding. We implement the circuit using the Quantum Assembly Language, which is a language for describing quantum circuits. We then optimize the generated circuit using the Fault-Tolerant Quantum Logic Synthesis tool for any BWT instance. Automatic welding enables us to provide a generalized solution for quantum walk on the BWT.
Year
DOI
Venue
2017
10.1145/3060582
JETC
Keywords
Field
DocType
Binary welded tree,quantum computing,quantum logic synthesis,quantum walk,reversible circuit
Quantum phase estimation algorithm,Computer science,Algorithm,Quantum computer,Theoretical computer science,Quantum walk,Quantum sort,Quantum algorithm,Quantum Fourier transform,Quantum information,Quantum network
Journal
Volume
Issue
ISSN
13
4
1550-4832
Citations 
PageRank 
References 
1
0.36
10
Authors
3
Name
Order
Citations
PageRank
Mrityunjay Ghosh110.36
Amlan Chakrabarti216148.06
Niraj K. Jha3233.73