量子计算

维基百科,自由的百科全书
跳转至: 导航搜索
布洛赫球面是对于量子比特的一种空间描述, 是建造量子计算机的理论基石.

量子计算Quantum computing)指利用量子力学现象(例如态叠加原理量子纠缠),研究计算系统 (量子计算机) ,来执行数据操作[1]量子计算机区别于基于晶体管二进制数字电子计算机(传统计算机)。一般数字计算是需要将数据编码成二进制位(bit),即最小数据单元总是处于两个确定状态(0 或 1)中的一个,量子计算则使用 量子比特, 可处于一种 量子叠加态量子图灵机 就是量子计算机的一种理论模型,也被称之为通用量子计算机(universal quantum computer)。量子计算领域是由Paul Benioff[2]Yuri Manin(1980),[3] 理查德·費曼(1982),[4]戴维·多伊奇(1985)等人的工作开创的。[5] 1968年,以量子比特方式自旋的量子计算机也被用来制定 量子时空(Quantum spacetime)。[6]

截至2017年 (2017-Missing required parameter 1=month!), 实用量子计算机的发展还处于起步阶段,但已经进行了在极少量的量子位上执行量子计算操作的实验。[7] 实践和理论研究仍在继续,许多国家政府和军事机构正在资助量子计算研究,以便为民用,商业,贸易,环境和国家安全(例如密码分析)等目的开发量子计算。[8] 存在一个小型的16-量子比特(16-qubit)的量子计算机,供业余爱好者通过IBM quantum experience项目进行实验。同IBM公司一样,一家名为D-Wave的公司也在开发他们自己的版本的量子计算机,它使用一个称为量子退火的过程。[9]

大规模量子计算机理论上能够比任何使用当前最好的已知算法的传统计算机更快地解决某些问题,像是使用秀爾演算法(Shor's algorithm)或量子多体系统的模拟整数分解(integer factorization)问题。存在量子算法,比如秀爾演算法,运行速度比任何可能的概率经典算法都要快。 [10] 一个经典计算机原则上可以(使用指数资源)来模拟一个量子算法,因为量子计算并不违反邱奇-图灵论题[11]:202另一方面,量子计算机也许能够有效地解决传统计算机上“事实上”不可行的问题。

基础[编辑]

传统计算机的内存比特(0或1)组成 。量子计算机维持着一个量子比特序列。量子比特是两个基底态的线性叠加,单一量子比特可以代表一个,一个,或是那两种量子态的任意叠加[11]:13–16 一对量子位可以处于4个量子态的任意叠加, [11]:16 3个量子位可以是8个量子态的任意叠加。一般来说,具有 个量子位的量子计算机可以同时处于 个不同状态的任意叠加[11]:17 (相比之下,传统计算机一次只能处于个状态中的其中一个)。量子计算机使用量子门量子测量(这亦会改变观察到的量子态)来操作其量子位。量子算法由一个固定的量子逻辑门序列组成,且通过设置量子位的初始值来编码,类似于传统计算机的工作原理。计算通常以测量结束,将量子位系统折成个纯态之一(其中每个量子位为),分解成经典状态。那么结果可以至多是个经典比特的信息(或者,如果算法没有以测量结束,则结果是未观测到的量子态)。量子算法往往是概率性的,因为它们只能以一定的已知概率提供正确的解。[12] 请注意,术语“非确定性计算”在这种情况下不能用来表示概率(计算),因为术语“非确定性”在计算机科学中具有不同的含义。

实现量子计算机的量子位的一个例子可以从使用具有两个自旋态的粒子开始:"down(顺时针自旋)" and "up(逆时针自旋)" (一般写作 ,或 )。这是真的,因为任何这样的系统都可以映射到一个有效的自旋1/2系统上。

操作原则[编辑]

具有一定数量的量子比特的量子计算机与由相同数量的经典比特组成的经典计算机是有根本性差异的。例如,在传统计算机上表示一个n-qubit(量子比特)系统的状态需要存储2n复数系数,而为了表征一个经典的n-bit(比特)系统的状态,提供n比特的值就足够了(即只需要n位二进制数)。尽管这个事实似乎表明,量子比它们的经典对应物(比特)能够呈现指数级的更多的信息,但必须注意不要忽视这样一个事实,即量子只是在它们所有状态的概率叠加。这意味着,当量子的最终状态被测量时,它们将仅在测量之前的可能组态中被找到。考虑到量子比特系统在测量之前处于一个特定的状态通常是不正确的,因为它们在测量之前处于状态叠加的事实直接影响计算的可能结果。

量子位由控制粒子和控制手段组成(例如捕捉粒子并将它们从一个状态切换到另一个状态的设备)。[13]

为了更好地理解这一点,考虑一个运行在三位寄存器上的经典计算机。如果在给定时间上的寄存器的确切状态是未知的,则可以将其描述为在 不同的3-比特字符串000,001,010,011,100,101,110和111上的概率分布。如果其状态没有不确定性,那么它恰好处于这些状态之一,概率为1。但是,如果它是一个概率计算机,那么它有可能处于任何一个不同的状态。

The state of a three-qubit quantum computer is similarly described by an eight-dimensional vector (or a one dimensional vector with each vector node holding the amplitude and the state as the bit string of qubits). Here, however, the coefficients are complex numbers, and it is the sum of the squares of the coefficients' absolute values, , that must equal 1. For each , the absolute value squared gives the probability of the system being found after a measurement in the -th state. However, because a complex number encodes not just a magnitude but also a direction in the complex plane, the phase difference between any two coefficients (states) represents a meaningful parameter. This is a fundamental difference between quantum computing and probabilistic classical computing.[14]

If you measure the three qubits, you will observe a three-bit string. The probability of measuring a given string is the squared magnitude of that string's coefficient (i.e., the probability of measuring 000 = , the probability of measuring 001 = , etc.). Thus, measuring a quantum state described by complex coefficients gives the classical probability distribution and we say that the quantum state "collapses" to a classical state as a result of making the measurement.

An eight-dimensional vector can be specified in many different ways depending on what basis is chosen for the space. The basis of bit strings (e.g., 000, 001, …, 111) is known as the computational basis. Other possible bases are unit-length, orthogonal vectors and the eigenvectors of the Pauli-x operator. Ket notation is often used to make the choice of basis explicit. For example, the state in the computational basis can be written as:

where, e.g.,

The computational basis for a single qubit (two dimensions) is and .

Using the eigenvectors of the Pauli-x operator, a single qubit is and .

操作[编辑]

未解決的physics問題Is a universal quantum computer sufficient to efficiently simulate an arbitrary physical system? Question mark2.svg

While a classical 3-bit state and a quantum 3-qubit state are each eight-dimensional vectors, they are manipulated quite differently for classical or quantum computation. For computing in either case, the system must be initialized, for example into the all-zeros string, , corresponding to the vector (1,0,0,0,0,0,0,0). In classical randomized computation, the system evolves according to the application of stochastic matrices, which preserve that the probabilities add up to one (i.e., preserve the L1 norm). In quantum computation, on the other hand, allowed operations are unitary matrices, which are effectively rotations (they preserve that the sum of the squares add up to one, the Euclidean or L2 norm). (Exactly what unitaries can be applied depend on the physics of the quantum device.) Consequently, since rotations can be undone by rotating backward, quantum computations are reversible. (Technically, quantum operations can be probabilistic combinations of unitaries, so quantum computation really does generalize classical computation. See quantum circuit for a more precise formulation.)

Finally, upon termination of the algorithm, the result needs to be read off. In the case of a classical computer, we sample from the probability distribution on the three-bit register to obtain one definite three-bit string, say 000. Quantum mechanically, one measures the three-qubit state, which is equivalent to collapsing the quantum state down to a classical distribution (with the coefficients in the classical state being the squared magnitudes of the coefficients for the quantum state, as described above), followed by sampling from that distribution. This destroys the original quantum state. Many algorithms will only give the correct answer with a certain probability. However, by repeatedly initializing, running and measuring the quantum computer's results, the probability of getting the correct answer can be increased. In contrast, counterfactual quantum computation allows the correct answer to be inferred when the quantum computer is not actually running in a technical sense, though earlier initialization and frequent measurements are part of the counterfactual computation protocol.

For more details on the sequences of operations used for various quantum algorithms, see universal quantum computer, Shor's algorithm, Grover's algorithm, Deutsch–Jozsa algorithm, amplitude amplification, quantum Fourier transform, quantum gate, quantum adiabatic algorithm and quantum error correction.

潜力[编辑]

Integer factorization, which underpins the security of public key cryptographic systems, is believed to be computationally infeasible with an ordinary computer for large integers if they are the product of few prime numbers (e.g., products of two 300-digit primes).[15] By comparison, a quantum computer could efficiently solve this problem using Shor's algorithm to find its factors. This ability would allow a quantum computer to decrypt many of the cryptographic systems in use today, in the sense that there would be a polynomial time (in the number of digits of the integer) algorithm for solving the problem. In particular, most of the popular public key ciphers are based on the difficulty of factoring integers or the discrete logarithm problem, both of which can be solved by Shor's algorithm. In particular the RSA, Diffie-Hellman, and elliptic curve Diffie-Hellman algorithms could be broken. These are used to protect secure Web pages, encrypted email, and many other types of data. Breaking these would have significant ramifications for electronic privacy and security.

However, other cryptographic algorithms do not appear to be broken by those algorithms.[16][17] Some public-key algorithms are based on problems other than the integer factorization and discrete logarithm problems to which Shor's algorithm applies, like the McEliece cryptosystem based on a problem in coding theory.[16][18] Lattice-based cryptosystems are also not known to be broken by quantum computers, and finding a polynomial time algorithm for solving the dihedral hidden subgroup problem, which would break many lattice based cryptosystems, is a well-studied open problem.[19] It has been proven that applying Grover's algorithm to break a symmetric (secret key) algorithm by brute force requires time equal to roughly 2n/2 invocations of the underlying cryptographic algorithm, compared with roughly 2n in the classical case,[20] meaning that symmetric key lengths are effectively halved: AES-256 would have the same security against an attack using Grover's algorithm that AES-128 has against classical brute-force search (see Key size). Quantum cryptography could potentially fulfill some of the functions of public key cryptography.

Besides factorization and discrete logarithms, quantum algorithms offering a more than polynomial speedup over the best known classical algorithm have been found for several problems,[21] including the simulation of quantum physical processes from chemistry and solid state physics, the approximation of Jones polynomials, and solving Pell's equation. No mathematical proof has been found that shows that an equally fast classical algorithm cannot be discovered, although this is considered unlikely.[22] For some problems, quantum computers offer a polynomial speedup. The most well-known example of this is quantum database search, which can be solved by Grover's algorithm using quadratically fewer queries to the database than are required by classical algorithms. In this case the advantage is provable. Several other examples of provable quantum speedups for query problems have subsequently been discovered, such as for finding collisions in two-to-one functions and evaluating NAND trees.

Consider a problem that has these four properties:

  1. The only way to solve it is to guess answers repeatedly and check them,
  2. The number of possible answers to check is the same as the number of inputs,
  3. Every possible answer takes the same amount of time to check, and
  4. There are no clues about which answers might be better: generating possibilities randomly is just as good as checking them in some special order.

An example of this is a password cracker that attempts to guess the password for an encrypted file (assuming that the password has a maximum possible length).

For problems with all four properties, the time for a quantum computer to solve this will be proportional to the square root of the number of inputs. It can be used to attack symmetric ciphers such as Triple DES and AES by attempting to guess the secret key.[23]

Grover's algorithm can also be used to obtain a quadratic speed-up over a brute-force search for a class of problems known as NP-complete.

Since chemistry and nanotechnology rely on understanding quantum systems, and such systems are impossible to simulate in an efficient manner classically, many believe quantum simulation will be one of the most important applications of quantum computing.[24] Quantum simulation could also be used to simulate the behavior of atoms and particles at unusual conditions such as the reactions inside a collider.[25]

Quantum supremacy[编辑]

John Preskill has introduced the term quantum supremacy to refer to the hypothetical speedup advantage that a quantum computer would have over a classical computer in a certain field.[26] Google has announced that it expects to achieve quantum supremacy by the end of 2017, and IBM says that the best classical computers will be beaten on some task within about five years.[27] Quantum supremacy has not been achieved yet, and some skeptics doubt that it will ever be.[28]

Obstacles[编辑]

There are a number of technical challenges in building a large-scale quantum computer, and thus far quantum computers have yet to solve a problem faster than a classical computer. David DiVincenzo, of IBM, listed the following requirements for a practical quantum computer:[29]

  • scalable physically to increase the number of qubits;
  • qubits that can be initialized to arbitrary values;
  • quantum gates that are faster than decoherence time;
  • universal gate set;
  • qubits that can be read easily.

Quantum decoherence[编辑]

One of the greatest challenges is controlling or removing quantum decoherence. This usually means isolating the system from its environment as interactions with the external world cause the system to decohere. However, other sources of decoherence also exist. Examples include the quantum gates, and the lattice vibrations and background thermonuclear spin of the physical system used to implement the qubits. Decoherence is irreversible, as it is effectively non-unitary, and is usually something that should be highly controlled, if not avoided. Decoherence times for candidate systems, in particular the transverse relaxation time T2 (for NMR and MRI technology, also called the dephasing time), typically range between nanoseconds and seconds at low temperature.[14] Currently, some quantum computers require their qubits to be cooled to 20 millikelvins in order to prevent significant decoherence.[30]

As a result, time consuming tasks may render some quantum algorithms inoperable, as maintaining the state of qubits for a long enough duration will eventually corrupt the superpositions.[31]

These issues are more difficult for optical approaches as the timescales are orders of magnitude shorter and an often-cited approach to overcoming them is optical pulse shaping. Error rates are typically proportional to the ratio of operating time to decoherence time, hence any operation must be completed much more quickly than the decoherence time.

If the error rate is small enough, it is thought to be possible to use quantum error correction, which corrects errors due to decoherence, thereby allowing the total calculation time to be longer than the decoherence time. An often cited figure for required error rate in each gate is 10−4. This implies that each gate must be able to perform its task in one 10,000th of the coherence time of the system.

Meeting this scalability condition is possible for a wide range of systems. However, the use of error correction brings with it the cost of a greatly increased number of required bits. The number required to factor integers using Shor's algorithm is still polynomial, and thought to be between L and L2, where L is the number of bits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of L. For a 1000-bit number, this implies a need for about 104 bits without error correction.[32] With error correction, the figure would rise to about 107 bits. Computation time is about L2 or about 107 steps and at 1 MHz, about 10 seconds.

A very different approach to the stability-decoherence problem is to create a topological quantum computer with anyons, quasi-particles used as threads and relying on braid theory to form stable logic gates.[33][34]

Developments[编辑]

There are a number of quantum computing models, distinguished by the basic elements in which the computation is decomposed. The four main models of practical importance are:

The quantum Turing machine is theoretically important but direct implementation of this model is not pursued. All four models of computation have been shown to be equivalent; each can simulate the other with no more than polynomial overhead.

For physically implementing a quantum computer, many different candidates are being pursued, among them (distinguished by the physical system used to realize the qubits):

The large number of candidates demonstrates that the topic, in spite of rapid progress, is still in its infancy. There is also a vast amount of flexibility.

Timeline[编辑]

In 1980 Russian mathematician, Yuri Manin proposed the idea.[50]

In 1981, at a conference co-organized by MIT and IBM, physicist Richard Feynman urged the world to build a quantum computer. He said "Nature isn't classical, dammit, and if you want to make a simulation of nature, you'd better make it quantum mechanical, and by golly it's a wonderful problem, because it doesn't look so easy."[51]

In 1984, BB84 is published, the world's first quantum cryptography protocol by IBM scientists Charles Bennett and Gilles Brassard.

In 1993, an international group of six scientists, including Charles Bennett, confirmed the intuitions of the majority of science fiction writers by showing that perfect quantum teleportation is indeed possible[52] in principle, but only if the original is destroyed.

In 1996, The DiVincenzo's criteria are published which is a list of conditions that are necessary for constructing a quantum computer proposed by the theoretical physicist David P. DiVincenzo in his 2000 paper "The Physical Implementation of Quantum Computation".

In 2001, researchers demonstrated Shor's algorithm to factor 15 using a 7-qubit NMR computer.[53]

In 2005, researchers at the University of Michigan built a semiconductor chip ion trap. Such devices from standard lithography, may point the way to scalable quantum computing.[54]

In 2009, researchers at Yale University created the first solid-state quantum processor. The two-qubit superconducting chip had artificial atom qubits made of a billion aluminum atoms that acted like a single atom that could occupy two states.[55][56]

A team at the University of Bristol, also created a silicon chip based on quantum optics, able to run Shor's algorithm.[57] Further developments were made in 2010.[58] Springer publishes a journal (Quantum Information Processing) devoted to the subject.[59]

In February 2010, Digital Combinational Circuits like adder, subtractor etc. are designed with the help of Symmetric Functions organized from different quantum gates.[60][61]

April 2011, a team of scientists from Australia and Japan made a breakthrough in quantum teleportation. They successfully transferred a complex set of quantum data with full transmission integrity, without affecting the qubits' superpositions.[62][63]

Photograph of a chip constructed by D-Wave Systems Inc., mounted and wire-bonded in a sample holder. The D-Wave processor is designed to use 128 superconducting logic elements that exhibit controllable and tunable coupling to perform operations.

In 2011, D-Wave Systems announced the first commercial quantum annealer, the D-Wave One, claiming a 128 qubit processor. On May 25, 2011 Lockheed Martin agreed to purchase a D-Wave One system.[64] Lockheed and the University of Southern California (USC) will house the D-Wave One at the newly formed USC Lockheed Martin Quantum Computing Center.[65] D-Wave's engineers designed the chips with an empirical approach, focusing on solving particular problems. Investors liked this more than academics, who said D-Wave had not demonstrated they really had a quantum computer. Criticism softened after a D-Wave paper in Nature, that proved the chips have some quantum properties.[66][67] Two published papers have suggested that the D-Wave machine's operation can be explained classically, rather than requiring quantum models.[68][69] Later work showed that classical models are insufficient when all available data is considered.[70] Experts remain divided on the ultimate classification of the D-Wave systems though their quantum behavior was established concretely with a demonstration of entanglement.[71]

During the same year, researchers at the University of Bristol created an all-bulk optics system that ran a version of Shor's algorithm to successfully factor 21.[72]

In September 2011 researchers proved quantum computers can be made with a Von Neumann architecture (separation of RAM).[73]

In November 2011 researchers factorized 143 using 4 qubits.[74]

In February 2012 IBM scientists said that they had made several breakthroughs in quantum computing with superconducting integrated circuits.[75]

In April 2012 a multinational team of researchers from the University of Southern California, Delft University of Technology, the Iowa State University of Science and Technology, and the University of California, Santa Barbara, constructed a two-qubit quantum computer on a doped diamond crystal that can easily be scaled up and is functional at room temperature. Two logical qubit directions of electron spin and nitrogen kernels spin were used, with microwave impulses. This computer ran Grover's algorithm generating the right answer from the first try in 95% of cases.[76]

In September 2012, Australian researchers at the University of New South Wales said the world's first quantum computer was just 5 to 10 years away, after announcing a global breakthrough enabling manufacture of its memory building blocks. A research team led by Australian engineers created the first working qubit based on a single atom in silicon, invoking the same technological platform that forms the building blocks of modern-day computers.[77][78]

In October 2012, Nobel Prizes were presented to David J. Wineland and Serge Haroche for their basic work on understanding the quantum world, which may help make quantum computing possible.[79][80]

In November 2012, the first quantum teleportation from one macroscopic object to another was reported by scientists at the University of Science and Technology of China in Hefei.[81][82]

In December 2012, the first dedicated quantum computing software company, 1QBit was founded in Vancouver, BC.[83] 1QBit is the first company to focus exclusively on commercializing software applications for commercially available quantum computers, including the D-Wave Two. 1QBit's research demonstrated the ability of superconducting quantum annealing processors to solve real-world problems.[84]

In February 2013, a new technique, boson sampling, was reported by two groups using photons in an optical lattice that is not a universal quantum computer but may be good enough for practical problems. Science Feb 15, 2013

In May 2013, Google announced that it was launching the Quantum Artificial Intelligence Lab, hosted by NASATemplate:'s Ames Research Center, with a 512-qubit D-Wave quantum computer. The USRA (Universities Space Research Association) will invite researchers to share time on it with the goal of studying quantum computing for machine learning.[85]

In early 2014 it was reported, based on documents provided by former NSA contractor Edward Snowden, that the U.S. National Security Agency (NSA) is running a $79.7 million research program (titled "Penetrating Hard Targets") to develop a quantum computer capable of breaking vulnerable encryption.[86]

In 2014, a group of researchers from ETH Zürich, USC, Google and Microsoft reported a definition of quantum speedup, and were not able to measure quantum speedup with the D-Wave Two device, but did not explicitly rule it out.[87][88]

In 2014, researchers at University of New South Wales used silicon as a protectant shell around qubits, making them more accurate, increasing the length of time they will hold information and possibly made quantum computers easier to build.[89]

In April 2015 IBM scientists claimed two critical advances towards the realization of a practical quantum computer. They claimed the ability to detect and measure both kinds of quantum errors simultaneously, as well as a new, square quantum bit circuit design that could scale to larger dimensions.[90]

In October 2015 researchers at University of New South Wales built a quantum logic gate in silicon for the first time.[91]

In December 2015 NASA publicly displayed the world's first fully operational $15-million quantum computer made by the Canadian company D-Wave at the Quantum Artificial Intelligence Laboratory at its Ames Research Center in California's Moffett Field. The device was purchased in 2013 via a partnership with Google and Universities Space Research Association. The presence and use of quantum effects in the D-Wave quantum processing unit is more widely accepted.[92] In some tests it can be shown that the D-Wave quantum annealing processor outperforms Selby’s algorithm.[93]

In May 2016, IBM Research announced[94] that for the first time ever it is making quantum computing available to members of the public via the cloud, who can access and run experiments on IBM’s quantum processor. The service is called the IBM Quantum Experience. The quantum processor is composed of five superconducting qubits and is housed at the IBM T.J. Watson Research Center in New York.

In August 2016, scientists at the University of Maryland successfully built the first reprogrammable quantum computer.[95]

In October 2016 Basel University described a variant of the electron hole based quantum computer, which instead of manipulating electron spins uses electron holes in a semiconductor at low (mK) temperatures which are a lot less vulnerable to decoherence. This has been dubbed the "positronic" quantum computer as the quasi-particle behaves like it has a positive electrical charge.[96]

In March 2017, IBM announced an industry-first initiative to build commercially available universal quantum computing systems called IBM Q. The company also released a new API (Application Program Interface) for the IBM Quantum Experience that enables developers and programmers to begin building interfaces between its existing five quantum bit (qubit) cloud-based quantum computer and classical computers, without needing a deep background in quantum physics.

In May 2017, IBM announced[97] that it has successfully built and tested its most powerful universal quantum computing processors. The first is a 16 qubit processor that will allow for more complex experimentation than the previously available 5 qubit processor. The second is IBM's first prototype commercial processor with 17 qubits and leverages significant materials, device, and architecture improvements to make it the most powerful quantum processor created to date by IBM.

In July 2017, a group of U.S. researchers announced a quantum simulator with 51 qubits. The announcement was made by Mikhail Lukin of Harvard University at the International Conference on Quantum Technologies in Moscow.[98] A quantum simulator differs from a computer. Lukin’s simulator was designed to solve one equation. Solving a different equation would require building a new system. A computer can solve many different equations.

Relation to computational complexity theory[编辑]

The suspected relationship of BQP to other problem spaces.[99]

The class of problems that can be efficiently solved by quantum computers is called BQP, for "bounded error, quantum, polynomial time". Quantum computers only run probabilistic algorithms, so BQP on quantum computers is the counterpart of BPP ("bounded error, probabilistic, polynomial time") on classical computers. It is defined as the set of problems solvable with a polynomial-time algorithm, whose probability of error is bounded away from one half.[100] A quantum computer is said to "solve" a problem if, for every instance, its answer will be right with high probability. If that solution runs in polynomial time, then that problem is in BQP.

BQP is contained in the complexity class #P (or more precisely in the associated class of decision problems P#P),[101] which is a subclass of PSPACE.

BQP is suspected to be disjoint from NP-complete and a strict superset of P, but that is not known. Both integer factorization and discrete log are in BQP. Both of these problems are NP problems suspected to be outside BPP, and hence outside P. Both are suspected to not be NP-complete. There is a common misconception that quantum computers can solve NP-complete problems in polynomial time. That is not known to be true, and is generally suspected to be false.[101]

The capacity of a quantum computer to accelerate classical algorithms has rigid limits—upper bounds of quantum computation's complexity. The overwhelming part of classical calculations cannot be accelerated on a quantum computer.[102] A similar fact takes place for particular computational tasks, like the search problem, for which Grover's algorithm is optimal.[103]

Bohmian Mechanics is a non-local hidden variable interpretation of quantum mechanics. It has been shown that a non-local hidden variable quantum computer could implement a search of an N-item database at most in steps. This is slightly faster than the steps taken by Grover's algorithm. Neither search method will allow quantum computers to solve NP-Complete problems in polynomial time.[104]

Although quantum computers may be faster than classical computers for some problem types, those described above can't solve any problem that classical computers can't already solve. A Turing machine can simulate these quantum computers, so such a quantum computer could never solve an undecidable problem like the halting problem. The existence of "standard" quantum computers does not disprove the Church–Turing thesis.[105] It has been speculated that theories of quantum gravity, such as M-theory or loop quantum gravity, may allow even faster computers to be built. Currently, defining computation in such theories is an open problem due to the problem of time, i.e., there currently exists no obvious way to describe what it means for an observer to submit input to a computer and later receive output.[106][64]

See also[编辑]

References[编辑]

  1. ^ Gershenfeld, Neil; Chuang, Isaac L. Quantum Computing with Molecules (PDF). Scientific American. June 1998. 
  2. ^ Benioff, Paul. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. Journal of statistical physics. 1980, 22 (5): 563–591. Bibcode:1980JSP....22..563B. doi:10.1007/BF01011339. 
  3. ^ Manin, Yu. I. Vychislimoe i nevychislimoe [Computable and Noncomputable]. Sov.Radio. 1980: 13–15 [2013-03-04] (Russian). 
  4. ^ Feynman, R. P.u. Simulating physics with computers. International Journal of Theoretical Physics. 1982, 21 (6): 467–488. Bibcode:1982IJTP...21..467F. doi:10.1007/BF02650179. 
  5. ^ Deutsch, David. Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer. Proceedings of the Royal Society of London A. 1985, 400 (1818): 97–117. Bibcode:1985RSPSA.400...97D. doi:10.1098/rspa.1985.0070.  已忽略未知参数|citeseerx= (帮助)
  6. ^ Finkelstein, David. Space-Time Structure in High Energy Interactions. (编) Gudehus, T.; Kaiser, G. Fundamental Interactions at High Energy. New York: Gordon & Breach. 1968. 
  7. ^ Gershon, Eric. New qubit control bodes well for future of quantum computing. Phys.org. 2013-01-14 [2014-10-26]. 
  8. ^ Quantum Information Science and Technology Roadmap for a sense of where the research is heading.
  9. ^ Explaining the upside and downside of D-Wave's new Quantum computer
  10. ^ Simon, D.R. On the power of quantum computation. Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. 1994: 116–123. ISBN 0-8186-6580-7. doi:10.1109/SFCS.1994.365701.  已忽略未知参数|citeseerx= (帮助)
  11. ^ 11.0 11.1 11.2 11.3 Nielsen, Michael A.; Chuang, Isaac L. Quantum Computation and Quantum Information 2nd. Cambridge: Cambridge University Press. 2010. ISBN 978-1-107-00217-3. 
  12. ^ Preskill, John. Lecture Notes for Ph219/CS219: Quantum Information Chapter 5 (PDF): 12. 2015. 
  13. ^ Waldner, Jean-Baptiste. Nanocomputers and Swarm Intelligence. London: ISTE. 2007: 157. ISBN 2-7462-1516-0. 
  14. ^ 14.0 14.1 DiVincenzo, David P. Quantum Computation. Science. 1995, 270 (5234): 255–261. Bibcode:1995Sci...270..255D. doi:10.1126/science.270.5234.255.  已忽略未知参数|citeseerx= (帮助) Paid subscription required
  15. ^ Lenstra, Arjen K. Integer Factoring (PDF). Designs, Codes and Cryptography. 2000, 19 (2/3): 101–128. doi:10.1023/A:1008397921377. 
  16. ^ 16.0 16.1 Daniel J. Bernstein, Introduction to Post-Quantum Cryptography. Introduction to Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (editors). Post-quantum cryptography. Springer, Berlin, 2009. ISBN 978-3-540-88701-0
  17. ^ See also pqcrypto.org, a bibliography maintained by Daniel J. Bernstein and Tanja Lange on cryptography not known to be broken by quantum computing.
  18. ^ Robert J. McEliece. "A public-key cryptosystem based on algebraic coding theory." Jet Propulsion Laboratory DSN Progress Report 42–44, 114–116.
  19. ^ Kobayashi, H.; Gall, F.L. Dihedral Hidden Subgroup Problem: A Survey. Information and Media Technologies. 2006, 1 (1): 178–185. 
  20. ^ Bennett C.H., Bernstein E., Brassard G., Vazirani U., "The strengths and weaknesses of quantum computation". SIAM Journal on Computing 26(5): 1510–1523 (1997).
  21. ^ Quantum Algorithm Zoo – Stephen Jordan's Homepage
  22. ^ Jon Schiller, Phd. Quantum Computers. 
  23. ^ Rich, Steven; Gellman, Barton. NSA seeks to build quantum computer that could crack most types of encryption. Washington Post. 2014-02-01. 
  24. ^ Norton, Quinn. The Father of Quantum Computing. Wired.com. 2007-02-15. 
  25. ^ Ambainis, Andris. What Can We Do with a Quantum Computer?. Institute for Advanced Study. Spring 2014. 
  26. ^ Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N.; Babbush, Ryan; Ding, Nan; Jiang, Zhang; Bremner, Michael J.; Martinis, John M.; Neven, Hartmut. Characterizing Quantum Supremacy in Near-Term Devices. arXiv:1608.00263 [quant-ph]. 31 July 2016 –通过arXiv.org. 
  27. ^ Savage, Neil. Quantum Computers Compete for "Supremacy". 
  28. ^ Quantum Supremacy and Complexity. 23 April 2016. 
  29. ^ DiVincenzo, David P. The Physical Implementation of Quantum Computation. Fortschritte der Physik. 2000-04-13, 48: 771–783. Bibcode:2000ForPh..48..771D. arXiv:quant-ph/0002077 [quant-ph]. doi:10.1002/1521-3978(200009)48:9/11<771::AID-PROP771>3.0.CO;2-E. 
  30. ^ Jones, Nicola. Computing: The quantum company. Nature. 19 June 2013, 498 (7454): 286–288. Bibcode:2013Natur.498..286J. PMID 23783610. doi:10.1038/498286a. 
  31. ^ Amy, Matthew; Matteo, Olivia; Gheorghiu, Vlad; Mosca, Michele; Parent, Alex; Schanck, John. Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 (PDF). November 30, 2016 [September 3, 2017]. 
  32. ^ Dyakonov, M. I. Is Fault-Tolerant Quantum Computation Really Possible?. In: Future Trends in Microelectronics. Up the Nano Creek, S. Luryi, J. Xu, and A. Zaslavsky (eds), Wiley, pp. 2006-10-14: 4–18. Bibcode:2006quant.ph.10117D. arXiv:quant-ph/0610117. 
  33. ^ Freedman, Michael H.; Kitaev, Alexei; Larsen, Michael J.; Wang, Zhenghan. Topological quantum computation. Bulletin of the American Mathematical Society. 2003, 40 (1): 31–38. MR 1943131. arXiv:quant-ph/0101025. doi:10.1090/S0273-0979-02-00964-3. 
  34. ^ Monroe, Don. Anyons: The breakthrough quantum computing needs?. New Scientist. 2008-10-01. 
  35. ^ Das, A.; Chakrabarti, B. K. Quantum Annealing and Analog Quantum Computation. Rev. Mod. Phys. 2008, 80 (3): 1061–1081. Bibcode:2008RvMP...80.1061D. arXiv:0801.2193. doi:10.1103/RevModPhys.80.1061.  已忽略未知参数|citeseerx= (帮助)
  36. ^ Nayak, Chetan; Simon, Steven; Stern, Ady; Das Sarma, Sankar. Nonabelian Anyons and Quantum Computation. Rev Mod Phys. 2008, 80 (3): 1083–1159. Bibcode:2008RvMP...80.1083N. arXiv:0707.1889. doi:10.1103/RevModPhys.80.1083. 
  37. ^ Clarke, John; Wilhelm, Frank. Superconducting quantum bits. Nature. June 19, 2008, 453 (7198): 1031–1042. Bibcode:2008Natur.453.1031C. PMID 18563154. doi:10.1038/nature07128. 
  38. ^ Kaminsky, William M. Scalable Superconducting Architecture for Adiabatic Quantum Computation. 2004. arXiv:quant-ph/0403090 [quant-ph]. 
  39. ^ Imamoğlu, Atac; Awschalom, D. D.; Burkard, Guido; DiVincenzo, D. P.; Loss, D.; Sherwin, M.; Small, A. Quantum information processing using quantum dot spins and cavity-QED. Physical Review Letters. 1999, 83 (20): 4204–4207. Bibcode:1999PhRvL..83.4204I. doi:10.1103/PhysRevLett.83.4204. 
  40. ^ Fedichkin, Leonid; Yanchenko, Maxim; Valiev, Kamil. Novel coherent quantum bit using spatial quantization levels in semiconductor quantum dot. Quantum Computers and Computing. 2000, 1: 58–76. Bibcode:2000quant.ph..6097F. arXiv:quant-ph/0006097. 
  41. ^ Leuenberger, MN; Loss, D. Quantum computing in molecular magnets.. Nature. Apr 12, 2001, 410 (6830): 789–93. Bibcode:2001Natur.410..789L. PMID 11298441. arXiv:cond-mat/0011415. doi:10.1038/35071024. 
  42. ^ Knill, G. J.; Laflamme, R.; Milburn, G. J. A scheme for efficient quantum computation with linear optics. Nature. 2001, 409 (6816): 46–52. Bibcode:2001Natur.409...46K. PMID 11343107. doi:10.1038/35051009. 
  43. ^ Nizovtsev, A. P. A quantum computer based on NV centers in diamond: Optically detected nutations of single electron and nuclear spins. Optics and Spectroscopy. August 2005, 99 (2): 248–260. Bibcode:2005OptSp..99..233N. doi:10.1134/1.2034610. 
  44. ^ Gruener, Wolfgang. Research indicates diamonds could be key to quantum storage. 2007-06-01 [2007-06-04]. 
  45. ^ Neumann, P.; 等. Multipartite Entanglement Among Single Spins in Diamond. Science. June 6, 2008, 320 (5881): 1326–1329. Bibcode:2008Sci...320.1326N. PMID 18535240. doi:10.1126/science.1157233. 
  46. ^ Millman, Rene. Trapped atoms could advance quantum computing. ITPro. 2007-08-03 [2007-07-26]. (原始内容存档于2007-09-27). 
  47. ^ Ohlsson, N.; Mohan, R. K.; Kröll, S. Quantum computer hardware based on rare-earth-ion-doped inorganic crystals. Opt. Commun. January 1, 2002, 201 (1–3): 71–77. Bibcode:2002OptCo.201...71O. doi:10.1016/S0030-4018(01)01666-2. 
  48. ^ Longdell, J. J.; Sellars, M. J.; Manson, N. B. Demonstration of conditional quantum phase shift between ions in a solid. Phys. Rev. Lett. September 23, 2004, 93 (13): 130503. Bibcode:2004PhRvL..93m0503L. PMID 15524694. arXiv:quant-ph/0404083. doi:10.1103/PhysRevLett.93.130503. 
  49. ^ Náfrádi, Bálint; Choucair, Mohammad; Dinse, Klaus-Peter; Forró, László. Room Temperature manipulation of long lifetime spins in metallic-like carbon nanospheres. Nature Communications. July 18, 2016, 7: 12232. Bibcode:2016NatCo...712232N. PMC 4960311. PMID 27426851. arXiv:1611.07690. doi:10.1038/ncomms12232. 
  50. ^ Manin, Yu I (1980). Vychislimoe i nevychislimoe (Computable and Noncomputable) (in Russian). Sov.Radio. pp. 13–15. Archived from the original on May 10, 2013. Retrieved October 20, 2017.
  51. ^ Gil, Dario. The Dawn of Quantum Computing is Upon Us. May 4, 2016 [May 4, 2016]. 
  52. ^ Bennett,, C. H. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels (PDF). Physical Review Letters. 29 March 1993, 70 (13): 1895–1899. Bibcode:1993PhRvL..70.1895B. doi:10.1103/PhysRevLett.70.1895. 
  53. ^ Vandersypen, Lieven M. K.; Steffen, Matthias; Breyta, Gregory; Yannoni, Costantino S.; Sherwood, Mark H.; Chuang, Isaac L. Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance. Nature. 2001, 414 (6866): 883–7. Bibcode:2001Natur.414..883V. PMID 11780055. arXiv:quant-ph/0112176. doi:10.1038/414883a. 
  54. ^ U-M develops scalable and mass-producible quantum computer chip. University of Michigan. 2005-12-12 [2006-11-17]. 
  55. ^ DiCarlo, L.; Chow, J. M.; Gambetta, J. M.; Bishop, Lev S.; Johnson, B. R.; Schuster, D. I.; Majer, J.; Blais, A.; Frunzio, L.; S. M. Girvin; R. J. Schoelkopf. Demonstration of two-qubit algorithms with a superconducting quantum processor (PDF). Nature. 9 July 2009, 460 (7252): 240–4 [2009-07-02]. Bibcode:2009Natur.460..240D. PMID 19561592. arXiv:0903.2030. doi:10.1038/nature08121. 
  56. ^ Scientists Create First Electronic Quantum Processor. Yale University. 2009-07-02 [2009-07-02]. 
  57. ^ Code-breaking quantum algorithm runs on a silicon chip. New Scientist. 2009-09-04 [2009-10-14]. 
  58. ^ New Trends in Quantum Computation. Simons Conference on New Trends in Quantum Computation 2010: Program. C.N. Yang Institute for Theoretical Physics. 
  59. ^ "Quantum Information Processing". Springer.com. Retrieved on 2011-05-19.
  60. ^ Bhattacharjee, Pijush Kanti. Digital Combinational Circuits Design by QCA Gates (PDF). International Journal of Computer and Electrical Engineering (IJCEE), Singapore, vol. 2, no. 1, pp. 67–72, February 2010. 2010. 
  61. ^ Bhattacharjee, Pijush Kanti. Digital Combinational Circuits Design with the Help of Symmetric Functions Considering Heat Dissipation by Each QCA Gate (PDF). International Journal of Computer and Electrical Engineering (IJCEE), Singapore, vol. 2, no. 4, pp. 666–672, August 2010. 2010. 
  62. ^ Quantum teleporter breakthrough. University of New South Wales. 2011-04-15. (原始内容存档于2011-04-18). 
  63. ^ Lai, Richard. First light wave quantum teleportation achieved, opens door to ultra fast data transmission. Engadget. 2011-04-18. 
  64. ^ 64.0 64.1 D-Wave Systems sells its first Quantum Computing System to Lockheed Martin Corporation. D-Wave. 2011-05-25 [2011-05-30]. 
  65. ^ Operational Quantum Computing Center Established at USC. University of Southern California. 2011-10-29 [2011-12-06]. 
  66. ^ Johnson, M. W.; Amin, M. H. S.; Gildert, S.; Lanting, T.; Hamze, F.; Dickson, N.; Harris, R.; Berkley, A. J.; Johansson, J.; Bunyk, P.; Chapple, E. M.; Enderud, C.; Hilton, J. P.; Karimi, K.; Ladizinsky, E.; Ladizinsky, N.; Oh, T.; Perminov, I.; Rich, C.; Thom, M. C.; Tolkacheva, E.; Truncik, C. J. S.; Uchaikin, S.; Wang, J.; Wilson, B.; Rose, G. Quantum annealing with manufactured spins. Nature. 12 May 2011, 473 (7346): 194–198. Bibcode:2011Natur.473..194J. PMID 21562559. doi:10.1038/nature10012. 
  67. ^ Simonite, Tom. The CIA and Jeff Bezos Bet on Quantum Computing. Technology Review. October 4, 2012. 
  68. ^ Seung Woo Shin; Smith, Graeme; Smolin, John A.; Vazirani, Umesh. How "Quantum" is the D-Wave Machine?. 2014-05-02. arXiv:1401.7087 [quant-ph]. 
  69. ^ Boixo, Sergio; Rønnow, Troels F.; Isakov, Sergei V.; Wang, Zhihui; Wecker, David; Lidar, Daniel A.; Martinis, John M.; Troyer, Matthias. Quantum Annealing With More Than 100 Qbits. Nature Physics. 2013-04-16, 10 (3): 218–224. Bibcode:2014NatPh..10..218B. arXiv:1304.4595. doi:10.1038/nphys2900. 
  70. ^ Albash, Tameem; Rønnow, Troels F.; Troyer, Matthias; Lidar, Daniel A. Reexamining classical and quantum models for the D-Wave One processor. The European Physical Journal Special Topics. 2014-09-12, 224 (111): 111–129. Bibcode:2015EPJST.224..111A. arXiv:1409.3827. doi:10.1140/epjst/e2015-02346-0. 
  71. ^ Lanting, T.; Przybysz, A. J.; Smirnov, A. Yu.; Spedalieri, F. M.; Amin, M. H.; Berkley, A. J.; Harris, R.; Altomare, F.; Boixo, S.; Bunyk, P.; Dickson, N.; Enderud, C.; Hilton, J. P.; Hoskinson, E.; Johnson, M. W.; Ladizinsky, E.; Ladizinsky, N.; Neufeld, R.; Oh, T.; Perminov, I.; Rich, C.; Thom, M. C.; Tolkacheva, E.; Uchaikin, S.; Wilson, A. B.; Rose, G. Entanglement in a quantum annealing processor. Physical Review X (prx). 2014-05-29, 4 (2). Bibcode:2014PhRvX...4b1041L. arXiv:1401.3500. doi:10.1103/PhysRevX.4.021041. 
  72. ^ Lopez, Enrique Martin; Laing, Anthony; Lawson, Thomas; Alvarez, Roberto; Zhou, Xiao-Qi; O'Brien, Jeremy L. Implementation of an iterative quantum order finding algorithm. Nature Photonics. 2011, 6 (11): 773–776. Bibcode:2012NaPho...6..773M. arXiv:1111.4147. doi:10.1038/nphoton.2012.259. 
  73. ^ Mariantoni, Matteo; Wang, H.; Yamamoto, T.; Neeley, M.; Bialczak, Radoslaw C.; Chen, Y.; Lenander, M.; Lucero, Erik; O'Connell, A. D.; Sank, D.; Weides, M.; Wenner, J.; Yin, Y.; Zhao, J.; Korotkov, A. N.; Cleland, A. N.; Martinis, John M. Quantum computer with Von Neumann architecture. Science. 2011, 334 (6052): 61–65. Bibcode:2011Sci...334...61M. PMID 21885732. arXiv:1109.3743. doi:10.1126/science.1208517. 
  74. ^ Xu, Nanyang; Zhu, Jing; Lu, Dawei; Zhou, Xianyi; Peng, Xinhua; Du, Jiangfeng. Quantum Factorization of 143 on a Dipolar-Coupling NMR system. Physical Review Letters. 2011, 109 (26). Bibcode:2012PhRvL.109z9902X. arXiv:1111.3726. doi:10.1103/PhysRevLett.109.269902. 
  75. ^ IBM Says It's 'On the Cusp' of Building a Quantum Computer. PCMAG. [2014-10-26]. 
  76. ^ Quantum computer built inside diamond. Futurity. [2014-10-26]. 
  77. ^ Australian engineers write quantum computer 'qubit' in global breakthrough. The Australian. [2012-10-03]. 
  78. ^ Breakthrough in bid to create first quantum computer. University of New South Wales. [2012-10-03]. 
  79. ^ Frank, Adam. Cracking the Quantum Safe. New York Times. October 14, 2012 [2012-10-14]. 
  80. ^ Overbye, Dennis. A Nobel for Teasing Out the Secret Life of Atoms. New York Times. October 9, 2012 [2012-10-14]. 
  81. ^ First Teleportation from One Macroscopic Object to Another: The Physics arXiv Blog. MIT Technology Review. November 15, 2012 [2012-11-17]. 
  82. ^ Bao, Xiao-Hui; Xu, Xiao-Fan; Li, Che-Ming; Yuan, Zhen-Sheng; Lu, Chao-Yang; Pan, Jian-wei. Quantum teleportation between remote atomic-ensemble quantum memories. Proceedings of the National Academy of Sciences. November 13, 2012, 109 (50): 20347–20351. Bibcode:2012PNAS..10920347B. PMC 3528515. PMID 23144222. arXiv:1211.2892. doi:10.1073/pnas.1207329109. 
  83. ^ 1QBit Founded. 1QBit.com. [2014-06-22]. 
  84. ^ 1QBit Research. 1QBit.com. [2014-06-22]. 
  85. ^ Launching the Quantum Artificial Intelligence Lab. Research@Google Blog. [2013-05-16]. 
  86. ^ NSA seeks to build quantum computer that could crack most types of encryption. Washington Post. January 2, 2014. 
  87. ^ Defining and detecting quantum speedup, Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, Matthias Troyer, 2014-01-13.
  88. ^ Quantum Chaos: After a Failed Speed Test, the D-Wave Debate Continues. Scientific American. 2014-06-19. 
  89. ^ Gaudin, Sharon. Researchers use silicon to push quantum computing toward reality. Computer World. 23 October 2014. 
  90. ^ IBM achieves critical steps to first quantum computer. www-03.ibm.com. 29 April 2015. 
  91. ^ Condliffe, Jamie. World's First Silicon Quantum Logic Gate Brings Quantum Computing One Step Closer. 
  92. ^ 3Q: Scott Aaronson on Google’s new quantum-computing paper. MIT News. [2016-01-05]. 
  93. ^ Benchmarking a quantum annealing processor with the time-to-target metric, James King, Sheir Yarkoni, Mayssam M. Nevisi, Jeremy P. Hilton, Catherine C. McGeoch, 2015-08-20.
  94. ^ IBM Makes Quantum Computing Available on IBM Cloud to Accelerate Innovation. May 4, 2016 [May 4, 2016]. 
  95. ^ MacDonald, Fiona. Researchers have built the first reprogrammable quantum computer. ScienceAlert. [8 August 2016]. 
  96. ^ A new Type of Quantum Bit. www.unibas.ch. 
  97. ^ IBM Builds Its Most Powerful Universal Quantum Computing Processors. 17 May 2017 [17 May 2017]. 
  98. ^ Reynolds, Matt. Quantum simulator with 51 qubits is largest ever. NewScientist. [23 July 2017]. 
  99. ^ Nielsen, p. 42
  100. ^ Nielsen, p. 41
  101. ^ 101.0 101.1 Bernstein, Ethan; Vazirani, Umesh. Quantum Complexity Theory. SIAM Journal on Computing. 1997, 26 (5): 1411–1473. doi:10.1137/S0097539796300921.  已忽略未知参数|citeseerx= (帮助)
  102. ^ Ozhigov, Yuri. Quantum Computers Speed Up Classical with Probability Zero. Chaos Solitons Fractals. 1999, 10 (10): 1707–1714. Bibcode:1998quant.ph..3064O. arXiv:quant-ph/9803064. doi:10.1016/S0960-0779(98)00226-4. 
  103. ^ Ozhigov, Yuri. Lower Bounds of Quantum Search for Extreme Point. Proceedings of the London Royal Society. 1999, A455 (1986): 2165–2172. Bibcode:1999RSPSA.455.2165O. arXiv:quant-ph/9806001. doi:10.1098/rspa.1999.0397. 
  104. ^ Aaronson, Scott. Quantum Computing and Hidden Variables (PDF). 
  105. ^ Nielsen, p. 126
  106. ^ Scott Aaronson, NP-complete Problems and Physical Reality, ACM SIGACT News, Vol. 36, No. 1. (March 2005), pp. 30–52, section 7 "Quantum Gravity": "[…] to anyone who wants a test or benchmark for a favorite quantum gravity theory,[author's footnote: That is, one without all the bother of making numerical predictions and comparing them to observation] let me humbly propose the following: can you define Quantum Gravity Polynomial-Time? […] until we can say what it means for a 'user' to specify an 'input' and ‘later' receive an 'output'—there is no such thing as computation, not even theoretically." (emphasis in original)

Further reading[编辑]

External links[编辑]

Lectures