相关论文: The Z1: Architecture and Algorithms of Konrad Zuse…

If a quantum computer is stabilized by fault-tolerant quantum error correction (QEC), then most of its resources (qubits and operations) are dedicated to the extraction of error information. Analysis of this process leads to a set of…

The Petaflops supercomputer "Zhores" recently launched in the "Center for Computational and Data-Intensive Science and Engineering" (CDISE) of Skolkovo Institute of Science and Technology (Skoltech) opens up new exciting opportunities for…

We analyse the design and optimisation of quantum logic circuits suitable for the experimental demonstration of a three-qubit quantum computation prototype based on optically-controlled, solid-state quantum logic gates. In these gates, the…

Constructing an efficient and robust quantum memory is central to the challenge of engineering feasible quantum computer architectures. Quantum error correction codes can solve this problem in theory, but without careful design it can…

Deep Learning neural networks are pervasive, but traditional computer architectures are reaching the limits of being able to efficiently execute them for the large workloads of today. They are limited by the von Neumann bottleneck: the high…

The relation between entropy and information has great significance for computation. Based on the strict reversibility of the laws of microphysics, Landauer (1961), Bennett (1973), Priese (1976), Fredkin and Toffoli (1982), Feynman (1985)…

Quantum computers with tens to hundreds of noisy qubits are being developed today. To be useful for real-world applications, we believe that these near-term systems cannot simply be scaled-down non-error-corrected versions of future…

For any fixed $k$, a remarkably simple single-tape Turing machine can simulate $k$ independent counters in real time. Informally, a counter is a storage unit that maintains a single integer (initially 0), incrementing it, decrementing it,…

In the field of cryptography till date the 1-byte in 1-clock is the best known RC4 hardware design [1], while the 1-byte in 3clocks is the best known implementation [2,3]. The design algorithm in [1] considers two consecutive bytes together…

Liquid computers use incompressible fluids for computational processes. Here we present experimental laboratory prototypes of liquid computers using colloids composed of zinc oxide (ZnO) nanoparticles and microspheres containing thermal…

Data files often consist of numbers having only a few significant decimal digits, whose information content would allow storage in only 32 bits. However, we may require that arithmetic operations involving these numbers be done with 64-bit…

We describe Janus, a massively parallel FPGA-based computer optimized for the simulation of spin glasses, theoretical models for the behavior of glassy materials. FPGAs (as compared to GPUs or many-core processors) provide a complementary…

A solid-state implementation of a quantum computer composed entirely of silicon is proposed. Qubits are Si-29 nuclear spins arranged as chains in a Si-28 (spin-0) matrix with Larmor frequencies separated by a large magnetic field gradient.…

The remarkable properties of silicon have made it the central material for the fabrication of current microelectronic devices. Silicon's fundamental properties also make it an attractive option for the development of devices for spintronics…

We demonstrate experimentally the usefulness of selective pulses in NMR to perform quantum computation. Three different techniques based on selective pulse excitations have been proposed to prepare a spin system in a pseudo-pure state. We…

It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of…

We model human and animal learning by computing with high-dimensional vectors (H = 10,000 for example). The architecture resembles traditional (von Neumann) computing with numbers, but the instructions refer to vectors and operate on them…

Landauer's principle places a fundamental lower limit on the work required to perform a logically irreversible operation. Logically reversible gates provide a way to avoid these work costs, and also simplify the task of making the…

Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a…

We start by an introduction to the basic concepts of computability theory and the introduction of the concept of Turing machine and computation universality. Then se turn to the exploration of trade-offs between different measures of…