$Q|SI\rangle$: A Quantum Programming Environment

@article{Liu2017QSIrangleAQ,
title={\$Q|SI\rangle\$: A Quantum Programming Environment},
author={Shusen Liu and Xin Wang and Li Zhou and Ji Guan and Yinan Li and Yang He and Runyao Duan and Mingsheng Ying},
journal={arXiv: Quantum Physics},
year={2017}
}
• Shusen Liu, +5 authors M. Ying
• Published 13 October 2017
• Mathematics, Computer Science, Physics
• arXiv: Quantum Physics
This paper describes a quantum programming environment, named $Q|SI\rangle$. It is a platform embedded in the .Net language that supports quantum programming using a quantum extension of the $\mathbf{while}$-language. The framework of the platform includes a compiler of the quantum $\mathbf{while}$-language and a suite of tools for simulating quantum computation, optimizing quantum circuits, and analyzing and verifying quantum programs. Throughout the paper, using $Q|SI\rangle$ to simulate…
7 Citations
eQASM: An Executable Quantum Instruction Set Architecture
• Xiang Fu, +13 authors K. Bertels
• Computer Science, Physics
2019 IEEE International Symposium on High Performance Computer Architecture (HPCA)
• 2019
This paper proposes an executable QISA that can be translated from quantum assembly language (QASM), supports comprehensive quantum program flow control, and is executed on a quantum control microarchitecture, and presents better scalability than QuMIS.
Formal Verification of Quantum Algorithms Using Quantum Hoare Logic
To the best knowledge, this is the first time a Hoare logic for quantum programs is formalized in an interactive theorem prover, and used to verify the correctness of a nontrivial quantum algorithm.
Strawberry Fields: A Software Platform for Photonic Quantum Computing
• Mathematics, Computer Science
Quantum
• 2019
Strawberry Fields, an open-source quantum programming architecture for light-based quantum computers, is introduced, and its key features are detailed.
Implementing termination analysis on quantum programming
• Computer Science
Science China Information Sciences
• 2019
The theoretical theorems on termination analysis proposed by Ying et al. are extended and the new algorithm without the Jordan decomposition process has a significant acceleration with polynomial complexity both on terminating and almost-surely terminating programs.
A Quantum interpretation of separating conjunction for local reasoning of Quantum programs based on separation logic
• Xuan-Bach Le, Shang-Wei Lin, Jun Sun
• Proceedings of the ACM on Programming Languages
• 2022
It is well-known that quantum programs are not only complicated to design but also challenging to verify because the quantum states can have exponential size and require sophisticated mathematics to
Quantum Programming Language: A Systematic Review of Research Topic and Top Cited Languages
• 2019
Quantum programming is an emerging area developed in last 2 decades from the multidisciplinary research on quantum computing. Quantum computing combines the idea of Quantum Mechanics, Mathematics and
QuanFuzz: Fuzz Testing of Quantum Program
This paper presents QuanFuzz, a search-based test input generator for quantum program that defines the quantum sensitive information to evaluate test input forquantum program and uses matrix generator to generate test cases with higher coverage.

References

SHOWING 1-10 OF 32 REFERENCES
LIQUi|>: A Software Design Architecture and Domain-Specific Language for Quantum Computing
• Computer Science, Physics
ArXiv
• 2014
Languages, compilers, and computer-aided design tools will be essential for scalable quantum computing, which promises an exponential leap in our ability to execute complex tasks. LIQUi|> is a
Quipper: a scalable quantum programming language
• Computer Science
PLDI 2013
• 2013
Quipper, a scalable, expressive, functional, higher-order quantum programming language, which is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware.
qHiPSTER: The Quantum High Performance Software Testing Environment
• Physics, Computer Science
ArXiv
• 2016
We present qHiPSTER, the Quantum High Performance Software Testing Environment. qHiPSTER is a distributed high-performance implementation of a quantum simulator on a classical computer, that can
A Brief Survey of Quantum Programming Languages
This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its beginnings in 1982, when Paul
ScaffCC: a framework for compilation and analysis of quantum computing programs
This work presents a scalable compiler for large-scale quantum applications, and highlights the importance of high-level quantum compilation for logical circuit translation, quantitative analysis of algorithms, and optimization of circuit lengths.
Toward an architecture for quantum programming
• Physics, Computer Science
ArXiv
• 2001
A template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives, and easily lends itself to automatic, hardware independent, circuit simplification.
A Theorem Prover for Quantum Hoare Logic and Its Applications
• Mathematics, Computer Science
ArXiv
• 2016
This paper implements a theorem prover for QHL based on Isabelle/HOL, and proves the correctness of two well-known quantum algorithms, i.e., Grover Quantum Search and Quantum Phase Estimation are proved using the theoremProver, the first mechanized proofs for both of them.
A Procedural Formalism for Quantum Computing
QCL (Quantum Computation Language) is a hight level, architecture independent programming language for quantum computers, with a syntax derived from classical procedural languages like C or Pascal, which allows for the complete implementation and simulation of quantum algorithms in one consistent formalism.
Quantum Programming
• Computer Science
MPC
• 2000
The theory of quantum programming provides tools to write both classical and quantum specifications, develop quantum programs that implement these specifications, and reason about their comparative time and space complexity all in the same framework.
Quantum loop programs
• Mathematics, Computer Science
Acta Informatica
• 2010
A general scheme of quantum loops is introduced and a denotational semantics and a weakest precondition semantics of a quantum loop are given, and the notions of termination and almost termination are proposed for quantum loops in the case of finite-dimensional state spaces.