Re: Quantum computing practically impossible
Masataka Ohta <mohta@necom830.hpcl.titech.ac.jp> Thu, 05 November 2020 08:29 UTC
Return-Path: <mohta@necom830.hpcl.titech.ac.jp>
X-Original-To: ietf@ietfa.amsl.com
Delivered-To: ietf@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id ECCBC3A0CDC for <ietf@ietfa.amsl.com>; Thu, 5 Nov 2020 00:29:10 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.145
X-Spam-Level:
X-Spam-Status: No, score=-2.145 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, NICE_REPLY_A=-0.247, SPF_HELO_NONE=0.001, SPF_NONE=0.001] autolearn=ham autolearn_force=no
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id nYAfnYqa_tUZ for <ietf@ietfa.amsl.com>; Thu, 5 Nov 2020 00:29:09 -0800 (PST)
Received: from necom830.hpcl.titech.ac.jp (necom830.hpcl.titech.ac.jp [131.112.32.132]) by ietfa.amsl.com (Postfix) with SMTP id 1E8793A0C8B for <ietf@ietf.org>; Thu, 5 Nov 2020 00:29:08 -0800 (PST)
Received: (qmail 34395 invoked from network); 5 Nov 2020 08:09:25 -0000
Received: from necom830.hpcl.titech.ac.jp (HELO ?127.0.0.1?) (131.112.32.132) by necom830.hpcl.titech.ac.jp with SMTP; 5 Nov 2020 08:09:25 -0000
Subject: Re: Quantum computing practically impossible
To: Phillip Hallam-Baker <phill@hallambaker.com>
Cc: IETF Discussion Mailing List <ietf@ietf.org>
References: <1234528e-ef29-e81e-6c47-7bd4abb6fd53@necom830.hpcl.titech.ac.jp> <CAMm+LwhoK5RTYUA2-F9a7a-HfMNmjmUOwf=zDdAT9t7VXsUpXQ@mail.gmail.com>
From: Masataka Ohta <mohta@necom830.hpcl.titech.ac.jp>
Message-ID: <70e1c87e-ebe4-d42a-84ff-a828820c6b14@necom830.hpcl.titech.ac.jp>
Date: Thu, 05 Nov 2020 17:28:51 +0900
User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:68.0) Gecko/20100101 Thunderbird/68.12.1
MIME-Version: 1.0
In-Reply-To: <CAMm+LwhoK5RTYUA2-F9a7a-HfMNmjmUOwf=zDdAT9t7VXsUpXQ@mail.gmail.com>
Content-Type: text/plain; charset="iso-2022-jp"; format="flowed"; delsp="yes"
Content-Language: en-US
Content-Transfer-Encoding: 7bit
Archived-At: <https://mailarchive.ietf.org/arch/msg/ietf/tKmYYd-5BGG3I2nU2tz5fWgswqc>
X-BeenThere: ietf@ietf.org
X-Mailman-Version: 2.1.29
Precedence: list
List-Id: IETF-Discussion <ietf.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/ietf>, <mailto:ietf-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/ietf/>
List-Post: <mailto:ietf@ietf.org>
List-Help: <mailto:ietf-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/ietf>, <mailto:ietf-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 05 Nov 2020 08:29:11 -0000
Phillip Hallam-Baker wrote: > It is my understanding of the work on Quantum error correction that it is > correcting errors in the measurement of quantum states rather than trying > to compensate for decoherence so the base assumption of the paper seems to > be off. Read the draft and you can find Shor's paper, the first paper on quantum error correction (reference [1] of the draft), is titled "Scheme for reducing decoherence in quantum computer memory". The idea of Shor was that the measurement will reset randomly decoherred state to one of a finite set of states. As measurement result can identify which member of the set the states are reset by the measurement, the original state can be restored, which, Shor said, is reduction of decoherence, where reduction means compensation for single, but not double, qubit errors. The problem is that if a state is entangled with many unentangled terms, unless relative coherence between the terms is strictly retained, which is the impossible assumption of Shor, such reduction is impossible. Differently decoherred terms need term specific ways to reduce decoherence, which is impossible by measuring fixed number of extra qubits. > There are good reasons to build quantum computers, If only it had scaled with quantum error correction. Masataka Ohta
- Quantum computing practically impossible Masataka Ohta
- Re: Quantum computing practically impossible Phillip Hallam-Baker
- Re: Quantum computing practically impossible Viktor Dukhovni
- Re: Quantum computing practically impossible Masataka Ohta
- Re: Quantum computing practically impossible Masataka Ohta
- Re: Quantum computing practically impossible Joseph Touch
- Re: Quantum computing practically impossible Phillip Hallam-Baker
- Re: Quantum computing practically impossible Masataka Ohta
- Re: Quantum computing practically impossible Masataka Ohta
- Re: Quantum computing practically impossible Masataka Ohta
- Re: Quantum computing practically impossible Joseph Touch
- Re: Quantum computing practically impossible Masataka Ohta
- Re: Quantum computing practically impossible Rodney Van Meter
- Re: Quantum computing practically impossible Rodney Van Meter
- Re: Quantum computing practically impossible Masataka Ohta
- Re: Quantum computing practically impossible Phillip Hallam-Baker
- Re: Quantum computing practically impossible Michael Richardson
- Re: Quantum computing practically impossible Masataka Ohta