• Documents
  • Authors
  • Tables

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

LEQA: Latency Estimation for a Quantum Algorithm Mapped to a Quantum Circuit Fabric (2013)

by M J Dousti, M Pedram
Venue:in DAC
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

Squash: A Scalable Quantum Mapper Considering Ancilla Sharing

by Mohammad Javad Dousti, Alireza Shafaei, Massoud Pedram
"... Quantum algorithms for solving problems of interesting size often result in circuits with a very large number of qubits and quantum gates. Fortunately, these algorithms also tend to contain a small number of repetitively-used quantum kernels. Identifying the quantum logic blocks that implement such ..."
Abstract - Add to MetaCart
Quantum algorithms for solving problems of interesting size often result in circuits with a very large number of qubits and quantum gates. Fortunately, these algorithms also tend to contain a small number of repetitively-used quantum kernels. Identifying the quantum logic blocks that implement such quantum kernels is critical to the complexity management for realizing the corresponding quantum circuit. Moreover, quantum computation requires some type of quantum error correction coding to combat decoherence, which in turn results in a large number of ancilla qubits in the circuit. Sharing the ancilla qubits among quantum operations (even though this sharing can increase the overall circuit latency) is important in order to curb the resource demand of the quantum algorithm. This paper presents a multi-core reconfigurable quantum processor architecture, called Requp, which supports a layered approach to mapping a quantum algorithm and ancilla sharing. More precisely, a scalable quantum mapper, called Squash, is introduced, which divides a given quantum circuit into a number of quantum kernels—each kernel comprises k parts such that each part will run on exactly one of k available cores. Experimental results demonstrate that Squash can handle large-scale quantum algorithms while providing an effective mechanism for sharing ancilla qubits.
(Show Context)

Citation Context

... well, but it doessnot help for the second level. Real-size quantum circuits (evenswithout QEC) are so large that traditional mappers introduced bysprevious researchers cannot efficiently handle them =-=[1]-=-.sReference [2] shows that Shor’s factorization algorithm for a 1024bit integer has 1.35×1015 physical instructions. Assuming that thesone-level ۤ7,1,3ۥ Steane code is used in this implementation, eac...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University