Pith. sign in

REVIEW

Scalable fault-tolerant quantum computation in DFS blocks

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 quant-ph/0407241 v1 pith:RHVZFQZT submitted 2004-07-29 quant-ph

Scalable fault-tolerant quantum computation in DFS blocks

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

We investigate how to concatenate different decoherence-free subspaces (DFSs) to realize scalable universal fault-tolerant quantum computation. Based on tunable $XXZ$ interactions, we present an architecture for scalable quantum computers which can fault-tolerantly perform universal quantum computation by manipulating only single type of parameter. By using the concept of interaction-free subspaces we eliminate the need to tune the couplings between logical qubits, which further reduces the technical difficulties for implementing quantum computation.

discussion (0)

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