Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory internal-categories k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).

nLab > Latest Changes: QWIRE

Bottom of Page

1 to 6 of 6

  1.  
    • CommentRowNumber1.
    • CommentAuthorUrs
    • CommentTimeMay 12th 2021

    one more in the list of quantum programming languages

    v1, current

    • CommentRowNumber2.
    • CommentAuthorUrs
    • CommentTimeNov 7th 2022
    • (edited Nov 7th 2022)

    added pointer to:

    diff, v5, current

    • CommentRowNumber3.
    • CommentAuthorUrs
    • CommentTimeNov 12th 2022
    • (edited Nov 12th 2022)

    added pointer to:

    diff, v7, current

    • CommentRowNumber4.
    • CommentAuthorUrs
    • CommentTimeFeb 19th 2023

    added these pointers (maybe to be split off to an entry SQIR):

    diff, v8, current

    • CommentRowNumber5.
    • CommentAuthorUrs
    • CommentTimeFeb 20th 2023

    added pointer to:

    diff, v9, current

    • CommentRowNumber6.
    • CommentAuthorUrs
    • CommentTimeFeb 23rd 2023

    added the following quotes from

    • Robert Rand, Formally Verified Quantum Programming, UPenn (2018) [ediss:3175]

      [p. iv:] “We argue that quantum programs demand machine-checkable proofs of correctness. We justify this on the basis of the complexity of programs manipulating quantum states, the expense of running quantum programs, and the inapplicability of traditional debugging techniques to programs whose states cannot be examined.”

      [p. 3:] “Quantum programs are tremendously difficult to understand and implement, almost guaranteeing that they will have bugs. And traditional approaches to debugging will not help us: We cannot set breakpoints and look at our qubits without collapsing the quantum state. Even techniques like unit tests and random testing will be impossible to run on classical machines and too expensive to run on quantum computers – and failed tests are unlikely to be informative”

      [p. 4:] “Thesis Statement: Quantum programming is not only amenable to formal verification: it demands it.”

      The overarching goal of this thesis is to write and verify quantum programs together. Towards that end, we introduce a quantum programming language called Qwire and embed it inside the Coq proof assistant. We give it a linear type system to ensure that it obeys the laws of quantum mechanics and a denotational semantics to prove that programs behave as desired.

    diff, v10, current

1 to 6 of 6

  1.