Figure 12 - uploaded by Mohammed J Islam
Content may be subject to copyright.
Source publication
![Figure 6: Circuit for Deutsch algorithm [25]](profile/Mohammed-J-Islam/publication/263238080/figure/fig3/AS:296400656060420@1447678831281/Circuit-for-Deutsch-algorithm-25_Q320.jpg)
![Figure 14: Quantum subroutine for Simon’s algorithm [5]](profile/Mohammed-J-Islam/publication/263238080/figure/fig11/AS:296400660254720@1447678832014/Quantum-subroutine-for-Simons-algorithm-5_Q320.jpg)
![Figure 17: Circuit for Grover’s single iteration ( x 0 = 2) [15] [19]](profile/Mohammed-J-Islam/publication/263238080/figure/fig14/AS:296400660254723@1447678832157/Circuit-for-Grovers-single-iteration-x-0-2-15-19_Q320.jpg)
Quipper is a recently released quantum programming language. In this report,
we explore Quipper's programming framework by implementing the Deutsch's,
Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will
help new quantum programmers in an instructive manner. We choose Quipper
especially for its usability and scalability thou...
Similar publications
![[5] Alice (left) wants to run a private oracular quantum algorithm, but...](publication/353230013/figure/fig1/AS:11431281208770946@1701446242313/5-Alice-left-wants-to-run-a-private-oracular-quantum-algorithm-but-she-has-neither-a_Q320.jpg)
![[5] The ideal BOQC resource S in the absence of an adversary. The left...](publication/353230013/figure/fig4/AS:11431281208770948@1701446242863/5-The-ideal-BOQC-resource-S-in-the-absence-of-an-adversary-The-left-side-is-the_Q320.jpg)
![[5] Ideal resource S′ , the ideal-world resource when Bob is malicious....](publication/353230013/figure/fig5/AS:11431281208873444@1701446242988/5-Ideal-resource-S-the-ideal-world-resource-when-Bob-is-malicious-The-input-and_Q320.jpg)
In the standard oracle model, an oracle efficiently evaluates an unknown classical function independent of the quantum algorithm itself. Quantum algorithms have a complex interrelationship to their oracles; for example the possibility of quantum speedup is affected by the manner by which oracles are implemented. Therefore, it is physically meaningf...
Variational quantum algorithms, which consist of optimal parameterized quantum circuits, are promising for demonstrating quantum advantages in the noisy intermediate-scale quantum (NISQ) era. Apart from classical computational resources, different kinds of quantum resources have their contributions in the process of computing, such as information s...
The role of entanglement is discussed in the Harrow-Hassidim-Lloyd (HHL) algorithm. We compute all tripartite entanglement at every steps of the HHL algorithm. The tripartite entanglement is generated in the first quantum phase estimation (QPE) step. However, it turns out that amount of the generated entanglement is not maximal except very rare cas...
Variational quantum algorithms are promising tools for near-term quantum computers as their shallow circuits are robust to experimental imperfections. Their practical applicability, however, strongly depends on how many times their circuits need to be executed for sufficiently reducing shot-noise. We consider metric-aware quantum algorithms: variat...
Efficient synthesis of arbitrary quantum states and unitaries from a universal fault-tolerant gate-set e.g. Clifford+T is a key subroutine in quantum computation. As large quantum algorithms feature many qubits that encode coherent quantum information but remain idle for parts of the computation, these should be used if it minimizes overall gate co...
Citations
... OpenFermion [30] Q [31] QPanda Shor [32] technology Python (activity) activity( ) [35] ...
... Scalability. Quipper and LIQU i| have both been used to successfully implement many nontrivial quantum algorithms (Siddiqui et al. 2014;Green et al. 2013a;Wecker and Svore 2014), in which the size of quantum circuits can grow into the millions of gates. One approach to scalability, embraced by LIQU i| , involves aggressive optimization and simulation, and is compatible with QWIRE using circuit case analysis. ...
This paper introduces QWIRE (``choir''), a language for defining quantum circuits and an interface for manipulating them inside of an arbitrary classical host language. QWIRE is minimal---it contains only a few primitives---and sound with respect to the physical properties entailed by quantum mechanics. At the same time, QWIRE is expressive and highly modular due to its relationship with the host language, mirroring the QRAM model of computation that places a quantum computer (controlled by circuits) alongside a classical computer (controlled by the host language).
We present QWIRE along with its type system and operational semantics, which we prove is safe and strongly normalizing whenever the host language is. We give circuits a denotational semantics in terms of density matrices. Throughout, we investigate examples that demonstrate the expressive power of QWIRE, including extensions to the host language that (1) expose a general analysis framework for circuits, and (2) provide dependent types.
... Scalability. Quipper and LIQU i| have both been used to successfully implement many nontrivial quantum algorithms (Siddiqui et al. 2014; Green et al. 2013a; Wecker and Svore 2014), in which the size of quantum circuits can grow into the millions of gates. One approach to scalability, embraced by LIQU i|, involves aggressive optimization and simulation, and is compatible with QWIRE using circuit case analysis. ...
This paper introduces QWIRE (``choir''), a language for defining quantum circuits and an interface for manipulating them inside of an arbitrary classical host language. QWIRE is minimal---it contains only a few primitives---and sound with respect to the physical properties entailed by quantum mechanics. At the same time, QWIRE is expressive and highly modular due to its relationship with the host language, mirroring the QRAM model of computation that places a quantum computer (controlled by circuits) alongside a classical computer (controlled by the host language).
We present QWIRE along with its type system and operational semantics, which we prove is safe and strongly normalizing whenever the host language is. We give circuits a denotational semantics in terms of density matrices. Throughout, we investigate examples that demonstrate the expressive power of QWIRE, including extensions to the host language that (1) expose a general analysis framework for circuits, and (2) provide dependent types.
