quipper-tools: Miscellaneous stand-alone tools for Quipper

[ bsd3, library, program, quipper ] [ Propose Tags ]

This package provides some stand-alone tools for Quipper, with demos for how to write more such tools.

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS]
Change log ChangeLog
Dependencies base (>=4.5 && <5), containers (>=, fixedprec (>=, mtl (>=2.1.2), newsynth (>=, quipper-language, quipper-libraries, quipper-utils, random (>= [details]
License BSD-3-Clause
Copyright Copyright (c) 2011-2019. All rights reserved.
Author Alexander S. Green, Peter LeFanu Lumsdaine, Won Ng, Neil J. Ross, Peter Selinger, Benoit Valiron
Maintainer selinger@mathstat.dal.ca
Category Quipper
Home page http://www.mathstat.dal.ca/~selinger/quipper/
Uploaded by PeterSelinger at 2019-12-30T05:33:21Z
Reverse Dependencies 1 direct, 2 indirect [details]
Executables quipper-qclparser, quipper-unbox, quipper-trimcontrols, quipper-strict, quipper-standard, quipper-simulate, quipper-preview, quipper-pdf, quipper-gatecount, quipper-exact, quipper-eps, quipper-depth, quipper-cliffordt, quipper-binary, quipper-ascii, quipper-approximate
Downloads 794 total (25 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2019-12-30 [all 2 reports]

Readme for quipper-tools-

[back to package description]
Using the Quipper tools

The quipper-tools package contains a number of stand-alone Quipper
programs, most of which read a circuit in the Quipper ASCII format on
standard input. These tools are intended as examples; they illustrate
how other such tools can be written. Each tool also has a --help
option to display usage information.

Graphical viewing of circuits:

* quipper-eps: convert a circuit from ASCII to EPS format.

* quipper-pdf: convert a circuit from ASCII to PDF format.

* quipper-preview: read a circuit and launch the previewer.

Decomposing circuits into different gate sets:

* quipper-approximate: decompose rotation and phase gates into the
  Clifford+T base, using the approximate synthesis algorithm of 

* quipper-binary: decompose a circuit into binary gates.

* quipper-cliffordt: decompose a circuit into the Clifford+T base,
  using both exact and approximate synthesis.

* quipper-exact: decompose all gates that permit exact Clifford+T
  representations into the following gates: controlled-not (with
  positive or negative control), and single-qubit Clifford gate, T,
  and T⁻¹.  Classical controls and classical gates are not subject to
  the gate base, and are left untouched.

* quipper-standard: decompose a circuit into the "standard" gates {X,
  Y, Z, H, S, S⁻¹, T, T⁻¹, CNOT}, using exact and approximate

* quipper-strict: decompose a circuit into the gates {H, S, T, CNOT},
  using exact and approximate synthesis.

* quipper-trimcontrols: trim excess controls from gates, so that the
  gates {NOT, X, Y, Z, iX} have at most two controls, phase gates have
  no controls, and all other gates have at most one control.

* quipper-unbox: unwind a circuit by inlining all top-level boxed
  subroutines. This can substantially increase the size of the circuit

Resource analysis:

* quipper-depth: read a circuit and output its depth.

* quipper-gatecount: read a circuit and output gate counts.


* quipper-simulate: read a circuit and simulate it by applying it to
  every posssible basis vector. This is not efficient and only works
  for very small circuits. Any measurements in the circuit will be
  simulated probabilistically.


* quipper-ascii: the identity function on circuits: read a circuit on
  standard output and then output the same circuit to standard
  output. Illustrates how to parse and output the Quipper ASCII
  circuit format.

* quipper-qclparser: read an execution trace produced by Ömer's QCL,
  and turn it into a Quipper circuit.