| |
 Programme
Overview
Detailed
Programme
| Molecular and
Quantum Computing (MQC) |
CHAIR: MIKA HIRVENSALO
Time: Tuesday, March 22nd, 16h30-18h10
| MQC-1 |
| |
| Title: |
|
|
Numerical Simulations of a Possible
Hypercomputational Quantum Algorithm |
| Author(s): |
A. Sicard,
J. Ospina,
M. Vélez |
| Abstract: |
The hypercomputers compute functions or numbers,
or more generally solve problems or carry out tasks, that
cannot be computed or solved by a Turing machine. Several
numerical simulations of a possible hypercomputational algorithm
based on quantum computations previously constructed by the
authors are presented. The hypercomputability of our algorithm
is based on the fact that this algorithm could solve a classically
non-computable decision problem, the Hilbert's tenth problem.
The numerical simulations were realized for three types of
Diophantine equations: with and without solutions in non-negative
integers, and without solutions by way of various traditional
mathematical packages. |
 |
| MQC-2 |
| |
| Title: |
|
|
Efficient Quantum Circuits Simulation
with the Bubble Bit Technique |
| Author(s): |
U. Mihai |
| Abstract: |
When performed on a classical computer, the
simulation of quantum circuits is usually an exponential job.
The simulation methodology based on Hardware Description Languages
[1] is able to isolate the entanglement as source of simulation
complexity. However, it was shown that this methodology is
not efficient in the presence of total entanglement, and the
probability of such a situation grows exponentially with the
number of qubits [2]. The bubble bit technique is designed
to avoid the entangled representation of the quantum state,
thus allowing the HDL structural description of the quantum
circuit, which requires polynomial resources at simulation.
We provide experimental runtimes, obtained by simulation of
quantum arithmetic and Grover’s algorithm circuits.
|
|
| MQC-3 |
| |
| Title: |
|
|
Redundant Quantum Arithmetic |
| Author(s): |
Antonio Pereira,
Rosalia Rodrigues |
| Abstract: |
Redundant number systems have been widely used
in the speedup of classical digital arithmetic. This work
introduces the concept of redundancy in the quantum computation
field. We show that a constant depth quantum adder circuit
is attainable under this new framework. |
| MQC-4 |
| |
| Title: |
|
|
A Special Class of Additive Cyclic
Codes for DNA Computing |
| Author(s): |
T. Abualrub,
A. Ghrayeb,
X. Zeng |
| Abstract: |
In this paper, we study a special class of nonbinary
additive cyclic codes over GF(4) which we call reversible
complement cyclic codes. Such codes are suitable for constructing
codewords for DNA computing. We develop the theory behind
constructing the set of generator polynomials for these codes.
We study, as an example, all length-7 codes and list those
that have the largest minimum Hamming distance and largest
number of codewords. |
|