Academic literature on the topic 'Quantum Programming Language'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quantum Programming Language.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Quantum Programming Language"

1

XU, Jia-Fu. "Quantum Programming Language NDQJava." Journal of Software 19, no. 1 (2008): 1–8. http://dx.doi.org/10.3724/sp.j.1001null.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

SELINGER, PETER. "Towards a quantum programming language." Mathematical Structures in Computer Science 14, no. 4 (2004): 527–86. http://dx.doi.org/10.1017/s0960129504004256.

Full text
Abstract:
We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators.
APA, Harvard, Vancouver, ISO, and other styles
3

XU, Jia-Fu, Fang-Min SONG, Shi-Jun QIAN, Jing-An DAI, and Yun-Jie ZHANG. "Quantum Programming Language NDQJava &." Journal of Software 19, no. 1 (2008): 1–8. http://dx.doi.org/10.3724/sp.j.1001.2008.00001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

LIU, Ling, and Jia-Fu XU. "Quantum Programming Language NDQJava-2." Journal of Software 22, no. 5 (2011): 877–86. http://dx.doi.org/10.3724/sp.j.1001.2011.03979.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vizzotto, Juliana Kaizer, and Bruno Crestani Calegaro. "QJava: A Monadic Java Library for Quantum Programming." Revista de Informática Teórica e Aplicada 22, no. 1 (2015): 242. http://dx.doi.org/10.22456/2175-2745.51121.

Full text
Abstract:
To help the understanding and development of quantum algorithms there is an effort focused on the investigation of new semantic models and programming languages for quantum computing. Researchers in computer science have the challenge of deve loping programming languages to support the creation, analysis, modeling and simulation of high level quantum algorithms. Based on previous works that use monads inside the programming language Haskell to elegantly explain the odd characteristics of quantum computation (like superposition and entanglement), in this work we present a monadic Java library for quantum programming. We use the extension of the programming language Java called BGGA Closure, that allow the manipulation of anonymous functions (closures) inside Java. We exemplify the use of the library with an implementation of the Toffoli quantum circuit.
APA, Harvard, Vancouver, ISO, and other styles
6

Zorzi, Margherita. "Quantum Calculi—From Theory to Language Design." Applied Sciences 9, no. 24 (2019): 5472. http://dx.doi.org/10.3390/app9245472.

Full text
Abstract:
In the last 20 years, several approaches to quantum programming have been introduced. In this survey, we focus on the QRAM (Quantum Random Access Machine) architectural model. We explore the twofold perspective (theoretical and concrete) of the approach and we list the main problems one has to face in quantum language design. Moreover, we propose an overview of some interesting languages and open-source platforms for quantum programming currently available. We also provide the higher-order encoding in the functional languages qPCF and IQu of the well known Deutsch-Jozsa and Simon’s algorithms.
APA, Harvard, Vancouver, ISO, and other styles
7

MLNAŘÍK, HYNEK. "SEMANTICS OF QUANTUM PROGRAMMING LANGUAGE LANQ." International Journal of Quantum Information 06, supp01 (2008): 733–38. http://dx.doi.org/10.1142/s0219749908004031.

Full text
Abstract:
We show a memory model of an imperative concurrent quantum programming language LanQ. The memory model is used to specify the shape of semantical structure upon which the language operational semantics is defined. We also outline the language abilities in the area of formal verification on an example implementation of teleportation protocol.
APA, Harvard, Vancouver, ISO, and other styles
8

Palsberg, Jens. "Toward a universal quantum programming language." XRDS: Crossroads, The ACM Magazine for Students 26, no. 1 (2019): 14–17. http://dx.doi.org/10.1145/3355759.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ying, Mingsheng, and Yuan Feng. "A Flowchart Language for Quantum Programming." IEEE Transactions on Software Engineering 37, no. 4 (2011): 466–85. http://dx.doi.org/10.1109/tse.2010.94.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Plata-Cesar, Nely, Jose Raymundo Marcial-Romero, and Jose Antonio Hernandez-Servin. "Reversibility for Quantum Programming Language QML." IEEE Latin America Transactions 18, no. 10 (2020): 1692–98. http://dx.doi.org/10.1109/tla.2020.9387639.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Quantum Programming Language"

1

Grattage, Jonathan James. "A functional quantum programming language." Thesis, University of Nottingham, 2006. http://eprints.nottingham.ac.uk/10250/.

Full text
Abstract:
This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive operational semantics of irreversible quantum computations, realisable as quantum circuits. The quantum circuit model is also given a formal categorical definition via the category FQC. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings, which may lead to the collapse of the quantum wavefunction, explicit. Strict programs are free from measurement, and hence preserve superpositions and entanglement. A denotational semantics of QML programs is presented, which maps QML terms into superoperators, via the operational semantics, made precise by the category Q. Extensional equality for QML programs is also presented, via a mapping from FQC morphisms into the category Q.
APA, Harvard, Vancouver, ISO, and other styles
2

Green, Alexander S. "Towards a formally verified functional quantum programming language." Thesis, University of Nottingham, 2010. http://eprints.nottingham.ac.uk/11457/.

Full text
Abstract:
This thesis looks at the development of a framework for a functional quantum programming language. The framework is first developed in Haskell, looking at how a monadic structure can be used to explicitly deal with the side-effects inherent in the measurement of quantum systems, and goes on to look at how a dependently-typed reimplementation in Agda gives us the basis for a formally verified quantum programming language. The two implementations are not in themselves fully developed quantum programming languages, as they are embedded in their respective parent languages, but are a major step towards the development of a full formally verified, functional quantum programming language. Dubbed the “Quantum IO Monad”, this framework is designed following a structural approach as given by a categorical model of quantum computation.
APA, Harvard, Vancouver, ISO, and other styles
3

Valiron, Benoit. "A functional programming language for quantum computation with classical control." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26790.

Full text
Abstract:
The objective of this thesis is to develop a functional programming language for quantum computers based on the QRAM model, following the work of P. Selinger (2004) on quantum flow-charts. We construct a lambda-calculus without side-effects to deal with quantum bits. We equip this calculus with a probabilistic call-by-value operational semantics. Since quantum information cannot be duplicated due to the no-cloning property, we need a resource-sensitive type system. We develop it based on affine intuitionistic linear logic. Unlike the quantum lambda-calculus proposed by Van Tonder (2003, 2004), the resulting lambda-calculus has only one lambda-abstraction, linear and non-linear abstractions being encoded in the type system. We also integrate classical and quantum data types within our language. The main results of this work are the subject-reduction of the language and the construction of a type inference algorithm.
APA, Harvard, Vancouver, ISO, and other styles
4

Brandhorst-Satzkorn, Johan. "A Review of Freely Available Quantum Computer Simulation Software." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-78650.

Full text
Abstract:
A study has been made of a few different freely available Quantum Computer simulators.All the simulators tested are available online on their respective websites. A number oftests have been performed to compare the different simulators against each other. Someuntested simulators of various programming languages are included to show the diversityof the quantum computer simulator applications. The conclusion of the review is that LibQuantum is the best of the simulatorstested because of ease of coding, a great amount of pre-defined functionimplementations and decoherence simulation support among other reasons.
APA, Harvard, Vancouver, ISO, and other styles
5

GOMES, Mouglas Eugênio Nasário. "LinDCQ : uma linguagem para descrição de circuitos quânticos que possibilita o cálculo das operações na GPU utilizando JOCL." Universidade Federal Rural de Pernambuco, 2015. http://www.tede2.ufrpe.br:8080/tede2/handle/tede2/6237.

Full text
Abstract:
Submitted by Mario BC (mario@bc.ufrpe.br) on 2017-02-08T13:00:48Z No. of bitstreams: 1 Mouglas Eugenio Nasario Gomes.pdf: 2441879 bytes, checksum: 71064821936a79cf37326006ed006c46 (MD5)<br>Made available in DSpace on 2017-02-08T13:00:48Z (GMT). No. of bitstreams: 1 Mouglas Eugenio Nasario Gomes.pdf: 2441879 bytes, checksum: 71064821936a79cf37326006ed006c46 (MD5) Previous issue date: 2015-07-27<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES<br>This paper presents the LinDCQ tool — a description language and programming quantum circuits — which enables the creation of quantum circuits with calculus of operations performed in parallel on the GPU, using JOCL. The tool also allows the generation of graphically circuit. Used as a mechanism to generate grammars of languages and automata as language recognizer and the regular expression engine. In this context a discussion of the phases of compilers and on quantum computation is presented as well as an explanation of the main technologies used for the development of quantum circuits. LinDCQ The tool consists of: grammar in BNF form (Backus-Naur-Form), the compiler verifies that the incidence of errors in the code to be executed, a graphical interface to facilitate the programming features that allow the construction of the circuit graphically and parallel algorithms JOCL to perform operations that require greater computational cost in the GPU. At the end of an experiment is performed in order to assess the usability of the tool, to thereby ensure a higher level of user acceptance, facilitating interaction thereof with the tool developed in this work.<br>Este trabalho apresenta a ferramenta LinDCQ - uma linguagem de descrição e programação de circuitos quânticos — a qual possibilita a criação de circuitos quânticos com cálculo das operações realizados de forma paralela na GPU, utilizando JOCL. A ferramenta também permite a geração do circuito de forma gráfica. Utiliza gramáticas como mecanismo na geração de linguagens e autômatos como mecanismo reconhecedor de linguagens e de expressões regulares. Nesse contexto é apresentada uma discussão sobre as fases dos compiladores e sobre a computação quântica, assim como uma explanação sobre as principais tecnologias utilizadas para o desenvolvimento de circuitos quânticos. A ferramenta LinDCQ é composta de: gramática no formato BNF (Backus-Naur-Form), compilador que verifica a incidência de erros no código a ser executado, de uma interface gráfica com características facilitadoras à programação que permite a construção do circuito de forma gráfica e de algoritmos paralelos em JOCL para executar as operações que requerem maior custo computacional na GPU. Ao final é realizado um experimento com o intuito de aferir a usabilidade da ferramenta, para, deste modo, garantir um maior um nível de aceitação do usuário, facilitando a interação do mesmo com a ferramenta desenvolvida nesta dissertação.
APA, Harvard, Vancouver, ISO, and other styles
6

Atzemoglou, George Philip. "Higher-order semantics for quantum programming languages with classical control." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:9fdc4a26-cce3-48ed-bbab-d54c4917688f.

Full text
Abstract:
This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known problems in quantum computation: Quantum Key Distribution, the quantum Fourier transform, and the teleportation protocol.
APA, Harvard, Vancouver, ISO, and other styles
7

Colledan, Andrea. "Abstract Machine Semantics for Quipper." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/22835/.

Full text
Abstract:
Quipper is a domain-specific programming language for the description of quantum circuits. Because it is implemented as an embedded language in Haskell, Quipper is a very practical functional language. However, for the same reason, it lacks a formal semantics and it is limited by Haskell's type-system. In particular, because Haskell lacks linear types, it is easy to write Quipper programs that violate the non-cloning property of quantum states. In order to formalize relevant fragments of Quipper in a type-safe way, the Proto-Quipper family of research languages has been introduced over the last years. In this thesis we first introduce Quipper and Proto-Quipper-M. Proto-Quipper-M is an instance of the Proto-Quipper family based on a categorical model for quantum circuits, which features a linear type-system that guarantees that the non-cloning property holds at compile time. We then derive a tentative small-step operational semantics from the big-step semantics of Proto-Quipper-M and we prove that the two are equivalent. After proving subject reduction and progress results for the tentative semantics, we build upon it to obtain a truly small-step semantics in the style of an abstract machine, which we eventually prove to be equivalent to the original semantics.
APA, Harvard, Vancouver, ISO, and other styles
8

Vizzotto, Juliana Kaizer. "Structuring general and complete quantum computations in Haskell : the arrows approach." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2006. http://hdl.handle.net/10183/13154.

Full text
Abstract:
Computaçãao quântica pode ser entendida como transformação da informação codificada no estado de um sistema físico quântico. A idéia básica da computação quântica é codificar dados utilizando bits quânticos (qubits). Diferentemente do bit clássico, o qubit pode existir em uma superposição dos seus estados básicos permitindo o “paralelismo quântico”, o qual é uma característica importante da computação quântica visto que pode aumentar consideravelmente a velocidade de processamento dos algoritmos. Entretanto, tipos de dados quânticos são bastante poderosos não somente por causa da superposição de estados. Existem outras propriedades ímpares como medida e emaranhamento. Nesta tese, nós discutimos que um modelo realístico para computações quânticas deve ser geral com respeito a medidas, e completo com respeito a comunicação entre o mundo quântico e o mundo clássico. Nós, então, explicamos e estruturamos computações quânticas gerais e completas em Haskell utilizando construções conhecidas da área de semântica e linguagens de programação clássicas, como mônadas e setas. Em mais detalhes, esta tese se concentra nas seguintes contribuições. Mônadas e Setas. Paralelismo quântico, emaranhamento e medida quântica certamente vão além do escopo de linguagens funcionais “puras”. Nós mostramos que o paralelismo quântico pode ser modelado utilizando-se uma pequena generalização de mônadas, chamada mônadas indexadas ou estruturas Kleisli. Além disso, nós mostramos que a medida quântica pode ser explicada utilizando-se uma generalização mais radical de mônadas, as assim chamadas setas, mais especificamente, setas indexadas, as quais definimos nesta tese. Este resultado conecta características quânticas “genéricas” e “completas” `a construções semânticas de linguagens de programação bem fundamentadas. Entendendo as Interpretações da Mecânica Quântica como Efeitos Computacionais. Em um experimento hipotético, Einstein, Podolsky e Rosen demonstraram algumas consequências contra-intuitivas da mecânica quântica. A idéia básica é que duas partículas parecem sempre comunicar alguma informação mesmo estando separadas por uma distância arbitrariamente grande. Existe muito debate e muitos artigos sobre esse tópico, mas é interessante notar que, como proposto por Amr Sabry, essas características estranhas podem ser essencialmente modeladas por atribuições a variáveis globais. Baseados nesta idéia nós modelamos este comportamento estranho utilizando noções gerais de efeitos computacionais incorporados nas noções de mônadas e setas. Provando Propriedades de Programas Quânticos Utilizando Leis Algébricas. Nós desenvolvemos um trabalho preliminar para fazer provas equacionais sobre algoritmos quânticos escritos em uma sublinguagem pura de uma linguagem de programação funcional quântica, chamada QML.<br>Quantum computation can be understood as transformation of information encoded in the state of a quantum physical system. The basic idea behind quantum computation is to encode data using quantum bits (qubits). Differently from the classical bit, the qubit can be in a superposition of basic states leading to “quantum parallelism”, which is an important characteristic of quantum computation since it can greatly increase the speed processing of algorithms. However, quantum data types are computationally very powerful not only due to superposition. There are other odd properties like measurement and entangled. In this thesis we argue that a realistic model for quantum computations should be general with respect to measurements, and complete with respect to the information flow between the quantum and classical worlds. We thus explain and structure general and complete quantum programming in Haskell using well known constructions from classical semantics and programming languages, like monads and arrows. In more detail, this thesis focuses on the following contributions. Monads and Arrows. Quantum parallelism, entanglement, and measurement certainly go beyond “pure” functional programming. We have shown that quantum parallelism can be modelled using a slightly generalisation of monads called indexed monads, or Kleisli structures. We have also build on this insight and showed that quantum measurement can be explained using a more radical generalisation of monads, the so-called arrows, more specifically, indexed arrows, which we define in this thesis. This result connects “generic” and “complete” quantum features to well-founded semantics constructions and programming languages. Understanding of Interpretations of QuantumMechanics as Computational Effects. In a thought experiment, Einsten, Podolsky, and Rosen demonstrate some counter-intuitive consequences of quantum mechanics. The basic idea is that two entangled particles appear to always communicate some information even when they are separated by arbitrarily large distances. There has been endless debate and papers on this topic, but it is interesting that, as proposed by Amr Sabry, this strangeness can be essentially modelled by assignments to global variables. We build on that, and model this strangeness using the general notions of computational effects embodied in monads and arrows. Reasoning about Quantum Programs Using Algebraic Laws. We have developed a preliminary work to do equational reasoning about quantum algorithms written in a pure sublanguage of a functional quantum programming language, called QML.
APA, Harvard, Vancouver, ISO, and other styles
9

Hjern, Gunnar. "The modernization of a DOS-basedtime critical solar cell LBICmeasurement system." Thesis, Karlstads universitet, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-74322.

Full text
Abstract:
LBIC is a technique for scanning the local quantum efficiency of solar cells. This kind of measurements needs a highly specialized, and time critical controlling software. In 1996 the client, professor Markus Rinio, constructed an LBIC system, and wrote the controlling software as a Turbo-Pascal 7.0 application, running under the MS-DOS 6.22 operating system. By now (2018) both the software and several hardware components are in dire need to be modernized. This thesis thoroughly describes several important aspects of this work, and the considerations needed for a successful result. This includes both very foundational choices about the software architecture, the choice of suitable operating system, the threading model, and the adaptation to new hardware with vastly different behavior. The project also included a new hardware module for position reports and instrument triggering, as well as several adaptations to transform the DOS-based LBIC software into a pleasant modern GUI application.
APA, Harvard, Vancouver, ISO, and other styles
10

Valiron, Benoît. "Semantics for a Higher Order Functional Programming Language for Quantum Computation." Phd thesis, 2008. http://tel.archives-ouvertes.fr/tel-00483944.

Full text
Abstract:
L'objectif de cette thèse est de développer une sémantique d'ordre supérieur pour l'information quantique. S'appuyant sur les travaux de master (M.Sc.) de l'auteur, nous étudions un lambda-calcul pour le calcul quantique avec contrôle classique. Le langage comporte deux aspects. Le premier, émanant du théorème dit de « no-cloning » de l'information quantique, est le besoin de distinguer entre les données duplicables et celles non-duplicables. Pour tenir compte de la duplicabilité à l'ordre supérieur, nous utilisons un système de types inspiré par la logique linéaire, logique sensible à la notion de ressource. Le deuxième aspect important est l'effet de bord probabiliste émanant de la mesure, seule opération permettant de récupérer une information classique à partir de données quantiques. Cet effet de bord nous oblige à choisir une stratégie de réduction pour pouvoir être en mesure de définir une sémantique opérationnelle. Nous résolvons le problème de la sémantique dénotationnelle de deux façons. D'abord, en restreignant l'étude du langage au fragment strictement linéaire. Ce faisant, on supprime le besoin de distinguer entre structure duplicable et structure non-duplicable. Il est alors possible de se concentrer sur la description des caractéristiques du calcul quantique. En utilisant la catégorie des fonctions strictement positives (CPM), nous construisons un modèle dénotationnel « fully-abstract », c'est-à-dire caractérisant exactement l'équivalence opérationnelle du fragment strictement linéaire. L'étude du langage au complet est plus compliquée. Pour tenir compte de l'aspect probabiliste du langage, nous utilisons une méthode développée par Moggi et construisons un modèle distinguant la notion de résultat, ou valeur, de la notion de calcul (« computational model »). Pour traiter la distinction entre donnée duplicable et donnée non-duplicable, nous adaptons la notion de catégorie linéaire développée par Bierman, où la notion de duplication est interprétée comme une comonade avec des propriétés particulières. Le modèle issu de ce travail est ce que nous avons appelé une catégorie linéaire pour la duplication. Dans un dernier temps, le langage est restreint en ne considérant que la notion d'effet de bord et la distinction éléments duplicables – éléments non-duplicables pour obtenir un lambda-calcul linéaire générique. Dans ce contexte, nous montrons que la notion de catégorie linéaire de duplication est une interprétation « full and complete » pour le langage.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Quantum Programming Language"

1

Semantic techniques in quantum computation. Cambridge University Press, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Coecke, Bob. Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky: Essays Dedicated to Samson Abramsky on the Occasion of His 60th Birthday. Springer Berlin Heidelberg, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Davis, Martin. From Linear Operators to Computational Biology: Essays in Memory of Jacob T. Schwartz. Springer London, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Silva, Vladimir. Practical Quantum Computing for Developers: Programming Quantum Rigs in the Cloud using Python, Quantum Assembly Language and IBM QExperience. Apress / KP, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Silva, Vladimir. Practical Quantum Computing for Developers: Programming Quantum Rigs in the Cloud using Python, Quantum Assembly Language and IBM QExperience. Apress, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Practical Statecharts in C/C++: Quantum Programming for Embedded Systems with CDROM. CMP Books, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Semantic techniques in quantum computation. Cambridge University Press, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Davis, Martin, and Edmond Schonberg. From Linear Operators to Computational Biology. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Quantum Programming Language"

1

Péchoux, Romain, Simon Perdrix, Mathys Rennela, and Vladimir Zamdzhiev. "Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_29.

Full text
Abstract:
AbstractInductive datatypes in programming languages allow users to define useful data structures such as natural numbers, lists, trees, and others. In this paper we show how inductive datatypes may be added to the quantum programming language QPL. We construct a sound categorical model for the language and by doing so we provide the first detailed semantic treatment of user-defined inductive datatypes in quantum programming. We also show our denotational interpretation is invariant with respect to big-step reduction, thereby establishing another novel result for quantum programming. Compared to classical programming, this property is considerably more difficult to prove and we demonstrate its usefulness by showing how it immediately implies computational adequacy at all types. To further cement our results, our semantics is entirely based on a physically natural model of von Neumann algebras, which are mathematical structures used by physicists to study quantum mechanics.
APA, Harvard, Vancouver, ISO, and other styles
2

Vizzotto, Juliana Kaizer, André Rauber Du Bois, and Amr Sabry. "The Arrow Calculus as a Quantum Programming Language." In Logic, Language, Information and Computation. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02261-6_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bornat, Richard, Jaap Boender, Florian Kammueller, Guillaume Poly, and Rajagopal Nagarajan. "Describing and Simulating Concurrent Quantum Systems." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45237-7_16.

Full text
Abstract:
Abstract We present a programming language for describing and analysing concurrent quantum systems. We have an interpreter for programs in the language, using a symbolic rather than a numeric calculator, and we give its performance on examples from quantum communication and cryptography.
APA, Harvard, Vancouver, ISO, and other styles
4

Chareton, Christophe, Sébastien Bardin, François Bobot, Valentin Perrelle, and Benoît Valiron. "An Automated Deductive Verification Framework for Circuit-building Quantum Programs." In Programming Languages and Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_6.

Full text
Abstract:
AbstractWhile recent progress in quantum hardware open the door for significant speedup in certain key areas, quantum algorithms are still hard to implement right, and the validation of such quantum programs is a challenge. In this paper we propose Qbricks, a formal verification environment for circuit-building quantum programs, featuring both parametric specifications and a high degree of proof automation. We propose a logical framework based on first-order logic, and develop the main tool we rely upon for achieving the automation of proofs of quantum specification: PPS, a parametric extension of the recently developed path sum semantics. To back-up our claims, we implement and verify parametric versions of several famous and non-trivial quantum algorithms, including the quantum parts of Shor’s integer factoring, quantum phase estimation (QPE) and Grover’s search.
APA, Harvard, Vancouver, ISO, and other styles
5

Brassard, Gilles, Peter HØyer, and Alain Tapp. "Quantum counting." In Automata, Languages and Programming. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vizzotto, Juliana Kaizer, Bruno Crestani Calegaro, and Eduardo Kessler Piveta. "A Double Effect λ-calculus for Quantum Computation." In Programming Languages. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40922-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

da Silva Feitosa, Samuel, Juliana Kaizer Vizzotto, Eduardo Kessler Piveta, and Andre Rauber Du Bois. "A Monadic Semantics for Quantum Computing in Featherweight Java." In Programming Languages. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45279-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kawachi, Akinori, and Tomoyuki Yamakami. "Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11787006_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jeandel, Emmanuel. "Universality in Quantum Computation." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27836-8_67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kimmel, Shelby. "Quantum Adversary (Upper) Bound." In Automata, Languages, and Programming. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31594-7_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Quantum Programming Language"

1

Paykin, Jennifer, Robert Rand, and Steve Zdancewic. "QWIRE: a core language for quantum circuits." In POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages. ACM, 2017. http://dx.doi.org/10.1145/3009837.3009894.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yu, Nengkun, and Jens Palsberg. "Quantum abstract interpretation." In PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. ACM, 2021. http://dx.doi.org/10.1145/3453483.3454061.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhu, Shaopeng, Shih-Han Hung, Shouvanik Chakrabarti, and Xiaodi Wu. "On the principles of differentiable quantum programming languages." In PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation. ACM, 2020. http://dx.doi.org/10.1145/3385412.3386011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhou, Li, Nengkun Yu, and Mingsheng Ying. "An applied quantum Hoare logic." In PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, 2019. http://dx.doi.org/10.1145/3314221.3314584.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Paradis, Anouk, Benjamin Bichsel, Samuel Steffen, and Martin Vechev. "Unqomp: synthesizing uncomputation in Quantum circuits." In PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. ACM, 2021. http://dx.doi.org/10.1145/3453483.3454040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tao, Runzhou, Yunong Shi, Jianan Yao, John Hui, Frederic T. Chong, and Ronghui Gu. "Gleipnir: toward practical error analysis for Quantum programs." In PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. ACM, 2021. http://dx.doi.org/10.1145/3453483.3454029.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bichsel, Benjamin, Maximilian Baader, Timon Gehr, and Martin Vechev. "Silq: a high-level quantum language with safe uncomputation and intuitive semantics." In PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation. ACM, 2020. http://dx.doi.org/10.1145/3385412.3386007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liu, Ji, Gregory T. Byrd, and Huiyang Zhou. "Quantum Circuits for Dynamic Runtime Assertions in Quantum Computation." In ASPLOS '20: Architectural Support for Programming Languages and Operating Systems. ACM, 2020. http://dx.doi.org/10.1145/3373376.3378488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kotra, Jagadish. "Session details: Quantum Computing." In ASPLOS '19: Architectural Support for Programming Languages and Operating Systems. ACM, 2019. http://dx.doi.org/10.1145/3324117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Staton, Sam. "Algebraic Effects, Linearity, and Quantum Programming Languages." In POPL '15: The 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, 2015. http://dx.doi.org/10.1145/2676726.2676999.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!