Thank you for your explanation, Peter. 30 trillion of something is quite a lot! In fact it's not easy to imagine that amount of object would fit in a laptop's memory. http://arxiv.org/pdf/1304.3390v1.pdf Is there some technique involved like succinct data structure, shared data structure or streaming write to disk?
I'm also interested in Quipper's "scalability" in classical sense, i.e. ability to utilize multi-core and/or distributed computation environments. 2013/6/21 Peter Selinger <selin...@mathstat.dal.ca> > Dear Takayuki, > > thanks for your interest! I hope you'll get a chance to play with > Quipper. > > By "scalable", we mean that we have used Quipper to generate circuits > with over 30 trillion gates. So it's not just a toy that works for > small examples. > > Best wishes, -- Peter > > Takayuki Muranushi wrote: > > > > This library excites me! As a physics undergrad I read Nielsen & Chuang > > with my friends, for me quantum computation was best clue of > understanding > > quantum mechanics. Allow me to make a comment, or, a tl;dr question... > > > > Would you elaborate "Quipper is scalable" ? > > > > > > 2013/6/20 Alexander Green <alexander.s.gr...@gmail.com> > > > > > Dear Haskellers, > > > > > > we are proud to announce the first public release of Quipper, an > > > embedded, scalable functional programming language for quantum > > > computing. The Quipper distribution is available here: > > > > > > http://www.mathstat.dal.ca/~selinger/quipper/ > > > > > > and includes extensive documentation, as well as seven worked examples > > > of non-trivial quantum algorithms from the literature. > > > > > > Quipper is embedded in Haskell and makes use of many advanced > > > features of the GHC Glasgow Haskell Compiler. Here are some highlights: > > > > > > * High-level circuit description language, including both gate-by-gate > > > descriptions and powerful higher-order operators for assembling and > > > manipulating circuits. > > > > > > * A monadic semantics, allowing for a mixture of procedural and > > > declarative programming styles. > > > > > > * Built-in facilities for automatic synthesis of reversible quantum > > > circuits, including from classical Haskell code. > > > > > > * Support for hierarchical circuits. > > > > > > * Extensible quantum data types. > > > > > > * Programmable circuit transformers > > > > > > * Support for a dynamic lifting operation to allow circuit generation > > > to depend on parameters generated at circuit execution time. > > > > > > * Extensive libraries of quantum functions, including: libraries for > > > quantum integer and fixed-point arithmetic; the Quantum Fourier > > > transform; an efficient Qram implementation; libraries for > > > simulation of pseudo-classical circuits, Stabilizer circuits, and > > > arbitrary circuits; libraries for exact and approximate > > > decomposition of circuits into specific gate sets. > > > > > > Comments are welcome! > > > > > > Alexander S. Green > > > Peter LeFanu Lumsdaine > > > Neil Julien Ross > > > Peter Selinger > > > Benoit Valiron > > > > > > > > > _______________________________________________ > > > Haskell mailing list > > > Haskell@haskell.org > > > http://www.haskell.org/mailman/listinfo/haskell > > > > > > > > > > > > -- > > Takayuki MURANUSHI > > The Hakubi Center for Advanced Research, Kyoto University > > http://www.hakubi.kyoto-u.ac.jp/02_mem/h22/muranushi.html > -- Takayuki MURANUSHI The Hakubi Center for Advanced Research, Kyoto University http://www.hakubi.kyoto-u.ac.jp/02_mem/h22/muranushi.html
_______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
