Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2597917.2597939acmconferencesArticle/Chapter ViewAbstractPublication PagescfConference Proceedingsconference-collections
research-article

ScaffCC: a framework for compilation and analysis of quantum computing programs

Published: 20 May 2014 Publication History

Abstract

Quantum computing is a promising technology for high-performance computation, but requires mature toolflows that can map large-scale quantum programs onto targeted hardware. In this paper, we present a scalable compiler for large-scale quantum applications, and show the opportunities for reducing compilation and analysis time, as well as output code size. We discuss the similarities and differences between compiling for a quantum computer as opposed to a classical computer, and present a state-of-the-art approach for compilation of classical circuits into quantum circuits. Our work also highlights the importance of high-level quantum compilation for logical circuit translation, quantitative analysis of algorithms, and optimization of circuit lengths.

References

[1]
T. Altenkirch and A. S. Green. The Quantum IO Monad. Semantic Techniques in Quantum Computation, Cambridge University Press, pages 173--205, 2010.
[2]
A. Ambainis et al. Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+O(1) on a Quantum Computer. SIAM Journal on Computing, 39(6):2513--2530, 2010.
[3]
A. M. Childs et al. Exponential Algorithmic Speedup by a Quantum Walk. In Symposium on Theory of Computing. ACM, 2003.
[4]
S. A. Cuccaro et al. A New Quantum Ripple-Carry Addition Circuit. arXiv preprint quant-ph/0410184, 2004.
[5]
M. Elhoushi et al. Modeling a Quantum Processor Using the QRAM Model. In Pacific Rim Conference on Communications, Computers and Signal Processing, pages 409--415. IEEE, 2011.
[6]
A. S. Green et al. Quipper: A Scalable Quantum Programming Language. In Programming Language Design and Implementation. ACM, 2013.
[7]
L. K. Grover. A Fast Quantum Mechanical Algorithm for Database Search. In Symposium on Theory of Computing. ACM, 1996.
[8]
S. Hallgren. Fast Quantum Algorithms for Computing the Unit Group and Class Group of a Number Field. In Symposium on Theory of Computing. ACM, 2005.
[9]
A. JavadiAbhari et al. Scaffold: Quantum Programming Language. Technical report, Princeton University, NJ, USA, 2012.
[10]
R. Jozsa and N. Linden. On the Role of Entanglement in Quantum-Computational Speed-Up. Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences. Soc. London. A, 459(2036):2011--2032, 2003.
[11]
D. Kudrow et al. Quantum Rotations: A Case Study in Static and Dynamic Machine-Code Generation for Quantum Computers. In International Symposium on Computer Architecture. ACM, 2013.
[12]
C. Lattner and V. Adve. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In Code Generation and Optimization, 2004.
[13]
F. Magniez, M. Santha, and M. Szegedy. Quantum Algorithms for the Triangle Problem. SIAM Journal on Computing, 37(2):413--424, 2007.
[14]
T. S. Metodi and S. D. Gasster. Design and Implementation of a Quantum Compiler. In SPIE Defense, Security, and Sensing. International Society for Optics and Photonics, 2010.
[15]
M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2010.
[16]
B. Ömer. A Procedural Formalism for Quantum Computing. Master's thesis, Technical University of Vienna, 1998.
[17]
M. Oskin et al. A Practical Architecture for Reliable Quantum Computers. IEEE Computer, 35(1):79--87, 2002.
[18]
S. Perdrix. Quantum Entanglement Analysis Based on Abstract Interpretation. In Static Analysis, pages 270--282. Springer, 2008.
[19]
F. Prost and C. Zerrari. Reasoning about Entanglement and Separability in Quantum Higher-Order Functions. In Unconventional Computation, pages 219--235. Springer, 2009.
[20]
QASM circuit viewer: http://www.media.mit.edu/quanta/qasm2circ/, March 2014.
[21]
E. Schuchman and T. N. Vijaykumar. A Program Transformation and Architecture Support for Quantum Uncomputation. In Architectural Support for Programming Languages and Operating Systems. ACM, 2006.
[22]
P. W. Shor. Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In Foundations of Computer Science. IEEE, 1994.
[23]
K. Svore et al. A Layered Software Architecture for Quantum Computing Design Tools. IEEE Computer, 39(1):74--83, 2006.
[24]
J. D. Whitfield et al. Simulation of Electronic Structure Hamiltonians Using Quantum Computers. Molecular Physics, 109(5):735, 2010.
[25]
R. Wille et al. Revlib: An Online Resource for Reversible Functions and Reversible Circuits. In International Symposium on Multiple Valued Logic. IEEE, 2008.

Cited By

View all
  • (2024)Abstracting EntanglementProceedings of the 10th ACM SIGPLAN International Workshop on Numerical and Symbolic Abstract Domains10.1145/3689609.3689998(34-41)Online publication date: 17-Oct-2024
  • (2024)Analyzing Quantum Programs with LintQ: A Static Analysis Framework for QiskitProceedings of the ACM on Software Engineering10.1145/36608021:FSE(2144-2166)Online publication date: 12-Jul-2024
  • (2024)The T-Complexity Costs of Error Correction for Control Flow in Quantum ComputationProceedings of the ACM on Programming Languages10.1145/36563978:PLDI(492-517)Online publication date: 20-Jun-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CF '14: Proceedings of the 11th ACM Conference on Computing Frontiers
May 2014
305 pages
ISBN:9781450328708
DOI:10.1145/2597917
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 the author(s) 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: 20 May 2014

Permissions

Request permissions for this article.

Check for updates

Badges

  • Best Demo

Author Tags

  1. compilers
  2. quantum computation
  3. reversible logic

Qualifiers

  • Research-article

Conference

CF'14
Sponsor:
CF'14: Computing Frontiers Conference
May 20 - 22, 2014
Cagliari, Italy

Acceptance Rates

CF '14 Paper Acceptance Rate 28 of 62 submissions, 45%;
Overall Acceptance Rate 273 of 785 submissions, 35%

Upcoming Conference

CF '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)92
  • Downloads (Last 6 weeks)6
Reflects downloads up to 10 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Abstracting EntanglementProceedings of the 10th ACM SIGPLAN International Workshop on Numerical and Symbolic Abstract Domains10.1145/3689609.3689998(34-41)Online publication date: 17-Oct-2024
  • (2024)Analyzing Quantum Programs with LintQ: A Static Analysis Framework for QiskitProceedings of the ACM on Software Engineering10.1145/36608021:FSE(2144-2166)Online publication date: 12-Jul-2024
  • (2024)The T-Complexity Costs of Error Correction for Control Flow in Quantum ComputationProceedings of the ACM on Programming Languages10.1145/36563978:PLDI(492-517)Online publication date: 20-Jun-2024
  • (2024)Quantivine: A Visualization Approach for Large-Scale Quantum Circuit Representation and AnalysisIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.332714830:1(573-583)Online publication date: 1-Jan-2024
  • (2024)BeSnake: A Routing Algorithm for Scalable Spin-Qubit ArchitecturesIEEE Transactions on Quantum Engineering10.1109/TQE.2024.34294515(1-22)Online publication date: 2024
  • (2024)Ecmas: Efficient Circuit Mapping and Scheduling for Surface Code2024 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO57630.2024.10444874(158-169)Online publication date: 2-Mar-2024
  • (2024)Quantum Computing: From Weakest Preconditions to Voltage PulsesPrinciples of Verification: Cycling the Probabilistic Landscape10.1007/978-3-031-75783-9_9(201-229)Online publication date: 13-Nov-2024
  • (2023)QuCT: A Framework for Analyzing Quantum Circuit by Extracting Contextual and Topological FeaturesProceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture10.1145/3613424.3614274(494-508)Online publication date: 28-Oct-2023
  • (2023)QIsim: Architecting 10+K Qubit QC Interfaces Toward Quantum SupremacyProceedings of the 50th Annual International Symposium on Computer Architecture10.1145/3579371.3589036(1-16)Online publication date: 17-Jun-2023
  • (2023)QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and SimulationACM Transactions on Quantum Computing10.1145/35504884:2(1-26)Online publication date: 24-Feb-2023
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media