相关论文: Are all reversible computations tidy?

It is now well established that there is no lower bound for the energy dissipated during a computation. The relevance of the zero-energy limit is unclear, however, because it entails computations that are unreliable or infinitely slow, or…

Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…

We discuss how to simulate simple quantum logic operations with a large number of qubits. These simulations are needed for experimental testing of scalable solid-state quantum computers. Quantum logic for remote qubits is simulated in a…

Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it…

Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…

We consider how the energy cost of bit reset scales with the time duration of the protocol. Bit reset necessarily takes place in finite time, where there is an extra penalty on top of the quasistatic work cost derived by Landauer. This…

This paper concludes a three-Part series on the limits the laws of physics place on the sustained performance of reversible computers. Part I concerned aggregate performance in terms of computational operations per unit time, but neglected…

We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication…

Energy consumption in solving computational problems has been gaining growing attention as one of the key performance measures for computers. Quantum computation is known to offer advantages over classical computation in terms of various…

Computational complexity characterizes the usage of spatial and temporal resources by computational processes. In the classical theory of computation, e.g. in the Turing Machine model, computational processes employ only local space and…

The NOT operation is a reversible transformation acting on a 1-bit logical state, and should be achievable in a physically reversible manner at no energetic cost. We experimentally demonstrate a bit-flip protocol based on the momentum of an…

Interesting problems in quantum computation take the form of finding low-energy states of (pseudo)spin systems with engineered Hamiltonians that encode the problem data. Motivated by the practical possibility of producing very…

The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…

Accounting for resources is the central issue in computational efficiency. We point out physical constraints implicit in information readout that have been overlooked in classical computing. The basic particle-counting mode of read-out sets…

Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…

Currently available noisy intermediate-scale quantum (NISQ) devices are limited by the number of qubits that can be used for quantum chemistry calculations on molecules. We show herein that the number of qubits required for simulations on a…

In this work, we present a quantum algorithm for ground-state energy calculations of periodic solids on error-corrected quantum computers. The algorithm is based on the sparse qubitization approach in second quantization and developed for…

In the near future, a major challenge in quantum computing is to scale up robust qubit prototypes to practical problem sizes and to implement comprehensive error correction for computational precision. Due to inevitable quantum…

Spin qubits are contenders for scalable quantum computation because of their long coherence times demonstrated in a variety of materials, but individual control by frequency-selective addressing using pulsed spin resonance creates severe…

Quantum error correction is expected to be essential in large-scale quantum technologies. However, the substantial overhead of qubits it requires is thought to greatly limit its utility in smaller, near-term devices. Here we introduce a new…