量子相干與量子糾纏

As part of the peer learning series, Quantum Computing India had a session on Quantum Hardware 101 hosted by Nilay Awasthi, Kedhar Guhan and Parth Bir — Batch 01 of Apprentis. Here’s a quick log of the session

作為對(duì)等學(xué)習(xí)系列的一部分，印度Quantum Computing在Nilay Awasthi，Kedhar Guhan和Parth Bir(Apprentis的第01批)上主持了有關(guān)Quantum Hardware 101的會(huì)議。 這是會(huì)話的快速日志

Contents

內(nèi)容

• Quantum Hardware Architecture and working
  量子硬件架構(gòu)與工作
• Irreversible vs Reversible circuits
  不可逆與可逆電路
• An Example of a Reversible computation
  可逆計(jì)算的一個(gè)例子
• Why the power of quantum computation has not been explored yet
  為什么尚未探索量子計(jì)算的能力
• Quantum microprocessor architecture
  量子微處理器架構(gòu)
• Executable QASM
  可執(zhí)行QASM

演示地址

Quantum Hardware Architecture and working:

量子硬件架構(gòu)和工作方式：

The session started off with Parth giving us an insight on the architecture of Quantum Hardware.

會(huì)議從Parth開始，使我們對(duì)Quantum硬件的體系結(jié)構(gòu)有了深入的了解。

Quantum Computer Architecture量子計(jì)算機(jī)架構(gòu)

Quantum Computers work on the basis of probability, unlike Classical computers, which are deterministic in nature. In classical computers, we have two bits, 0 and 1. These are two definitive states and are fixed. But in Quantum Computers, there are qubits. These qubits are both 0 and 1 to various degrees. This phenomenon where the states of both 0 and 1 coexist is called superposition. Quantum Computers are thus capable of performing higher and more complex computations in lesser time and are superior to classical computers.

與經(jīng)典計(jì)算機(jī)不同，量子計(jì)算機(jī)本質(zhì)上是確定性的，它基于概率工作。 在經(jīng)典計(jì)算機(jī)中，我們有兩個(gè)位0和1。這是兩個(gè)確定的狀態(tài)，并且是固定的。 但是在量子計(jì)算機(jī)中，存在量子位。 這些量子比特在不同程度上都是0和1。 0和1的狀態(tài)共存的現(xiàn)象稱為疊加。 因此，量子計(jì)算機(jī)能夠在更短的時(shí)間內(nèi)執(zhí)行更高，更復(fù)雜的計(jì)算，并且優(yōu)于傳統(tǒng)計(jì)算機(jī)。

IBM Q System One is the world’s first-ever circuit-based commercial quantum computer, introduced by IBM in January 2019. It’s platform runs in the ‘key arithmetic runtime and compiler’ layer. This is where you’re actually designing all your designs that run on the quantum computer. The instruction set is basically the abstraction of the general operations. The system abstracts the data algorithms that needs to be run, and dumbs it down to a sum of some basic operations like addition and subtraction.

IBM Q System One是IBM在2019年1月推出的世界上第一臺(tái)基于電路的商業(yè)量子計(jì)算機(jī)。它的平臺(tái)在“關(guān)鍵算術(shù)運(yùn)行時(shí)和編譯器”層中運(yùn)行。 這是您實(shí)際設(shè)計(jì)在量子計(jì)算機(jī)上運(yùn)行的所有設(shè)計(jì)的地方。 指令集基本上是一般操作的抽象。 系統(tǒng)抽象出需要運(yùn)行的數(shù)據(jù)算法，并將其愚弄成一些基本操作(例如加法和減法)的總和。

Another important part of the computer is the quantum chip. There is still research going on to see how to design the quantum chip, these are the part of the system that generate qubits. In quantum computers, we not only measure the 0s and 1s but we take into consideration the amplitude angle and phase. Quantum computers also deal with entanglement, which is a phenomena observed when one qubit affects the state of the other qubits in its vicinity.

計(jì)算機(jī)的另一個(gè)重要部分是量子芯片。 仍在進(jìn)行研究以了解如何設(shè)計(jì)量子芯片，這些是生成量子位的系統(tǒng)的一部分。 在量子計(jì)算機(jī)中，我們不僅測(cè)量0和1，而且還要考慮振幅角和相位。 量子計(jì)算機(jī)還處理糾纏，這種糾纏是當(dāng)一個(gè)量子位影響附近其他量子位的狀態(tài)時(shí)觀察到的現(xiàn)象。

Quantum computers need not worry about memory, as the systems are super fast and can generate and compute the results instantly instead of storing and retrieving data like a classical computer; which takes a lot of time and memory space.

量子計(jì)算機(jī)無(wú)需擔(dān)心內(nèi)存，因?yàn)橄到y(tǒng)速度超快，并且可以立即生成和計(jì)算結(jié)果，而無(wú)需像傳統(tǒng)計(jì)算機(jī)那樣存儲(chǔ)和檢索數(shù)據(jù)。 這需要大量時(shí)間和內(nèi)存空間。

Irreversible vs Reversible circuits:

不可逆與可逆電路：

There is also a heat factor which we have to consider: classical computers dissipate heat because of the irreversible computations. Irreversible computations are those where we cannot determine the inputs by looking at the output. Let us elaborate on this.

我們還必須考慮一個(gè)熱因素：傳統(tǒng)計(jì)算機(jī)由于不可逆的計(jì)算而散發(fā)熱量。 不可逆計(jì)算是無(wú)法通過(guò)查看輸出來(lái)確定輸入的計(jì)算。 讓我們?cè)敿?xì)說(shuō)明一下。

For a NOT gate, if we give an input 1, the output will be 0. This is reversible. Given the output 0, we can deduce that the input given must be 1. But if we take an AND gate which requires two inputs, say A and B and we get an output 0. Now to get the output as 0 either A or B must be 1, we can never know the input values by only looking at the output therefore this becomes an irreversible computation.

對(duì)于非門，如果我們給定輸入1，則輸出將為0。這是可逆的。 給定輸出0，我們可以得出給定的輸入必須為1。但是，如果我們使用一個(gè)需要兩個(gè)輸入(例如A和B)的AND門，則輸出為0。現(xiàn)在將A或B的輸出設(shè)為0。必須為1，我們僅通過(guò)查看輸出就無(wú)法知道輸入值，因此這成為不可逆的計(jì)算。

An Example of a Reversible computation:

可逆計(jì)算的示例：

The next question is how we can make an irreversible computation reversible. We do this by changing the MODE of operation: add something to the output to make it a one-one function. Thus, the operation becomes fundamentally different.

下一個(gè)問(wèn)題是我們?nèi)绾问共豢赡娴挠?jì)算可逆。 我們通過(guò)更改操作模式來(lái)做到這一點(diǎn)：在輸出中添加一些內(nèi)容以使其成為一對(duì)一功能。 因此，操作從根本上變得不同。

Eg : ADDER → ADDER — SUBTRACTOR

例如：ADDER → ADDER — SUBTRACTOR

It’s now like n equations in n variables, which is deterministic!

現(xiàn)在就像n個(gè)變量中的n個(gè)方程式，這是確定性的！

Still confused? Let’s elaborate on the ADDER example in Classical computers. In order to add two numbers, we type an instruction which says- add A,B

還是很困惑？ 讓我們?cè)敿?xì)說(shuō)明經(jīng)典計(jì)算機(jī)中的ADDER示例。 為了將兩個(gè)數(shù)字相加，我們輸入一條指令，即-加A，B

Notice that this instruction is irreversible; that is, suppose the output of the add operation is 10 The value of A and B can have n number of combinations like,A=5 B=5 or A=7 B=3 or A=12 B=-3 the possibilities are endless.

注意，該指令是不可逆的。 也就是說(shuō)，假設(shè)加法運(yùn)算的輸出為10。A和B的值可以具有n個(gè)組合，例如A = 5 B = 5或A = 7 B = 3或A = 12 B = -3無(wú)盡。

So we can make this reversible by adding a SUBTRACTOR whose main job is to store the difference of the two inputs.Now if we have an output for addition operation as 10 and the difference as 4 we can deduce that the inputs were 7 and 3 as 7+3=10 and 7–3=4.

因此，我們可以通過(guò)添加一個(gè)SUBTRACTOR使其可逆，其主要工作是存儲(chǔ)兩個(gè)輸入的差值。現(xiàn)在，如果我們將加法運(yùn)算的輸出設(shè)為10，將差值設(shè)為4，則可以推斷出輸入為7和3 7 + 3 = 10和7–3 = 4。

In Quantum we use what is known as a CNOT gate which is a universal gate.(A universal gate is a gate which can implement any Boolean function without using any other gate type). CNOT works by using electron spins as qubits.

在Quantum中，我們使用稱為CNOT門的通用門(通用門是無(wú)需使用任何其他門類型即可實(shí)現(xiàn)任何布爾函數(shù)的門)。 CNOT通過(guò)使用電子自旋作為量子位來(lái)工作。

All these features make the quantum computer a very powerful system. This might make you wonder why your computer at home isn't a quantum based one, right ?

所有這些功能使量子計(jì)算機(jī)成為非常強(qiáng)大的系統(tǒng)。 這可能使您想知道為什么您家里的計(jì)算機(jī)不是基于量子的計(jì)算機(jī)，對(duì)吧？

Why the power of quantum computation has not been explored yet :

為什么尚未探索量子計(jì)算的能力：

The only reason the power of quantum computation has not yet been explored completely is because of the lack of the quantum hardware. There are two mains reasons for this:

尚未完全探索量子計(jì)算能力的唯一原因是由于缺乏量子硬件。 這樣做的主要原因有兩個(gè)：

1.Many algorithms can be designed that need quantum software in order to be implemented, but the accessibility of such software is very low

1.可以設(shè)計(jì)很多算法，需要量子軟件才能實(shí)現(xiàn)，但是此類軟件的可訪問(wèn)性很低

2. There are two flows in quantum computing: data flow and the control flow. We can develop an algorithm to give a well-versed environment for the data flow within the quantum computer, so data flow happens easily. The control flow however, which is basically the feedback mechanism, controls each operation and is very restricted because the level of technology available currently is not up to the mark.

2.量子計(jì)算中有兩個(gè)流程：數(shù)據(jù)流程和控制流程。 我們可以開發(fā)一種算法，為量子計(jì)算機(jī)內(nèi)的數(shù)據(jù)流提供精通的環(huán)境，因此數(shù)據(jù)流很容易發(fā)生。 但是，控制流程(基本上是反饋機(jī)制)控制著每個(gè)操作，并且由于當(dāng)前可用的技術(shù)水平尚未達(dá)到要求而受到很大限制。

To easily apply the designed algorithms, Hadamard initialization is done. This occurs when a hadamard gate is applied to all the qubits. This makes all the probabilities of the qubits have the same level of probability.

為了輕松應(yīng)用設(shè)計(jì)的算法，完成了Hadamard初始化。 當(dāng)哈達(dá)瑪?shù)麻T應(yīng)用于所有量子位時(shí)，就會(huì)發(fā)生這種情況。 這使得所有量子位的概率具有相同的概率水平。

Quantum Microprocessor architecture:

量子微處理器架構(gòu)：

In a classical pipeline, an instruction performs the machine operation which is decoded by the quantum instruction decoder. Then they are put in target registers, which are nothing but memory locations where you actually store the memory. The values stored are not physical or linear, they are the states of the qubits. The qubits in a particular order represent the memory.

在經(jīng)典流水線中，一條指令執(zhí)行由量子指令解碼器解碼的機(jī)器操作。 然后將它們放入目標(biāo)寄存器，這些寄存器不過(guò)是您實(shí)際存儲(chǔ)內(nèi)存的存儲(chǔ)位置。 存儲(chǔ)的值不是物理值或線性值，它們是量子位的狀態(tài)。 特定順序的量子位代表內(nèi)存。

There is also a micro code unit which has a control store. A quantum micro instruction buffer also exists, which combines the entire system. Different address logic also exists and then it’s basically like how we have the controls in the microprocessor.

還有一個(gè)帶有控制存儲(chǔ)器的微碼單元。 還存在一個(gè)量子微指令緩沖器，它將整個(gè)系統(tǒng)組合在一起。 也存在不同的地址邏輯，然后基本上就像我們?cè)谖⑻幚砥髦袚碛锌丶姆绞揭粯印?

Quantum Microprocessor Architecture量子微處理器架構(gòu)

Executable QASM:

可執(zhí)行QASM ：

Executable QASM are control instructions which aid in the data transfer. These might seem very familiar to the instruction which we have for the general microprocessor 8085 or the arm processor . Down below, we have an overview of eQASM instructions

可執(zhí)行的QASM是有助于數(shù)據(jù)傳輸?shù)目刂浦噶睢?這些對(duì)于我們對(duì)通用微處理器8085或機(jī)械臂處理器的指令來(lái)說(shuō)似乎很熟悉。 下面，我們對(duì)eQASM指令進(jìn)行了概述

eQASM instructionseQASM說(shuō)明

The algorithm is written in a program and then it is compiled on a simulator. It basically converts your high level assembly language into something which our hardware system is able to understand.

該算法寫在程序中，然后在模擬器上編譯。 它基本上將您的高級(jí)匯編語(yǔ)言轉(zhuǎn)換為我們的硬件系統(tǒng)能夠理解的語(yǔ)言。

This is a recap of what we saw in the previous session. If you’re someone interested in watching rather than reading, you can check out the full recording of our Hardware team’s presentation.

這是我們?cè)谏弦粚脮?huì)議上看到的內(nèi)容的回顧。 如果您是對(duì)觀看而不是閱讀感興趣的人，則可以查看我們硬件團(tuán)隊(duì)演示文稿的完整記錄。

演示地址

Quantum Hardware Team:

量子硬件團(tuán)隊(duì)：

• Nilay Awasthi
  妮拉·阿瓦西(Nilay Awasthi)
• Parth Bir
  帕特·比爾
• Kedhar Guhan
  凱達(dá)·古漢(Kedhar Guhan)

Content Team:

內(nèi)容團(tuán)隊(duì)：

• Ananya Shivkumar
  阿南亞(Ananya Shivkumar)
• Ananya Das
  阿南亞·達(dá)斯(Ananya Das)

Join us in the #peerlearning series every Sunday 4–6 PM IST.

在每個(gè)IST的每個(gè)星期日4-6下午加入我們的#peerlearning系列。

Book your slots here

在這里預(yù)訂您的位置

-Team QCI

-QCI團(tuán)隊(duì)

翻譯自: https://medium.com/quantumcomputingindia/quantum-hardware-101-81d3b6f5cf9e

量子相干與量子糾纏

總結(jié)

以上是生活随笔為你收集整理的量子相干与量子纠缠_量子硬件101的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。