#### Filter Results:

#### Publication Year

2007

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A general definition of a quantum predicate and quantum labelled transition systems for finite quantum computation systems is presented. The notion of a quantum predicate as a positive operator-valued measure is developed. The main results of this paper are a theorem about the existence of generalised predicates for quantum programs defined as completely… (More)

Generalisation of the quantum weakest precondition result of D'Hondt and Panangaden is presented. In particular the most general notion of quantum predicate as positive operator valued measure (POVM) is introduced. The previously known quantum weakest precondition result has been extended to cover the case of POVM playing the role of a quantum predicate.… (More)

In this chapter a quantum communication protocol with use of repeaters is presented. The protocol is constructed for qudits i.e. the generalized quantum information units. One-dit teleportation is based on the generalized Pauli-Z (phase-flip) gate's correction. This approach avoids using Pauli-X and Hadamard gates unlike in other known protocols based on… (More)

FPGA technology can offer significantly higher performance at much lower power than is available from CPUs and GPUs in many computational problems. Unfortunately, programming for FPGA (using hardware description languages, HDL) is a difficult and not-trivial task and is not intuitive for C/C++/Java programmers. To bring the gap between programming… (More)

- Artur Gramacki, Marek Sawerwain, Jarosław Gramacki
- 2015

FPGA technology can offer significantly higher performance at much lower power consumption than is available from CPUs and GPUs in many computational problems. Unfortunately, programming for FPGA (using hardware description languages, HDL) is a difficult and not-trivial task and is not intuitive for C/C++/Java programmers. To bring the gap between… (More)