Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 8 figures, To appear in the International Symposium on Computer Architecture (ISCA-33), Boston, MA, 2006

Scientific paper

The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, ``sea-of-qubits'' architectures. The resulting architectures overcome the primary challenges of reliability and scalability at the cost of physically unacceptable system area. We find that by exploiting the natural serialization at both the application and the physical microarchitecture level of a quantum computer, we can reduce the area requirement while improving performance. In particular we present a scalable quantum architecture design that employs specialization of the system into memory and computational regions, each individually optimized to match hardware support to the available parallelism. Through careful application and system analysis, we find that our new architecture can yield up to a factor of thirteen savings in area due to specialization. In addition, by providing a memory hierarchy design for quantum computers, we can increase time performance by a factor of eight. This result brings us closer to the realization of a quantum processor that can solve meaningful problems.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-286822

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.