Skip to content

Austin Fowler's quantum compiler using skip-ahead optimizations with Jeffrey Booth's meet-in-the-middle optimization.

License

Notifications You must be signed in to change notification settings

learner-long-life/fowler-compiler

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This code is released under a 3-clause BSD license, found in the file LICENSE.
By downloading, modifying, and/or distributing this code in either source or binary form,
you agree to be bound by this license.

Source code for a quantum compiler which enumerates over the Clifford group and T (pi/8) gate with skip-ahead
optimizations to produce approximate gate sequences of optimal length.

(c) Austin Fowler 2004-2012.

This work is described in more detail in the following paper:
http://arxiv.org/abs/quant-ph/0411206

Please cite this paper and Austin Fowler for the original code (in the master branch).
You can email Austin for support at austingfowler at gmail.

The branch 'jeff" was added by Jeffrey Booth to add meet-in-the-middle optimizations.

(c) Jeffrey Booth 2012

This work is described in more detail in the following paper:
http://arxiv.org/abs/1206.3348

Please cite this paper and Jeffrey Booth for the meet-in-the-middle optimizations.

About

Austin Fowler's quantum compiler using skip-ahead optimizations with Jeffrey Booth's meet-in-the-middle optimization.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published