Glossary

Quantum Computing


Bloch Spere
In quantum mechanics, the Bloch sphere is a geometrical representation of the pure state space of a two-level quantum mechanical system (qubit), named after the physicist Felix Bloch. The Bloch sphere is a unit sphere, with antipodal points corresponding to a pair of mutually orthogonal state vectors. The Bloch Sphere provides the following interpretation: the poles represent classical bits and we use the notation |0⟩ and |1⟩. However, while these are the only possible states for the classical bit representation, quantum bits cover the whole sphere. Thus, there is much more information involved in the quantum bits, and the Bloch sphere depicts this. When the qubit is measured, it collapses to one of the two poles. Which of the two poles depends on which direction the arrow in the Bloch representation points to: if the arrow is closer to the north pole, there is a greater probability of collapsing to that pole; and the same for the south pole. It should be observed that this introduces the notion of probability to the Bloch sphere: the angle θ of the arrow with the vertical axes corresponds to that probability. If the arrow points to the equator, there is 50-50 chance of collapsing at either pole.

Coherence

The coherence of a qubit, roughly speaking, is its ability to maintain superposition over time. It is therefore the absence of “decoherence”, which is any process that collapses the quantum state into a classical state, for instance by interaction with an environment.


DiVincenzo Criteria

The DiVincenzo criteria are a list of conditions that are necessary to construct a quantum computer, and they were first proposed by the theoretical physicist David P. DiVincenzo in his 2000 paper “The Physical Implementation of Quantum Computation”. The DiVincenzo criteria consist of 5+2 conditions that an experimental setup must satisfy in order to successfully implement quantum algorithms, such as Grover’s search algorithm, or Shor factorisation. The two additional conditions are necessary to implement quantum communication, such as that used in the quantum key distribution.

  1. A scalable physical system with well characterized qubits.
  2. The ability to initialize the state of the qubits to a simple fiducial state.
  3. Long relevant decoherence times.
  4. A “universal” set of quantum gates.
  5. A qubit-specific measurement capability.
  6. The ability to interconvert stationary and flying qubits.
  7. The ability to faithfully transmit flying qubits between specified locations.

Entanglement

Quantum entanglement is a special connection between two qubits. There are many ways of generating entanglement. One way is to bring two qubits close together, to perform an operation to entangle them and then move them apart again. When they are entangled, you can move them arbitrarily far away from each other and they will remain entangled. This entanglement will manifest itself in the outcomes of measurements on these qubits. When measured, these qubits will always yield zero or one randomly, but no matter how far away they are from each other, they will always yield the same outcome. Entanglement has two very special properties that allow all the applications derived from it to be made: the first property is that entanglement cannot be shared. If two qubits are maximally entangled with each other, then no other party in the universe can have a share of this entanglement. This property is called the monogamy of entanglement. The second property of entanglement, which makes it so powerful, is called maximal coordination. This property manifests itself when measuring the qubits. When two qubits that are entangled are measured in the same basis, no matter how far away they are from each other, they will always yield the same outcome. This outcome is not decided beforehand, but is completely random and decided on when the measurement takes place.


Majorana Fermion

Elementary particles, (the “fermions”) which form the matter, are described by an equation formulated in 1928 by Paul Dirac, the Dirac Equation. It implies that every fundamental particle in the universe has an antiparticle, which has the same mass but the opposite charge. In 1932 was found the first antiparticle: the positron, associated with the electron.
The electron and the other elementary particles have distinct antiparticles and they acquire mass through Higgs mechanism: in physics they are called “Dirac fermions”.
In 1937, the Italian physicist Ettore Majorana found out a more general equation (Majorana Equation) that predicts the existence of neutral fermions (without electric charge) that are their own antiparticles. Majorana fermions are exotic particles because they acquire the mass, not through Higgs mechanism, but interacting with themselves, because they are their own antiparticles.
This kind of interaction happens without annihilation, because Majorana fermions are very stable and interact very little with “ordinary” matter.


Measurement

Measurement is the act of observing a quantum state. This observation will yield classical information, such as a bit. It is important to note that this measurement process will change the quantum state. For instance, if the state is in superposition, this measurement will ‘collapse’ it into a classical state: zero or one. This collapse process takes place randomly. Before a measurement is done, there is no way of knowing what the outcome will be. However, it is possible to calculate the probability of each outcome. This probability is a prediction about the quantum state, a prediction that we can test by preparing the state several times, measuring it and then counting the fraction of each outcome.


No Cloning Theorem

The no-cloning principle is a fundamental property of quantum mechanics which states that, given an unknown quantum state, there is no reliable way of producing extra copies of that state. This means that information encoded in quantum states is essentially unique. This is sometimes very annoying, such as when you want to protect quantum information from outside influences, but it is also sometimes very useful, such as when you want to communicate securely with someone else.


Quantum Advantage

For a given problem, the improvement in run time for a quantum computer versus a conventional computer running the best known conventional algorithm.


Quantum Algorithm

An algorithm is a collection of instructions that allows you to compute a function, for instance the square of a number. A quantum algorithm is exactly the same thing, but the instructions also allow superpositions to be made and entanglement to be created. This allows quantum algorithms to do certain things that cannot be done efficiently with regular algorithms.


Quantum Dot

Quantum dots are effectively “artificial atoms.” They are nanocrystals of semiconductor wherein an electron-hole pair can be trapped. The nanometer size is comparable to the wavelength of light and so, just like in an atom, the electron can occupy discrete energy levels. The dots can be confined in a photonic crystal cavity, where they can be probed with laser light.


Quantum Error Correction

Quantum computers are always in contact with the environment. This environment can disturb the computational state of the system, thereby causing information loss. Quantum error correction combats this loss by taking the computational state of the system and spreading it out over an entangled state over many qubits. This entanglement allows outside classical observers to observe and remedy disturbances without observing the computational state itself, which would collapse it.


Quantum Internet

Researchers at QuTech in the Netherlands are trying to build the world’s first quantum internet. Quantum Internet is like the regular Internet but it can send quantum states and establish entanglement. Building a full-scale quantum internet is of course very hard. So they will begin by establishing a small four-node network by 2020. This four-node network would serve as a testbed for the larger network. The four nodes in this network will be four cities in the Netherlands: Delft, Amsterdam, Leiden and The Hague.


Quantum Indeterminacy

The fundamental condition of existence, supported by all empirical evidence, in which an isolated quantum system, such as a free electron, does not possess fixed properties until observed in experiments designed to measure those properties. That is, a particle does not have a specific mass, or position, or velocity, or spin, until those properties are measured. Indeed, in a strict sense the particle does not exist until observed.


Quantum Key Distribution (QKD)

Quantum key distribution (QKD) is a method that leverages the properties of quantum mechanics, such as the no cloning theorem, to allow two people to securely agree on a key (OTP – One Time Pad). A key in this context is a secret code-word that is shared only between you and the person you are trying to communicate with. This secret code-word can then be used to encrypt messages such that they can be transmitted without being read by a malicious third party.


Quantum Repeater

Quantum repeaters enable long distance communication over a quantum network. An optical fiber can transmit a qubit over roughly 100 kilometers. If you want to send a quantum information over an very long distance just a fiber is not good enough. To send information over this long distances we need quantum repeaters. Quantum repeaters can be thought of as a series of short entangled links connecting the two points. The quantum information can then be teleported through these links and arrive safely at its destination.


Quantum Sensor

A quantum sensor is a device that exploits quantum correlations, such as quantum entanglement, to achieve a sensitivity or resolution that is better than can be achieved using only classical systems. A quantum sensor can measure the effect of the quantum state of another system on itself. The mere act of measurement influences the quantum state and alters the probability and uncertainty associated with its state during measurement. Quantum sensor is also a term used in other settings where entangled quantum systems are exploited to make better atomic clocks or more sensitive magnetometers. If you have a super sensitive detector, its killer app is surely in measuring the smallest effects you could possibly imagine. This might mean be the tiny disturbances in space as a gravitational wave goes by; or a small change in a magnetic field, perhaps that of the Earth itself; or even overcoming the shortcomings of conventional radar systems, to build a quantum radar for detecting stealth planes.


Quantum Tunnelling

Quantum Tunnelling is the quantum mechanical effect in which particles have a finite probability of crossing an energy barrier, or transitioning through an energy state normally forbidden to them by classical physics, due to the wave-like aspect of particles. The probability wave of a particle represents the probability of finding the particle in a certain location, and there is a finite probability that the particle is located on the other side of the barrier.


Quantum Simulation

Quantum simulation, which originated to a great extent with Richard Feynman’s 1982 proposal, has evolved into a field where scientists use a controllable quantum system to study a second, less experimentally feasible quantum phenomenon. In short, a full-scale quantum computer does not yet exist, and classical computers often cannot solve quantum problems, thus a “quantum simulator” presents an attractive alternative to gain insight into, for example, complex material properties.


Quantum Supremacy

A calculation on a quantum computer that cannot be in practice be performed on any foreseeable conventional computer. Either the number of CPU steps required or the necessary computer memory increases exponentially with the size of the input. This means that for all but the simplest cases, the calculation becomes unfeasible on a real machine using only conventional digital hardware.


Qubit

A classical bit can be in two states, it can be either zero or it can be one. A quantum bit or qubit, however, can be in a sort of zero state and in a one state at the same time. This situation is called a superposition of (quantum) states. Qubits have some very particular properties: for instance, it is not possible to make copies of qubits. This is sometimes very useful, such as when you want to keep information private, and in fact this property is used in quantum cryptography. But it is also sometimes very annoying, because if you can’t copy a qubit, you can’t use this copying mechanism as a way to fix errors.


Superconducting quantum computing

Superconducting quantum computing is an implementation of a quantum computer in superconducting electronic circuits. Research in superconducting quantum computing is conducted by IBM, Google, Rigetti Computing, Microsoft and Intel. The devices are typically designed in the radio-frequency spectrum, cooled down in dilution refrigerators below 100mK and addressed with conventional electronic instruments, e.g. frequency synthesizers and spectrum analyzers. The typical dimensions, of a scale of micrometers, with sub-micrometer resolution, allow a convenient design of a quantum Hamiltonian with the well-established integrated circuit technology.


Superposition

Superposition is a fundamental principle of quantum mechanics. It states that, like waves in classical physics, quantum states can be added together – superposed – to yield a new valid quantum state; and conversely, that every quantum state can be seen as a linear combination, a sum of other distinct quantum states.


Teleportation

Quantum teleportation is a method to send qubits using entanglement. Teleportation works as follows: first Alice and Bob need to establish an entangled pair of qubits between them. Alice then takes the qubit that she wants to send and the qubit that is entangled with Bob’s qubit and performs a measurement on them. This measurement collapses the qubits and destroys the entanglement, but gives her two classical outcomes in the form of two classical bits. Alice takes this two classical bits and sends them over the classical Internet to Bob. Bob then applies a correction operation that depends on these two classical bits to his qubit. This allows him to recover the qubit that was originally in Alice’s possession. Note that we have now transmitted a qubit without really using a physical carrier
that is capable of transmitting qubits. But of course you already need entanglement to do this. It is also important to note that quantum teleportation does not allow for faster than light communication. This is so because Bob cannot make sense of the qubit in her possession before he gets the classical measurement outcomes from Alice. These classical measurement outcomes must take a certain amount of time to be transmitted. And this time is lower bounded by the speed of light.


Topological Quantum Computer

A topological quantum computer is a theoretical quantum computer that employs two-dimensional quasiparticles called anyons, whose world lines pass around one another to form braids in a three-dimensional spacetime (i.e., one temporal plus two spatial dimensions). These braids form the logic gates that make up the computer. The advantage of a quantum computer based on quantum braids over using trapped quantum particles is that the former is much more stable. Small, cumulative perturbations can cause quantum states to decohere and introduce errors in the computation, but such small perturbations do not change the braids’ topological properties. This is like the effort required to cut a string and reattach the ends to form a different braid, as opposed to a ball (representing an ordinary quantum particle in four-dimensional spacetime) bumping into a wall. Alexei Kitaev proposed topological quantum computation in 1997.


Universal Quantum Computer

A Quantum Turing machine (QTM), also a universal quantum computer, is an abstract machine used to model the effect of a quantum computer. It provides a very simple model which captures all of the power of quantum computation. Any quantum algorithm can be expressed formally as a particular quantum Turing machine. Such Turing machines were first proposed in a 1985 article written by Oxford University physicist David Deutsch suggesting quantum gates could function in a similar fashion to traditional digital computing binary logic gates. Quantum Turing machines are not always used for analyzing quantum computation; the quantum circuit is a more common model. These models are computationally equivalent.


Source: www.dotquantum.io

Blockchain & Crypto-Mining


ASIC

An application-specific integrated circuit is an integrated circuit chip customized for a particular use, rather than intended for general-purpose use. ASIC chips are typically fabricated using metal-oxide-semiconductor (MOS) technology, as MOS integrated circuit chips.


AsicBoost

AsicBoost is a patent-pending method to speed up Bitcoin mining by a factor of approximately 20%. The performance gain is achieved through a high level optimization of the Bitcoin mining algorithm (SHA256) which allows for a drastic reduction in gate count on the mining chip.


Big Data

Big data refers to the large, diverse sets of information that grow at ever-increasing rates. It encompasses the volume of information, the velocity or speed at which it is created and collected, and the variety or scope of the data points being covered (known as the "three v's" of big data). Big data often comes from data mining and arrives in multiple formats.


BIP
Bitcoin Improvement Proposal or BIP, is a technical design document providing information to the bitcoin community, or describing a new feature for bitcoin or its processes or environment which affect the Bitcoin protocol. New features, suggestions, and design changes to the protocol should be submitted as a BIP. The BIP author is responsible for building consensus within the community and documenting dissenting opinions.

Bitcoin Mining
Bitcoin mining is the process of using computer hardware to do mathematical calculations for the bitcoin network in order to confirm transactions. Miners collect transaction fees for the transactions they confirm and are awarded bitcoins for each block they verify.

Block
Blocks are found in the bitcoin blockchain. Blocks connect all transactions together. Transactions are combined into single blocks and are verified every ten minutes through mining. Each subsequent block strengthens the verification of the previous blocks, making it impossible to double spend bitcoin transactions.

Blockchain
The bitcoin blockchain is a public record of all bitcoin transactions. You might also hear the term used as a “public ledger.” The blockchain shows every single record of bitcoin transactions in order, dating back to the very first one. The entire blockchain can be downloaded and openly reviewed by anyone, or you can use a block explorer to review the blockchain online.

Block Height
The block height is just the number of blocks connected together in the block chain. Height 0 for example refers to the very first block, called the “genesis block.”

Block Reward
When a block is successfully mined on the bitcoin network, there is a block reward that helps incentivize miners to secure the network. The block reward is part of a “coinbase” transaction which may also include transaction fees. The block rewards halve roughly every four years. The current reward is 12.5 bitcoins per block mined and will presumably be halved in mid-2020.

Change
Let’s say you are spending $1.90 in your local supermarket, and you give the cashier $2.00. You will get back .10 cents in change. The same logic applies to bitcoin transactions. Bitcoin transactions are made up of inputs and outputs. When you send bitcoins, you can only send them in a whole “output.” The change is then sent back to the sender.

Cold Storage
The term cold storage is a general term for different ways of securing your bitcoins offline (disconnected from the internet). This would be the opposite of a hot wallet or hosted wallet, which is connected to the web for day-to-day transactions. The purpose of using cold storage is to minimize the chances of your bitcoins being stolen from a malicious hacker and is commonly used for larger sums of bitcoins.

Confirmation
A confirmation means that the bitcoin transaction has been verified by the network, through the process known as mining. Once a transaction is confirmed, it cannot be reversed or double spent. Transactions are included in blocks.

Cryptography
Cryptography is used in multiple places to provide security for the Bitcoin network. Cryptography, which is essentially mathematical and computer science algorithms used to encrypt and decrypt information, is used in bitcoin addresses, hash functions, and the blockchain.

Decentralized
Having a decentralized bitcoin network is a critical aspect. The network is “decentralized,” meaning that it’s void of a centralized company or entity that governs the network. Bitcoin is a peer-to-peer protocol, where all users within the network work and communicate directly with each other, instead of having their funds handled by a middleman, such as a bank or credit card company.

Deep Learning
Deep learning is an artificial intelligence (AI) function that imitates the workings of the human brain in processing data and creating patterns for use in decision making. Deep learning is a subset of machine learning in artificial intelligence that has networks capable of learning unsupervised from data that is unstructured or unlabeled. Also known as deep neural learning or deep neural network.

Difficulty
Difficulty is directly related to bitcoin mining (see mining below), and how hard it is to verify blocks in the bitcoin network. bitcoin adjusts the mining difficulty of verifying blocks.

Double Spend
If someone tries to send a bitcoin transaction to two different recipients at the same time, this is double spending. Once a bitcoin transaction is confirmed, it makes it nearly impossible to double spend it. The more confirmations that a transaction has, the harder it is to double spend the bitcoins.

FPGA
A field-programmable gate array is an integrated circuit designed to be configured by a customer or a designer after manufacturing – hence the term "field-programmable". The FPGA configuration is generally specified using a hardware description language (HDL), similar to that used for an application-specific integrated circuit (ASIC).

Full Node
A full node is when you download the entire blockchain using a bitcoin client, and you relay, validate, and secure the data within the blockchain. The data is bitcoin transactions and blocks, which is validated across the entire network of users.

GPU
A graphics processing unit is a specialized electronic circuit designed to rapidly manipulate and alter memory to accelerate the creation of images in a frame buffer intended for output to a display device.

Hash function
A hash is, in general, a mathematical function that converts an input of arbitrary length into an encrypted output of a fixed length. Thus, regardless of the original amount of data or file size involved, its unique hash will always be the same size.

Halving
Bitcoins have a finite supply, which makes them scarce. The total amount that will ever be issued is 21 million. The number of bitcoins generated per block is decreased 50% every four years. This is called “halving.” The final halving will take place in the year 2140.

Hash (txid)
A transaction hash (sometimes referred to as a transaction ID or txid) is a unique identifier that can be used on any block explorer to look up all of the public details of a particular transaction. Every on-chain transaction has a unique hash made up of a long string of alphanumeric characters.

Hash Rate
The hash rate is how the bitcoin mining network processing power is measured. In order for miners to confirm transactions and secure the blockchain, the hardware must perform intensive computational operations which is output in hashes per second (THs is tera hashes per second).

Message Schedule
Is a function that generates sixty-four words from 16 words input message block (a word is represented by 32 bit, hence a total of 512 bit). The message scheduler is a key part of the bitcoin mining algorithm: it is computed three times for each winning hash generation attempt, i.e., trillions of times per second.

Nanometer
A nanometer is a unit of measurement that is equivalent to one billionth of a meter. It is widely used as a scale for building tiny, complex, and atomic-scale computing and electronic components, such as ASIC chips.

Nonce
The Nonce is a random whole number, which is a 32-bit, which is adjusted by the miners, so that it becomes a valid number to be used for hashing the value of a Block. A typical Miner tests and discards trillions of Nonce per second until they find that Golden Nonce which is valid. In order to complete the verification faster than other miners, miners compete with each other using their computer hashing power. Once the Golden Nonce is found, they can complete the Block and add it to the Block Chain and there by receive the Block reward, i.e., reward bitcoins.

SHA256
Secure Hashing Algorithm (SHA) -256 is the hash function and mining algorithm of the Bitcoin protocol, referring to the cryptographic hash function that outputs a 256 bits long value. Version rolling: Miners can inspect the nVersion field (32 bit) of a block, by rolling the nVersion field. A typical Miner tests and discards more than a billion of random bits activated by the rolling, until a winning hash is found. The method is also referred as Overt-AsicBoost.

Pool Mining
As part of bitcoin mining, mining “pools” are a network of miners that work together to mine a block, then split the block reward among the pool miners. Mining pools are a good way for miners to combine their resources to increase the probability of mining a block, and also contribute to the overall health and decentralization of the bitcoin network. There are several bitcoin pools a miner can join, even switching from one to the other within the same day. The choice of a pool by a miner depends on several factors (for example, how fast the working connection with the mining pool is or the hash rate power made available by the pool).

Private Key
A private key is a string of data that shows you have access to bitcoins in a specific wallet. Think of a private key like a password; private keys must never be revealed to anyone but you, as they allow you to spend the bitcoins from your bitcoin wallet through a cryptographic signature.

Proof of Work
Proof of work refers to the hash of a block header (blocks of bitcoin transactions). A block is considered valid only if its hash is lower than the current target. Each block refers to a previous block adding to previous proofs of work, which forms a chain of blocks, known as a blockchain. Once a chain is formed, it confirms all previous Bitcoin transactions and secures the network.

Public Address
A public bitcoin address is cryptographic hash of a public key. A public address typically starts with the number “1.” Think of a public address like an email address. It can be published anywhere and bitcoins can be sent to it, just like an email can be sent to an email address.

Quantum annealing (QA)
is a metaheuristic for finding the global minimum of a given objective function over a given set of candidate solutions, by a process using quantum fluctuations. Quantum annealing is used mainly for problems where the search space is discrete with many local minima; such as finding the ground state of a spin glass or the traveling salesman problem.

RBF
RBF stands for Replace By Fee, and refers to a method that allows a sender to replace a “stuck” or unconfirmed transaction with a new one that uses a higher fee. This is done to make sure a transaction confirms as quickly as possible. The “replacement” transaction uses the same inputs as the original one. This is not considered a double spend, as the receiving address(es) typically remain the same.

Satoshi Nakamoto
Bitcoin’s existence began with an academic paper written in 2008 by a developer under the name of Satoshi Nakamoto. Satoshi is the name used as the original inventor of Bitcoin.

Transaction
A transaction is when data is sent to and from one bitcoin address to another. Just like financial transactions where you send money from one person to another, in bitcoin you do the same thing by sending data (bitcoins) to each other. Bitcoins have value because it’s based on the properties of mathematics, rather than relying on physical properties (like gold and silver) or trust in central authorities, like fiat currencies.

Wallet
Just like with paper dollars you hold in your physical wallet, a bitcoin wallet is a digital wallet where you can store, send, and receive bitcoins securely. There are many varieties of wallets available, whether you’re looking for a web or mobile solution. Ideally, a bitcoin wallet will give you access to your public and private keys. This means that only you have rightful access to spend these bitcoins, whenever you choose to.

Source: blockchain.com, Wikipedia, QBT, Investopedia.com, vitiya99.medium.com, Coinmarketcap.com, Techopedia.com
© 2021 Quantum Blockchain Technologies Plc