检索结果-内蒙古大学图书馆

22nd Asian Symposium on programming Languages and Systems

作者： Inoue, Jun Natl Inst Adv Ind Sci & Technol 1-8-31 Midorigaoka Ikeda Osaka Japan

ISBN: (纸本)9789819789429;9789819789436

We propose a quantum programming paradigm where all data are familiar classical data, and the only non-classical element is a random number generator that can return results with negative probability. Currently, the vast majority of quantum programming languages instead work with quantum data types made up of qubits. The description of their behavior relies on heavy linear algebra and many interdependent concepts and intuitions from quantum physics, which takes dedicated study to understand. We demonstrate that the proposed view of quantum programming explains its central concepts and constraints in more accessible, computationally relevant terms. This is achieved by systematically reducing everything to the existence of that negative-probability random generator, avoiding mention of advanced physics. This makes quantum programming more accessible to programmers without a deep background in physics or linear algebra. The bulk of this paper is written with such an audience in mind. As a working vehicle, we lay out a simple quantum programming language under this paradigm, showing that not only can it express all quantum algorithms, it also naturally captures the semantics of measurement without ever mentioning qubits or collapse.

关键词： quantum programming Probabilistic programming programming model

来源：评论

学校读者我要写书评

暂无评论

Creating a quantum programming Course from Scratch A Computer Science Professor's Journey 2025

Creating a Quantum Programming Course from Scratch A Compute...

引用

56th Technical Symposium on Computer Science Education

作者： Guerin, Joshua T. Univ Northern Colorado Greeley CO 80639 USA

ISBN: (纸本)9798400705328

quantum Computing is generating significant excitement within the interdisciplinary academic community, government, and industry. Despite rapid growth in the area, formal education in non-classical computing is limited or absent in many computer science programs. Among the contributing factors is the cutting-edge nature of the field and, until somewhat recently, lack of available platforms for development. Consequently, many computer science graduates will enter the field with little or no background, or even conversational fluency in basic quantum principles. In the near term this will hinder broader adoption of quantum technologies, and will leave interested students underprepared for possible careers in the area or continued studies in graduate school. This experience report details the creation of a new course in quantum programming at a mid-sized, regional comprehensive university from initial conception to deployment. This work differs from previous treatments, as the professor came into the project without any background in quantum computing or physics. The course was written from a software-development perspective and is intended for a post-secondary audience from interdisciplinary, technical backgrounds. The course was successfully deployed in the fall semester of 2022 with positive reactions by both students and the professor. The author hopes that this project will add to the growing body of literature in this area, and serve as a template for other educators.

关键词： quantum computing quantum programming experience report curriculum instruction pedagogy

来源：评论

学校读者我要写书评

暂无评论

quantum programming With Mixed States

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年 170卷 185-199页

作者： Zuliani, Paolo Princeton Univ Dept Comp Sci Princeton NJ 08544 USA

In this paper we offer a programming approach to quantum computation using mixed states. Mixed-state quantum systems generalise standard (pure) quantum systems by allowing the state of the system to be a probabilistic distribution of pure states. We build on previous work by Aharonov et al. and generalise their results from quantum circuits to probabilistic (and quantum) programs.

关键词： quantum programming mixed state probabilistic computation quantum circuit

来源：评论

学校读者我要写书评

暂无评论

quantum programming with Inductive Datatypes: Causality and Affine Type Theory 23rd

Quantum Programming with Inductive Datatypes: Causality and ...

引用

23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS)

作者： Pechoux, Romain Perdrix, Simon Rennela, Mathys Zamdzhiev, Vladimir Univ Lorraine CNRS INRIA LORIA F-54000 Nancy France Leiden Univ Leiden Netherlands

ISBN: (纸本)9783030452315;9783030452308

Inductive 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.

关键词： quantum programming Inductive types Adequacy

来源：评论

学校读者我要写书评

暂无评论

quantum programming: a review 14

Quantum programming: a review

引用

14th IEEE International Scientific Conference on Informatics

作者： Spisiak, Milan Kollar, Jan Tech Univ Kosice Fac Elect Engn & Informat Dept Comp & Informat Letna 9 Kosice 04200 Slovakia

ISBN: (纸本)9781538608890

In this paper, we discuss an actual state of the quantum programming. At present, we don't how know to solve some algorithmic problems, mainly the processing of complex information, using the current computer architecture in real time. The quantum approaches promise new opportunities in the processing of complex information. This paper is divided to three parts. The first part of paper is focused on the theoretical basis of quantum computer. The second part presents current state in this area. The third part shows experiments on a quantum computer. The experiments are performed on IBM Q platform.

关键词： quantum programming IBM ibmqx2

来源：评论

学校读者我要写书评

暂无评论

Implementing termination analysis on quantum programming

引用

Science China(Information Sciences) 2019年第12期62卷 215-222页

作者： Shusen LIU Kan HE Runyao DUAN School of Data and Computer Science Sun Yat-sen University Institute for Quantum Computing Baidu Beijing Institute for Advanced Study Tsinghua University College of Mathematics & College of Information and Computer Science Taiyuan University of Technology

Termination analysis is an essential part in programming. Especially quantum programming concerning measurement, entanglement and even superposition are the foundations of bizarre behaviours in quantum programs. In this paper, we analyse and extend the theoretical theorems on termination analysis proposed by Ying et al. into computational theorems and algorithms. The new algorithm without the Jordan decomposition process has a significant acceleration with polynomial complexity both on terminating and almost-surely terminating programs. Moreover, the least upper bound of termination programs steps is studied and utilized to output the substituted matrix representation of quantum programs. We also implement four groups of experiments to illustrate the advantages of the new algorithm in case of processing a simplified quantum walk example comparing with the original counterpart.

关键词： termination analysis quantum while-language quantum programming quantum experiment terminating steps

来源：评论

学校读者我要写书评

暂无评论

Reversibility for quantum programming Language QML

引用

IEEE LATIN AMERICA TRANSACTIONS 2020年第10期18卷 1692-1698页

作者： Plata-Cesar, Nely Raymundo Marcial-Romero, Jose Antonio Hernandez-Servin, Jose Univ Autonoma Estado Mexico Fac Ingn Toluca Mexico

We present an extension of the denotational semantic model of the quantum programming language QML, to which computational reversibility is incorporated. The semantics of QML is defined in a functional setting which consider classical and quantum data, to which we add inverse functions. Additionally we incorporate into the semantics a history track which allows reversibility in QML. From the generation and processing of the history track and the final result of a program, the rules for executing reversibility allow to compute the original input data. This work contributes to the study of reversibility in quantum programming languages and considering that there is not yet a quantum computer in which the language can be implemented, this history and the proposed inverse functions are not trivial and allow us to determine that this language is reversible.

关键词： programming language QML quantum computation quantum programming Reversibility

来源：评论

学校读者我要写书评

暂无评论

Limitations on post-processing assisted quantum programming

引用

quantum INFORMATION PROCESSING 2017年第3期16卷 1-15页

作者： Heinosaari, Teiko Miyadera, Takayuki Tukiainen, Mikko Univ Turku Dept Phys & Astron Turku Ctr Quantum Phys Turku Finland Kyoto Univ Dept Nucl Engn Kyoto 6068501 Japan

A quantum multimeter is a programmable device that can implement measurements of different observables depending on the programming quantum state inserted into it. The advantage of this arrangement over a single-purpose device is in its versatility: one can realize various measurements simply by changing the programming state. The classical manipulation of measurement output data is known as post-processing. In this work we study the post-processing assisted quantum programming, which is a protocol where quantum programming and classical post-processing are combined. We provide examples showing that these two processes combined can be more efficient than either of them used separately. Furthermore, we derive an inequality relating the programming resources to their corresponding programmed observables, thereby enabling us to study the limitations on post-processing assisted quantum programming.

关键词： quantum measurement quantum multimeter quantum programming Data post-processing Joint measurement

来源：评论

学校读者我要写书评

暂无评论

A Flowchart Language for quantum programming

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2011年第4期37卷 466-485页

作者： Ying, Mingsheng Feng, Yuan Univ Technol Sydney Fac Engn & Informat Technol Ctr Quantum Computat & Intelligent Syst Sydney NSW 2007 Australia Tsinghua Univ Dept Comp Sci & Technol Tsinghua Natl Lab Informat Sci & Technol State Key Lab Intelligent Technol & Syst Beijing 100084 Peoples R China

Several high-level quantum programming languages have been proposed in the previous research. In this paper, we define a low-level flowchart language for quantum programming, which can be used in implementation of high-level quantum languages and in design of quantum compilers. The formal semantics of the flowchart language is given, and the notion of correctness for programs written in this language is introduced. A structured quantum programming theorem is presented, which provides a technique of translating quantum flowchart programs into programs written in a high-level language, namely, a quantum extension of the while-language.

关键词： quantum programming flowchart language while-language structured programming

来源：评论

学校读者我要写书评

暂无评论

quantum Simulation of Generalized Hardy's Paradox and Corresponding Hardy's Inequality via quantum programming

引用

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 2021年第5期60卷 1972-1979页

作者： Hou, Tong Ding, Dong Wang, Can Zhang, Xiao-chun He, Ying-qiu North China Inst Sci & Technol Coll Sci Beijing 101601 Peoples R China

Hardy's paradox can demonstrate the conflict between quantum mechanics and local realism. Experimental testing of Hardy's paradox has been carried out, but it involved only a few qubits. We propose a simple but novel approach to verify the generalized Hardy's paradox and Hardy's inequality using quantum programming. By designing scalable quantum circuits, we write quantum programs in Q# and corresponding classical controls in C# using Visual Studio. Our quantum simulation results are consistent with the original theoretical values;moreover, they can be easily extended to multiqubit systems. This provides an effective means for investigating multipartite entanglement question using quantum programming.

关键词： quantum nonlocality quantum programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：