Pith. sign in

REVIEW

Classical Computation by Quantum Bits

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1509.03420 v1 pith:L5DQXOLK submitted 2015-09-11 quant-ph

Classical Computation by Quantum Bits

classification quant-ph
keywords classicalgatescomputationlogicquantumbeforebitsgate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Atomic-scale logic and the minimization of heating (dissipation) are both very high on the agenda for future computation hardware. An approach to achieve these would be to replace networks of transistors directly by classical reversible logic gates built from the coherent dynamics of a few interacting atoms. As superpositions are unnecessary before and after each such gate (inputs and outputs are bits), the dephasing time only needs to exceed a single gate operation time, while fault tolerance should be achieved with low overhead, by classical coding. Such gates could thus be a spin-off of quantum technology much before full-scale quantum computation. Thus motivated, we propose methods to realize the 3-bit Toffoli and Fredkin gates universal for classical reversible logic using a single time-independent 3-qubit Hamiltonian with realistic nearest neighbour two-body interactions. We also exemplify how these gates can be composed to make a larger circuit. We show that trapped ions may soon be scalable simulators for such architectures, and investigate the prospects with dopants in silicon.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.