Article

Automated generation of layout and control for quantum circuits

Authors:

Nemanja Isailovic,

John KubiatowiczAuthors Info & Claims

CF '07: Proceedings of the 4th international conference on Computing frontiers

Pages 83 - 94

https://doi.org/10.1145/1242531.1242546

Published: 07 May 2007 Publication History

Abstract

We present a computer-aided design flow for quantum circuits, complete with automatic layout and control logic extraction. To motivate automated layout for quantum circuits, we investigate grid-based layouts and show a performance variance of four times as we vary grid structure and initial qubit placement. We then propose two polynomial-time design heuristics: a greedy algorithm suitable for small, congestion-free quantum circuits and a dataflow-based analysis approach to placement and routing with implicit initial placement of qubits. Finally, we show that our dataflow-based heuristic generates better layouts than the state-of-the-art automated grid-based layout and scheduling mechanism in terms of latency and potential pipelinability, but at the cost of some area.

References

[1]

P. Aliferis, D. Gottesman, and J. Preskill. Quantum accuracy threshold for concatenated distance-3 codes. Arxiv preprint quant-ph/0504218, 2005.

[2]

S. Balensiefer, L. Kreger-Stickles, and M. Oskin. QUALE: quantum architecture layout evaluator. Proceedings of SPIE, 5815:103, 2005.

[3]

S. Balensiefer, L. Kregor-Stickles, and M. Oskin. An evaluation framework and instruction set architecture for ion-trap based quantum micro-architectures. Proc. 32nd Annual International Symposium on Computer Architecture, 2005.

Digital Library

[4]

J. I. Cirac and P. Zoller. Quantum computations with cold trapped ions. Phys. Rev. Lett, 74:4091--4094, 1995.

[5]

A. Cross. qasm-tools. http://www.media.mit.edu/quanta/quanta-web/projects/qasm-tools/, 2006.

[6]

L. Grover. Symposium on Theory of Computing (STOC 1996), pages 212--219.

Digital Library

[7]

W. Hensinger, S. Olmschenk, D. Stick, D. Hucul, M. Yeo, M. Acton, L. Deslauriers, C. Monroe, and J. Rabchuk. T-junction ion trap array for two-dimensional ion shuttling, storage, and manipulation. Applied Physics Letters, 88(3):34101, 2006.

[8]

D. Hucul, M. Yeo, W. K. Hensinger, J. Rabchuk, S. Olmschenk, and C. Monroe. On the transport of atomic ions in linear and multidimensional ion trap arrays. quant-ph/0702175, 2007.

[9]

N. Isailovic, Y. Patel, M. Whitney, and J. Kubiatowicz. Interconnection Networks for Scalable Quantum Computers. Proceedings of the 33rd International Symposium on Computer Architecture (ISCA), 2006.

Digital Library

[10]

D. Kielpinski, C. Monroe, and D.J. Wineland. Architecture for a large-scale ion-trap quantum computer. Nature, 417:709--711, 2002.

[11]

J. Kim, S. Pau, Z. Ma, H. McLellan, J. Gages, A. Kornblit, and R. Slusher. System design for large-scale ion trap quantum information processor. Quantum Information and Computation, 5(7):515--537, 2005.

Digital Library

[12]

C.M. Kyung, J.M. Widder, and D.A. Mlynski. Adaptive cluster growth (ACG); a new algorithm for circuit packingin rectilinear region. Design Automation Conference, 1990. EDAC. Proceedings of the European, pages 191--195, 1990.

Digital Library

[13]

M.J. Madsen, W.K. Hensinger, D. Stick, J.A. Rabchuk, and C. Monroe. Planar ion trap geometry for microfabrication. Applied Physics B: Lasers and Optics, 78:639--651, 2004.

[14]

T. Metodi, D. Thaker, A. Cross, F. Chong, and I. Chuang. A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation. Proceedings of the 38th International Symposium on Microarchitecture (MICRO), 2005.

Digital Library

[15]

T.S. Metodi, D.D. Thaker, A.W. Cross, F.T. Chong, and I.L. Chuang. Scheduling physical operations in a quantum information processor. Proceedings of SPIE, 6244:62440T, 2006.

[16]

C. Monroe, D. M. Meekhof, B. E. King, W. M. Itano, and D. J. Wineland. Demonstration of a universal quantum logic gate. Phys. Rev. Lett., 75:4714--4717, 1995.

[17]

C. Pearson, D. Leibrandt, W. Bakr, W. Mallard, K. Brown, and I. Chuang. Experimental investigation of planar ion traps. Phys. Rev. A, 73(3), 2006.

[18]

P.W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. 35'th Ann. Symp. on Foundations of Comp. Science (FOCS), pages 124--134, 1994.

[19]

A. M. Steane. Simple quantum error correcting codes. Phys. Rev. A, 54:4741--4751, 1996.

[20]

A.M. Steane. Overhead and noise threshold of fault-tolerant quantum error correction. Phys. Rev. A, 68(4):42322, 2003.

[21]

K. Svore, A. Aho, A. Cross, I. Chuang, and I. Markov. A Layered Software Architecture for Quantum Computing Design Tools. Computer, 39(1):74--83, 2006.

Digital Library

[22]

K. Svore, A. Cross, A. Aho, I. Chuang, and I. Markov. Toward a software architecture for quantum computing design tools. Proceedings of the 2nd International Workshop on Quantum Programming Languages (QPL), pages 145--162, 2004.

[23]

D.D. Thaker, T.S. Metodi, A.W. Cross, I.L. Chuang, and F.T. Chong. Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing. Proceedings of the 33rd International Symposium on Computer Architecture (ISCA), 2006.

Digital Library

[24]

W. Wootters and W. Zurek. A single quantum cannot be cloned. Nature, 299:802--803, 1982.

[25]

C. Zalka. Simulating quantum systems on a quantum computer. Proceedings: Mathematical, Physical and Engineering Sciences, 454(1969):313--322, 1998.

Cited By

Kusyk JSaeed SUyar M(2021)Survey on Quantum Circuit Compilation for Noisy Intermediate-Scale Quantum Computers: Artificial Intelligence to HeuristicsIEEE Transactions on Quantum Engineering10.1109/TQE.2021.30683552(1-16)Online publication date: 2021
https://doi.org/10.1109/TQE.2021.3068355
Tan BCong J(2021)Optimality Study of Existing Quantum Computing Layout Synthesis ToolsIEEE Transactions on Computers10.1109/TC.2020.300914070:9(1363-1373)Online publication date: 1-Sep-2021
https://doi.org/10.1109/TC.2020.3009140
Nikahd EMohammadzadeh NSedighi MZamani M(2021)Automated window-based partitioning of quantum circuitsPhysica Scripta10.1088/1402-4896/abd57c96:3(035102)Online publication date: 7-Jan-2021
https://doi.org/10.1088/1402-4896/abd57c
Show More Cited By

Index Terms

Automated generation of layout and control for quantum circuits
1. Hardware
  1. Electronic design automation
    1. Physical design (EDA)
  2. Very large scale integration design
    1. Application-specific VLSI designs
      1. Application specific instruction set processors
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Control structures

Recommendations

A fault tolerant, area efficient architecture for Shor's factoring algorithm

We optimize the area and latency of Shor's factoring while simultaneously improving fault tolerance through: (1) balancing the use of ancilla generators, (2) aggressive optimization of error correction, and (3) tuning the core adder circuits. Our custom ...
A fault tolerant, area efficient architecture for Shor's factoring algorithm
ISCA '09: Proceedings of the 36th annual international symposium on Computer architecture

We optimize the area and latency of Shor's factoring while simultaneously improving fault tolerance through: (1) balancing the use of ancilla generators, (2) aggressive optimization of error correction, and (3) tuning the core adder circuits. Our custom ...
Datapath and control for quantum wires

As quantum computing moves closer to reality the need for basic architectural studies becomes more pressing. Quantum wires, which transport quantum data, will be a fundamental component in all anticipated silicon quantum architectures. Since they cannot ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CF '07: Proceedings of the 4th international conference on Computing frontiers

May 2007

300 pages

ISBN:9781595936837

DOI:10.1145/1242531

General Chairs:
Utpal Banerjee
Intel, USA
,
José Moreira
IBM, USA
,
Program Chairs:
Michel Dubois
University of Southern California, USA
,
Per Stenström
Chalmers University of Technology, SE

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 May 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CF07

Sponsor:

CF07: Computing Frontiers Conference

May 7 - 9, 2007

Ischia, Italy

Acceptance Rates

Overall Acceptance Rate 273 of 785 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
369
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)1

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kusyk JSaeed SUyar M(2021)Survey on Quantum Circuit Compilation for Noisy Intermediate-Scale Quantum Computers: Artificial Intelligence to HeuristicsIEEE Transactions on Quantum Engineering10.1109/TQE.2021.30683552(1-16)Online publication date: 2021
https://doi.org/10.1109/TQE.2021.3068355
Tan BCong J(2021)Optimality Study of Existing Quantum Computing Layout Synthesis ToolsIEEE Transactions on Computers10.1109/TC.2020.300914070:9(1363-1373)Online publication date: 1-Sep-2021
https://doi.org/10.1109/TC.2020.3009140
Nikahd EMohammadzadeh NSedighi MZamani M(2021)Automated window-based partitioning of quantum circuitsPhysica Scripta10.1088/1402-4896/abd57c96:3(035102)Online publication date: 7-Jan-2021
https://doi.org/10.1088/1402-4896/abd57c
Baker JDuckering CHoover AChong FPalesi MPalermo GGraves CArima E(2020)Time-sliced quantum circuit partitioning for modular architecturesProceedings of the 17th ACM International Conference on Computing Frontiers10.1145/3387902.3392617(98-107)Online publication date: 11-May-2020
https://dl.acm.org/doi/10.1145/3387902.3392617
Bahreini TMohammadzadeh N(2020) A congestion‐aware mixed integer linear programming model for placement and scheduling of quantum circuits with a two‐level heuristic solution approach Quantum Engineering10.1002/que2.573:1Online publication date: 22-Dec-2020
https://doi.org/10.1002/que2.57
Sargaran SMohammadzadeh N(2019)SAQIPACM Transactions on Architecture and Code Optimization10.1145/331187916:2(1-21)Online publication date: 18-Apr-2019
https://dl.acm.org/doi/10.1145/3311879
Murali PBaker JJavadi-Abhari AChong FMartonosi MBahar IHerlihy MWitchel ELebeck A(2019)Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum ComputersProceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3297858.3304075(1015-1029)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3297858.3304075
Ghosh MDey NMitra DChakrabarti A(2019)2D Qubit Placement of Quantum Circuits Using LONGPATHAdvanced Computing and Systems for Security10.1007/978-981-13-8969-6_8(127-141)Online publication date: 29-Aug-2019
https://doi.org/10.1007/978-981-13-8969-6_8
Lao LWee BAshraf ISomeren JKhammassi NBertels KAlmudever C(2018)Mapping of lattice surgery-based quantum circuits on surface code architecturesQuantum Science and Technology10.1088/2058-9565/aadd1a4:1(015005)Online publication date: 12-Sep-2018
https://doi.org/10.1088/2058-9565/aadd1a
Paler AFowler AWille R(2017)Online scheduled execution of quantum circuits protected by surface codesQuantum Information & Computation10.5555/3179584.317958917:15-16(1335-1348)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.5555/3179584.3179589
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents