Abstract We propose and discuss two postulates on the nature of errors in highly correlated noisy physical stochastic systems. The first postulate asserts that errors for a pair of substantially correlated elements are themselves substantially correlated. The second postulate asserts that in a noisy system with many highly correlated elements there will be a strong effect of error synchronization. These postulates appear to be damaging for quantum computers. Quantum computers and the threshold theorem Quantum computers are hypothetical devices based on quantum physics. A formal definition of quantum computers was pioneered by Deutsch [1], who also realized that they can outperform classical computation. The idea of a quantum computer can be...
In recent years, remarkable progress has been achieved in the development of quantum computers. For ...
The successful implementation of algorithms on quantum processors relies on the accurate control of ...
We describe how physics of computation determines computational complexity. In particular we show ho...
Dedicated to the memory of Itamar Pitowsky The feasibility of computationally superior quantum compu...
I study the effectiveness of fault-tolerant quantum computation against correlated Hamiltonian noise...
This paper aims to give an overview of the current state of fault-tolerant quantum comput-ing, by su...
The potential for scalable quantum computing depends on the viability of fault tolerance and quantum...
The potential for scalable quantum computing depends on the viability of fault tolerance and quantum...
We give a computational complexity argument against the feasibility of quantum computers. We identif...
We study the robustness of a fault-tolerant quantum computer subject to Gaussian non-Markovian quant...
We study the robustness of a fault-tolerant quantum computer subject to Gaussian non-Markovian quant...
A major hurdle in building a quantum computer is overcoming noise, since quantum superpositions are ...
A major hurdle in building a quantum computer is overcoming noise, since quantum superpositions are ...
The goal of this paper is to review the theoretical basis for achieving a faithful quantum informati...
We analyze the long-time behavior of a quantum computer running a quantum error correction (QEC) cod...
In recent years, remarkable progress has been achieved in the development of quantum computers. For ...
The successful implementation of algorithms on quantum processors relies on the accurate control of ...
We describe how physics of computation determines computational complexity. In particular we show ho...
Dedicated to the memory of Itamar Pitowsky The feasibility of computationally superior quantum compu...
I study the effectiveness of fault-tolerant quantum computation against correlated Hamiltonian noise...
This paper aims to give an overview of the current state of fault-tolerant quantum comput-ing, by su...
The potential for scalable quantum computing depends on the viability of fault tolerance and quantum...
The potential for scalable quantum computing depends on the viability of fault tolerance and quantum...
We give a computational complexity argument against the feasibility of quantum computers. We identif...
We study the robustness of a fault-tolerant quantum computer subject to Gaussian non-Markovian quant...
We study the robustness of a fault-tolerant quantum computer subject to Gaussian non-Markovian quant...
A major hurdle in building a quantum computer is overcoming noise, since quantum superpositions are ...
A major hurdle in building a quantum computer is overcoming noise, since quantum superpositions are ...
The goal of this paper is to review the theoretical basis for achieving a faithful quantum informati...
We analyze the long-time behavior of a quantum computer running a quantum error correction (QEC) cod...
In recent years, remarkable progress has been achieved in the development of quantum computers. For ...
The successful implementation of algorithms on quantum processors relies on the accurate control of ...
We describe how physics of computation determines computational complexity. In particular we show ho...