fabiochiu/medium-articles huggingface dataset:
OXBTC — Top Level Cloud Mining Platform
Tags: Bitcoin, Oxbtc, Mining, Ethereum

OXBTC

OXBTC — Top Level Cloud Mining Platform

OXBTC was founded in 2014 and is headquartered in Shenzhen, China, OXBTC has been operating safely and stable for 5 years, supporting Chinese, English and Korean. OXBTC serves more than 600,000 users worldwide and issues a total of 29856.95BTC. We provide secure and reliable cloud mining services for 600,000 users in more than 50 countries.

There are 8 large farms in Kazakhstan, Venezuela, the United States, Sichuan, Guizhou, Inner Mongolia, and Xinjiang. The number of miners in operation reaches tens of thousands of units, which can realize 100,000 KW power supply capacity, which can provide strong support for hosting and operating miners. OXBTC aims to provide cloud mining services that are transparent, stable, good, and reliable for users.

Products

ETH-B3

Run by the PandaMiner B3 series, which is the most stable GPU mining machines. It is equipped with the AMD470 chip 4G memory, supports Ethash/Equihash/CryptoNightR and other algorithms, supports ETH/XMR/BEAM/GRIN, and more cryptocurrency mining.

BTC-S17

Run by Antminer S17 series, which owns the best power consumption. It is equipped with the second-generation 7nm chip BM1397, supports SHA256 algorithm, supports BTC，BCH, and other cryptocurrency mining.

BTC-T2T

Run by Whatsminer M21 series, which is equipped with Samsung 8nm chip, adopts the integrated design of miner and power supply, supports the SHA256 algorithm, supports BTC, BCH, and other cryptocurrency mining.

BTC-M21

Run by Innosilicon T2T series, Innosilicon T2T adopts the most advanced semiconductor technology and innovative dynamic frequency scaling architecture, supports the SHA256 algorithm, supports BTC, BCH, and other cryptocurrency mining.

Start Mining Now

First Offer: Get 2THS S17 Hashrate for 3 Days which is valued at $ 153

Hashrates will be sent three days after account registration and you can check profits in Cloud Mining — My Contract — S17 G — Check Profits: My Contract

Second Offer: Minimum 0.1THS, a Very Easy Start for New Miners

You can invest in OXBTC with a 0.1THS BTC-S17 hashrate for new users which is only $ 7.65. Buy now and get your first BTC now: Buy

Third Offer: Exclusive Discounts, 15% Discount on BTC / ETH Contracts.

Order now and enter the coupon code: OXBTC1, then you can enjoy a 15% discount or the equivalent of 0.00021764 BTC for the first order. A valid coupon date is 30 days.

OXBTC has provided reliable cloud mining services for 600,000 global customers for 5 years! And we will continue to provide the most competitive cloud mining products and better customer service in the future.

Sites official: OXBTC.COM
Volume Network Mining (UPDATE)
Tags: Volume Network, Blockchain, Hdd, github, Mining

How to mine $VOL

Volume Network is a coin which can be mined with HDDs, There are both POST and POS algortihms.

If you want to mine vol at first you have to open an account and wallet,from the webwallet of vol at http://www.volscan.io. It is the block explorer of $VOL and Volume Network blockchain at the same time.Dont forget to write down your 12 words mnemonic,it is also your password (Don’t tell it anyone).

After you create a wallet you will have your account id from volscan.io

Creating a $VOL at volscan.io.

At the below picture you will see your account id and vol mainnet address

To start mining $vol with your $vol wallet and account id you will need to plot your harddrive with the turboplotter. Turboplotter is a freeware and fastest plot program but if you want to plot more then 1 hdds each time you can buy it to the link of turboplotter https://blackpawn.com/tp/drop/TurboPlotter_0.10.1b.zip

Turboplotter screen

Write your account id and click ok

Configuration screen of Turboplotter

On the next screen the config page. It will be better to use a GPU to plot,a ssd to buffer and as much ram as you can use. Because while plotting, it will be faster if you use a GPU and ssd.It will take time to plot but at the end your hdd will be ready to mine. For the next hdd turboplotter has a config file and it can plot your second disk with fyour same account if you dont change your config file. And if it closes Turboplotter resumes plotting after you run it again

The next phase is miner configuration download the vol miner from official github of Volume Network:

https://github.com/volume-network/miner/releases/download/v0.1.5/vol-miner-v0.1.5.tar.gz

After that you you need to configure your config.yaml file :

It should look like this:

Account id is the number we get from vol wallet

Target_deadline is the number we get from pool

Plot_dirs are the paths to your plot files at your plotted hdds

Finaly url is the web address of the pool and port.The format of this file is very important you can use notepad++ to edit this file.

At this point your miner is configured,and to start mining there is just 1 more step and that is staking to a pool.

You need to stake 300 $VOL for 1 TB.For example if you want to mine with 20 TB of HDD.You need to stake at least 20*300=6000VOL to the desired pool.

My favourite pool is VOLPOOL, which is https://volscan.io/index.html#/mine-pool-node/12234865622293803287

Url and Wallet is below:

url: http://xjst.volnode.com:9125

wallet: VOL-DWAR-GRFR-J9BX-CTRLM

If you did everything well just run vol-miner-windows-opencl.exe and the miner will start to mine

You can use telegram to ask questions

https://t.me/VolumeNetworkTurkey
BHP to continue its global response to COVID-19
By: Daniel Weatherley
Tags: Bhp, Coronavirus, Covid 19, Mining, Bizclik Media

BHP, the Australian mining giant, has announced that it has no immediate plans to ease its response to the COVID-19 pandemic, keeping social distancing measures in place.

In recent weeks, the company has implemented social distancing measures, health screening, and hygiene accessibility, and continues to review new methods to help mitigate the impact of the coronavirus. BHP published a statement today addressing its stance on the virus, with quotes from Chief Executive Officer Mike Henry.

“Our priority remains to reduce the risk of transmission and to protect our workforce, their families and our communities. This will also enable us to keep the business safely running, supporting all those who rely on us.”

“We have worked closely with the communities where we operate to establish funding mechanisms and other support for health, wellbeing and resilience, to help protect the most vulnerable from infection, manage any potential outbreak and mitigate the broader impacts of this pandemic.”

The company reported a slight increase in the number of confirmed cases across its Chilean teams in recent weeks. Individuals affected were quickly evacuated safely, tested and placed into isolation with access to medical care. BHP’s attentive stance towards the virus has enabled it to continue operations safely, supporting both workers and the economy.

CEO Mike Henry added “All decisions related to easing restrictions at sites and in our offices will be based on targeted assessments of local risks, resources, needs and regulations, and with full consideration of the health and mental wellbeing of our people, their families and communities.”

Temperature checks, health assessments and self-isolation protocols are also being considered and implemented by BHP, along with a government-endorsed trial of molecular testing, which swabs the nose and throat. Results from this trial could see this method of testing implemented at airports and at some sites around the world.

SEE MORE:

Most office-based employees are working remotely, with locations in Lonon, Singapore and Melbourne, as BHP takes into account guidelines from different governments. Staff based in Houston and Santiago are slowly returning to work in reduced numbers.

Rio Tinto has also implemented a number of measures to mitigate the risk of the virus. A five-layer screening at airports for fly-in, fly-out workers will continue, whilst chief executive Jean-Sebastien Jacques said “As a company, we are going to have to learn to coexist with COVID-19 for an extended period of time. Our measures have been effective … and we will continue to implement measures.”

For more insights on mining topics — please take a look at the latest edition of Mining Global.

Follow us on LinkedIn and Twitter.
Quantum Computing — Our Optimized Future
By: Dhruv Jain
Tags: Computer Science, Quantum Computing, Future, Technology, Admiration

Quantum Computing — Our Optimized Future

In 1994, Peter Shor, a mathematician, developed a quantum algorithm to find prime factors of large numbers so efficiently that it is beyond the best classical algorithm present today.

Essentially both quantum and classical computers try to solve problems, but they use a different way to get the answers by manipulating the data. A standard computer uses digital bits of 0s and 1s, while quantum computers use qubits. A qubit can take any value between 0 and 1. A quantum computer has the power to solve problems that classical computers are not capable of by entangling the qubits. For example, a quantum computer can crack today’s most common security systems — such as 128-bit AES encryption — in seconds. It would take millions of years for a supercomputer to perform the same task.

The US NIST(National Institute of Standards and Technology) has claimed that it will be able to crack existing public-key infrastructure like 128-bit AES encryption by 2029. If this happens then it will make the businesses and governments improve their conventional network security using quantum-key cryptography. With every new innovation, the opportunity to make money is always there. According to HPCwire, the new market for quantum computing could be worth $830mn+ by 2024.

Google last year claimed that it has 53 superconducting qubits Sycamore processor that was able to verify a set of numbers was randomly distributed in just 200 seconds. It also claimed that if the processing would have been performed on IBM’s Summit machine, the most powerful supercomputer, it would have taken 10,000 years. This is a remarkable breakthrough in the quantum computing industry and paves the way forward. We can say that Google had reached a significant milestone towards realizing the immense promise of quantum computers.

If we take a look back in 1945, ENIAC — the first general-purpose digital computer — was released and it could do a task in 30 seconds that a human could do in 20 hours. We have come so far today that our super-advanced classical devices are no longer with vacuum tubes and vast sizes. The devices are compact, portable, and easy to use as today’s quantum computers will be from those in 50 years’ time.

I can’t wait to see the future of quantum computing. Are you excited?
Quantum Supremacy and Cryptography
By: James Birnie
Tags: Science, Cryptography, Quantum Computing, Quantum Cryptography, Quantum

The story broke around September 20th that Google was claiming quantum supremacy. It merited not much more than small footnotes in the popular press. It was enthusiastically received in the technology press which makes me think that it is time to start thinking about a world after RSA is dead.

In 1994 Peter Shor published his paper “Algorithms for quantum computation: discrete logarithms and factoring”. At the time quantum computers were nothing but a theoretical figment of many fertile imaginations. Fast forward to 2019, with Google claiming quantum supremacy, and we should be taking them very seriously indeed.

“Quantum supremacy” means (if verified) that Google has a real quantum computer that can solve a real world problem more efficiently than any classical (digital) computer. If their claim turns out to be true, the chances are that the cost of using this computer is astronomical and certainly beyond the means any individual or probably any corporation. But so were IMB’s machines in their early days.

What we experienced back in the early digital age was what we should expect to happen now. As soon as practical uses exist, money will pour in and improvements in the technology will be rapid, probably exponential. Given that most research (outside of secret government research) has been funded by financial institutions, it is a fairly safe bet that those same institutions will be racing one another to translate quantum supremacy into financial market supremacy.

So why should we be concerned about this and what does it have to do with encryption? Well, Shor’s algorithm factorises numbers. If you can factorise a product of two large prime numbers in reasonable time, you break RSA and related cyphers, which account for pretty much all of the messages in the world now. And that is exactly what Shor’s algorithm promises.

We are a few years away from a time with a powerful enough quantum computer to break current RSA keys but if quantum supremacy is proved, you can be sure that time is closer than you think. And don’t forget, your messages are probably being stored by several government agencies the world over right now. Your messages are definitely secure now, but if you care about your messages being secure 5 or 10 years from now you should be asking why we aren’t using quantum safe cryptography now.
Google Will Surpass Supercomputing With New Quantum Computer
By: Jamie Adams
Tags: Market Bites, Google, Science, Quantum Computing, Alphabet

Google Will Surpass Supercomputing With New Quantum Computer

The latest news coming out of Alphabet’s Google is that its scientists have found a way to make quantum computing an everyday reality, with its latest quantum computer achieving ‘quantum supremacy’. Jamie Adams Sep 23, 2019·2 min read

The latest financial news and analysis from MyWallSt. Check out our stock market analysis or learn how to get started investing now

Photo by Markus Spiske on Unsplash

What is quantum computing? Well, Google (NASDAQ: GOOGL) may just make it available to all of us in the not-so-distant future, with its recently developed “Sycamore”, a 53-qubit quantum computer.

If you have ever seen Marvel’s ‘Ant-Man’ films, then you will probably have a very basic but somewhat misaligned idea of what quantum theory is. For those who are not fans of Paul Rudd’s superhero flick, then the simple answer is this:

‘Quantum theory explains the nature and behavior of energy and matter on the quantum (atomic and subatomic) level.”

Still with us?

Quantum computing works on this principle, and in theory would enormously increase a computer’s processing power, allow it to be in multiple states, and perform every task at-hand using all possible permutations simultaneously.

Find out Who Is Alphabet’s New CEO?

According to Google, its new Sycamore computer had the ability to solve complex mathematical equations in 200 seconds, whereas the same problem would take a supercomputer approximately 10,000 years to work out. Such a breakthrough would have a huge impact on Google’s AI driven initiatives which include both Cloud computing and Healthcare.

With the company in the crosshairs of antitrust regulators for potential breaches of data privacy and anti-competitive practices, the latest Google news has been clouded in much controversy and distrust, with calls in recent months for a break-up of Big Tech.

Find out why did Apple’s stock drop?

Google parent company Alphabet’s latest stock price has remained relatively flat following the news of this quantum breakthrough. However, if an official, peer-reviewed reveal of a new quantum computer should be made in the near-future, investors will surely need to keep an eye on Google’s stock prices.
Is a Quantum Computer Dangerous for Bitcoin?
Tags: Blockchain, Quantum Computing, Bitcoin, Science

Is a quantum computer dangerous for Bitcoin?

Many researchers say that in less than 10 years computing machines using quantum principles will threaten blockchain technology which is a basis for cryptocurrencies.

Bicoin and similar systems’ defense algorithm is based on a principle of asymmetric encryption with and open and private keys. Transaction is signed by a private key, and its truth is checked with a help of an open key.

Despite the fact that Bitcoin blockchain uses asymmetric encryption, the users don’t have to worry for the safety of their coins. The open key is not stored openly. Thus, the addresses for coins transferring are not open keys, but just the results of usage of hash-function SHA-256. The hashing function performs one-sided transformation and that’s why it’s stable against quantum computer attacks.

The public key is rendered to the network in the open way just until it receives a confirmation. If an attacker receives an open key during transaction, he will have around 10 minutes to get the private key with the help of a quantum computer and try to make his own transaction from the same address but specifying a larger commission.

By the way, bitcoin mining is also relevantly safe, as the equipment for mining cryptocurrencies in the near future will be more powerful that quantum computers.

It is worth to note, that quantum calculations threaten absolutely all systems of computer security which care based on cryptography with an open key, and not only blockchain. Internet connections to render your password in Internet banking uses a similar encryption technology, same as communication in chatrooms, social networks and lots of other routine actions.

All security systems, including blockchain systems, need to take into account postquantum encryption to ensure data safety. But the most simple and effective way can be changing traditional systems by such blockchain which implements quantum-resistant cryptography.

There are several different ways of encryption with open key resistant to quantum calculations: bases on matrix, on code, multidimensional quadratic functions, and hashing function. But let us not digress into detail math stories.

The main point is that if there is a serious thereat to blockchain posed by quantum computer, developers can improve the protection. Moreover, successful research and developments in this regards are being done not for the first year.

What do you think, who will be the first in this race — bitcoin developers or quantum computer developers?
Will Quantum Computer Keep Up With Moore’s Law
By: Tom Healey
Tags: Future Technology, Computer Science, Progress, Quantum Computing, Computers

Although transistors can’t get smaller, computers can get larger. Although not practical, large powerful computers can be useful. This can be for huge projects, shown by NASA supercomputers.

On the other hand, computers must still progress for everyday use. To do this, innovative ideas must be conjured and created. This could allow people across the world to have a better quality of life. In 1998 an innovative, quantum computer was made for the first time. This has become enhanced since then, proving to be much more powerful.

The key difference with a quantum computer is how the bits work. As said transistors either allow electrons to pass or block them. Depending on the function it performs, the information is given as, 1 or 0. This called a bit. In numbers, this information from transistors can form logic gates e.g AND, OR. These logic gates in numbers can perform basic functions.

In normal computers, bits can be set to one of two values. However, in quantum computers, qubits take bits place. These can be in any proportion of both states (0 and 1) at once. This is called superposition. The problem is once observed the qubit must pick one of either value.

4 classical bits can be in 1 of ²⁴ combinations at a time. However, for qubits, they can exist as all of these values, at once. This is because each qubit can be both 1 and 0. This grows exponentially as the number of qubits grows. At 20 of them, they can already store 1 million values in parallel. Google’s quantum computer has 53 qubits. This means it can do ²⁵³ combinations at a time. For the worlds best supercomputer a difficult calculation could take 10,000 years. Whilst this quantum computer can do it in 200 seconds.

Quantum Computer

The only setback of these computers is their price and size. These computers take billions to make and are very large. This means we still have a long way to go for quantum computers to progress. This could be only available to large companies. Or if they progress enough could become commercial. This could make seemingly impossible everyday things possible.

In conclusion, Moore’s Law may temporarily stunt computing progress. This would mean our steep improvement in the last few years may plateau. However, this does not mean the end of our progress. Innovative computers, e.g. quantum computers, could break through this plateau. These can allow for unprecedented levels of power. Being able to perform huge numbers of logical decision and arithmetic calculations. These could create solutions to huge modern problems. This could be medical, economics or communication-related. The number of qubits in quantum computers begin to increase more rapidly. This could defeat Moore’s Law’s plateau entirely.

To see how useful innovation can be, go to buysmartbuycheap.com
The Equinox
By: Ilexa Yardley
Tags: Astrology, Mathematics, Quantum Physics, Quantum Computing

How it explains both mathematics and astrology… physics and psychology…

Photo by Jakub Kriz on Unsplash

Mathematics

Everything in mathematics is based on two core principles: similarity and complementarity.

That is X and Y is X and X (similarity). And, X and X is X and X’ (complementarity).

Everything else is superfluous (redundant).

X and Y

X and X

X and X’

Astrology

This explains why, if you were born on an equinox, you were conceived on a solstice. And if you were born on a solstice, you were conceived on an equinox.

That is, equinox and solstice, like any X and Y, articulate, and must conserve, an uber-simple circle.

This explains everything in astrology.

Equinox and Solstice

The Numbers: One and Two

So the equinox articulates the number ‘two’ and the solstice articulates the number ‘one.’

Explaining why mathematics (and astrology) can only ‘work’ (be valid) half-the-time.

This is because everything is valid (true) half-the-time.

One and One

One and Two

Relativity

This means if you are on the equinox (half-way-point) on a circumference, you are directly opposed to the solstice (the alternate half-way-point) on a circumference.

That is, the equinox divides the circle into ‘two.’ As does the solstice.

Therefore, the equinox and solstice form a square (two squares to be exact). Proving to square a circle (or circle a square) you just have to say ‘the square is a circle.’ Meaning it is impossible to have a square without a circle, and, always vice versa (despite what you are taught in school).

Square and Circle

Square

Circle

Circularity

This is because relativity is an alternate word for circularity (and, again, always, vice versa).

Because, underneath it all, X and Y (X and X) (X and X’) are 0 and 1. Circumference and diameter. Of an always-conserved (always present) uber-simple ‘circle.’

Circumference and Diameter

Thus, Conservation of the Circle is the most important (core) (only) (obvious) (essential) (realistic) dynamic in Nature.
CoreDump: Stewie has Dark Computing….
By: Anil Kumar B
Tags: Axions, Coredump, Dark Cloud, Quantum Computing

Welcome to CoreDump, the one stop for techies…., in today's episode, Stewie and Brian, invent a dark matter computer cloud called the Dark Cloud…

Lisa: Susie was just here, she overheard you talk about the dark cloud, she wants to know if it will rain now, she thinks the dark cloud is a huge black rain bearing cloud!

Calvin: Sissy Girls are like that,

Hobbes: It is time for Stewie and Brian to materialize with their space-time pod, here they are.

Stewie: I just added the last screw to my dark cloud rack, it is the best node yet, hidden behind the dark screen effect! Nobody can find it.

Brian: Truly the ‘Dark Cloud’.

Lisa: It is all based on Axions and their interactions with photons and electrons!

Here is a Feynman Diagram for the interaction…

Stewie created qubit based computing gates called dark gates, he made several such gates with axion, to photon conversion and axion — electron interactions. Actually it is wave transfer theory, much like spin torque, we have newer theories, by Stewie on hidden dimensions of dark matter and surface evidence in axions and other gauge resonances, a newer class of energy resonances…..

Calvin: Isn’t all this just semantics, namespaces for resonances we can perceive by extending our senses, using elaborate electronics and optics?

Brian: More or less what I thought?

Stewie: But we have actually proven computing, and can build reconfigurable gates and circuits, the dark cloud, an invisible cloud!
Quantum Computing with Quantum Optical Teleportation
Tags: Quantum Teleportation, Quantum Computing

We have enter in the era of Quantum Technologies with great capabilities of emerging. The global race of building quantum computer is going on. Corporations and governments are doing investments in science and engineering research for quantum computers, quantum communications systems, and other quantum technologies. Everyone one is trying to achieve quantum supremacy.

This first quantum revolution exploited physical characteristics of semiconductor materials. Now, the emerging second quantum revolution is engineering radically new machines that exploit information theory and computer science. By engineering quantum mechanics in novel ways, quantum computers can perform calculations much faster than any conventional machine, and allow for perfectly secure communications.

Quantum optical teleportation is now revolutionizing the development of quantum computers.

Quantum teleportation is the transfer of quantum of information completely which is impossible by conventional means. In conventional communication systems, however copying is possible in classical methods but in quantum mechanics it is prohibited. The only way in quantum physics is that to transfer the quantum of input information physically by means of disappearing it from the sender’s side and reappearing at the receiver’s side. This is the nature of quantum teleportation. For quantum teleportation, we need quantum entanglement, which is the superposition of all possible states where the work on one side effects on the other side specially when they are separated no matter how far they are. Quantum entanglement is called spooky by Albert Einstein and we use this “spooky” action for quantum teleportation.

For large-scale quantum computing, we use a class of multipartite entangled states, called “cluster states”. The cluster state is a superposition of all possible quantum computing patterns. We can select a desired quantum computing pattern by using measurements. Similar to quantum teleportation, we can eliminate the randomness of measurement results by using “feed-forward” control. In that sense, large-scale quantum computing can be regarded as sequential quantum teleportation.

Scientists have already succeeded in creation of such cluster states for large-scale quantum computing in our laboratory in Tokyo.

References:
Complex numbers for QC
By: Rahulp Cs
Tags: Computer Science, Quantum Mechanics, Quantum Computing, Mathematics

I am assuming that you are familiar with basic Trignometry and concepts of vectors .I will also assume that you are familiar with basics of complex no.

so we are going to start with euler representation of complex no. using complex exponentials.

We know that complex no. exist in a plane called the complex plane that is made of a real axis and an imaginary axis which are orthogonal to each other. just like a unit vector for some direction like the i(hat) being the basis vector for x direction we are going to introduce a similar ides for representing complex no.

lets consider a unit circle in the complex plane with centre as the origin. lets consider a point on that circle , let the line connecting the point and centre make an angle of ψ with positive direction of real axis, now the x and y coordinates of the point can be given by cos(ψ) and sin(ψ) respectively.

complex no. z is written in cartesian coordinates as x+iy. in polar coordinates z can be written as cos(ψ)+isin(ψ) for any z on the unit circle. this cos(ψ)+isin(ψ) can be considered as a basis for any complex no. on the straight line with slope tan(ψ). so just like for vectors which ae written as mangnitude times the basis , any general complex no. z can be written as |z| times cos(ψ)+isin(ψ) with ψ being in the range of [0,2*pi).

now how do we go from the trignometric formula to the euler formula of complex exponential for the basis?

We are going to use the Taylor series for e^x ,cos(x),sin(x) . The proof of these expansions is not within the scope of this article , nor is it important for the progress of this course, we may cover this in a miscellaneous article later on.

the expansions are :cos x = 1 — x²/2! + x⁴/4! — x⁶/6! +….

sin x= x—x³/3! + x⁵/5! — x⁷/7! + ….

isinx=i(x — x³/3! + x⁵/5! — x⁷/7! + ….)

e^x = 1+ x + x²/2! + x³/3! + x⁴/4! + ….

e^ix=1+(ix)+(ix)²/2!+(ix)³/3!+(ix)⁴/4!+(ix)⁵/5!+(ix)⁶/6!+(ix)⁷/7!+….

=(1—x²/2!+x⁴/4! — x⁶/6!+….)+i(x — x³/3! + x⁵/5! — x⁷/7! + ….)

=cosx+isinx.

now that the euler formula is proved ,euler identity would follow.

Alright I will see you in the next lecture.
Faculty Positions in Quantum Computing, Center on Frontiers of Computing Studies, Peking University
By: Center On Frontiers Of Computing Studies
Tags: Faculty, Program, Hiring, Quantum Computing

The Center on Frontiers of Computing Studies (CFCS) of Peking University is committed to building a world-class quantum computing program and invites applications for multiple tenured-track, tenured, and visiting faculty positions. We seek exceptional candidates at all levels from all areas of quantum computing, with an emphasis on areas critical to the realization of quantum computers. We aim to build an interdisciplinary and collaborative faculty team covering experimental superconducting quantum computing (SQC), SQC device theory, quantum error correction, and quantum architecture. The positions may be joint with a secondary appointment in another department such as EECS, Physics, and Mathematics.

Successful candidates will have a relevant doctorate, an outstanding, impactful research record, and a strong commitment to fundamental, pioneering research, as well as to both undergraduate and graduate teaching. Candidates with industrial quantum computing research experiences are also encouraged to apply. The visiting positions are for hosting academic leaves of senior researchers and the continuing training of more junior researchers. CFCS is committed to the mentoring of junior faculty toward a successful academic career, and has developed an extensive mentorship program, especially in quantum computing.

CFCS is a university new initiative co-founded by Professors John Hopcroft (Turing Awardee) and Wen Gao (CAE, ACM/IEEE Fellow). The center aims at developing the excellence on two fronts: research and education. On the research front, the center will provide a world-class research environment, where innovation and impactful research is the central aim, measured by professional reputation among world scholars, not by counting the number of publications and research funding. On the education front, the center deeply involves in the Turing Class, an elite undergraduate program that draws the cream of the crop from the PKU undergraduate talent pool. New curriculum and pedagogy are designed and practiced in this program, with the aim to cultivate a new generation of computer scientist/engineers that are solid in both theories and practices.

Salary and Benefits

All newly hired faculty members will be provided with necessary startup resource and research infrastructures. Salaries and benefits are internationally competitive and are to be individually negotiated in each case, commensurate with the candidate’s academic credentials.

To Apply:

Applicants should send a full curriculum vitae; copies of 3–5 key publications; 3–5 names and contact information of references; and a statement of research and teaching to: CFCS_recruiting[at]pku[dot]edu[dot]cn . To expedite the process, please arrange to have the reference letters sent directly to the above email address.

— —

Applications will be reviewed continuously and will be accepted until the positions are filled.
Will Quantum Computing break Encryption?
By: Atharva Barve
Tags: Quantum Computer, Quantum Supremacy, Quantum Computing

Recently Google announced to have achieved Quantum Supremacy.

But what Quantum Supremacy really means?

Quantum Supremacy in simple words can be defined as successfully solving a difficult mathematical problem like prime factorization of exceptionally large numbers in seconds, which the supercomputer would take decades.

So what really a Quantum Computer is?

A Quantum Computer is completely different from Classical Computers and they have changed the overall dimensions of the game we were playing with Classical Computers. Classical Computers used bits which can either 0 or 1, but the rules for Quantum Computing are completely different which gives them a strong edge. First of all, they are based on the laws of Quantum Physics, which is harder than Rocket science.

They have Qubits which can exist in 0 or 1 state at the same time (Qubits are in Superposition with both the states) until they are measured. This is pretty hard to believe as in how it is working, but don’t worry no one knows how they work.

Coming to today's Encryption Technology.

Talking about today's encryption standards then broadly we have two types of Encryption schemes that are Symmetric encryption(have the same key for encryption and decrypting the message) and Asymmetric encryption(have a pair of keys for encryption and decrypting of the message). But the foundation mathematics of the encryption algorithms is such that the cost and time involved in breaking the encryption code are exceptionally more using classical computation technologies.

Turning Point…

But here comes the Quantum Computer into the picture which can not only solve the mathematically intensive problems in linear time in which the classical computers took exponential time. The major cryptography standards use large prime numbers and their product to generate Public key and the Private key, and this can be broken in the near future by Quantum Computer using the laws of Quantum Mechanics.

Till now there are no successful attempts in doing so, as the number of Qubits in a Quantum Computer is still less than 100(IBM has the highest i.e 53), but we can't forget Moore’s Law, there could be the same or even exponential pace of increase in Qubits in a Quantum Computer and it is now far enough from now that we would have to change the entire Cryptography standards.

Too much of Quantum for this blog, in the next blogs we will go into the details of the working of Quantum Computer, Shor’s Algorithm(can factorize prime numbers in linear time), etc. Till then stay tuned…
Introduction to Quantum Computing
By: Amulya Reddy Konda
Tags: Quantum Circuits, Quantum Gates, Aer, Quantum Computing, IBM

Introduction to Quantum Computing

Applications

Game design

Quantum Chemistry to calculate bond lengths between atoms

Setup

pip install qiskit

Get IBM token from quantum-computing.ibm.com

Coding

from qiskit import * qr = QuantumRegister(2)

cr = ClassicalRegister(2) circuit = QuantumCircuit(qr,cr)

circuit.draw()

To build entanglements, we need gates… Hadamard gates.

circuit = circuit.h(qr[0])

circuit.draw(output='mp1')

Controlled X like logical if. Say here control is qr[0] and the target is qr[1]

circuit.cx(qr[0],qr[1])

Measure the qubits, take those bits and store in classical bits

circuit.measure(qr,cr) #qr=>cr

Simulate the circuit locally using Aer

simulator = Aer.simulate('qasm-simulator')

Execute the circuit which returns results

result = execute(circuit,backend=simulator).result()

Visualize

from qiskit.tools.visualization import plot_histogram

plot_histogram(result.get_counts(circuit))

Place on Quantum Computer and test

from qiskit import IBMQ IBMQ.save('...') IBMQ.load_account() provider = IBMQ.get_provider('ibm-q') qcomp = provider.get_backend('ibmq_16_melbourne') job = execute(circuit,backend=qcomp)

The job is placed on Qcomp but it doesn't execute immediately. Others might be using the same Qcomp, so it may take time to return. We can monitor the job by job_monitor

from qiskit.tools.monitor import job_monitor job_monitor(job) result = job.result()

Different ways people discuss the quantum state:

Bracket representation — state vector simulator Gates can be represented as matrices and operations on it are operations on vectors — unitary simulator Bloch sphere (visual representation of state) — state vector simulator How circuit works as a result of measurement — qasm simulator

bracket and matrix representations

[1 0] is state 0> [0 1] is state 1> [0 1, 1 0] is state of X

Gates: https://quantum-computing.ibm.com/docs/circ-comp/q-gates

Quantum Algorithms

Quantum Teleportation:

When we want to copy one qbit info to another, simple copy results in change measurement destroy the state. We take help of entanglement for quantum teleportation.

Bernstein Vazirani Algorithm:

Quantum computer can guess a secret number of n bits in one shot which takes n shots in classical computer.
Quantum AI in the 2020s and Beyond: What IBM Is Doing
By: Rtinsights Team
Tags: AI, Quantum Computing, IBM

Quantum AI in the 2020s and Beyond: What IBM Is Doing

The most important investments that IBM is making in quantum AI is to build out its developer and partner ecosystem and to provide them with sophisticated tools, libraries, and cloud services.

Quantum computing promises to accelerate artificial intelligence (AI) faster than the speed of light. But first, this futuristic technology must prove its worth as an alternative to more mature, traditional approaches to process data-driven statistical algorithms.

Achieving quantum advantage for AI apps

IBM continues to take a leadership position in quantum computing. Among other efforts, it is evangelizing quantum computing to developers of AI, deep learning, and machine learning applications.

Quantum computing might be capable, in its current form, of performing feats that are practically impossible for computers built on traditional von Neumann architectures. However, that has not been proven, and IBM isn’t making this claim, often known as “quantum supremacy,” pertaining to its own quantum R&D efforts.

In fact, IBM has taken a practical approach that keeps expectations for the technology’s prowess in check. It has also been in the vanguard of debunking claims of this nature by other tech vendors. A recent case in point was Google’s claim in fall 2019 that Sycamore, its 53-qubit quantum hardware platform, had completed a calculation in a few minutes that would have taken 10,000 for the world’s most powerful existing supercomputer, IBM Summit.

Google’s benchmark didn’t fall into any of the core use cases-including AI, optimization, simulation, or even cryptography-for which quantum computing might some day hold an advantage over classical architectures. The proof of the pudding for AI is whether a computer built on quantum principles can do data-driven algorithmic inferencing faster than a classical computer, or optimistically, faster than the fastest supercomputers currently in existence.

Continue reading at https://www.rtinsights.com.
“Quantum Supremacy”
By: Amelie Schreiber
Tags: Quantum Computing, Python, Programming, The Singularity Research, Machine Learning

“Quantum Supremacy”

In this article, we are going to take a very sober and balanced look at the idea of “quantum supremacy” and what we can expect from quantum computing in the near future in terms of performance compared to classical computers. A huge part of finding applications of quantum computing moving forward will be comparing quantum methods to well studied classical methods that have decades of empirical evidence to support them. In many cases there are heuristic classical algorithms developed for various special cases of problems which will outperform quantum methods. However, there are also cases where quantum methods may outperform classical methods, and deciding which cases will be appropriate for quantum methods versus classical methods is a highly non-trivial problem.

Furthermore, in some cases a minor improvement in the performance may not be worth the resources used when applying one method over the other. Perhaps the problem is more accurately solved by a classical algorithm, but the quantum algorithm may be more efficient and may take fewer resources. Perhaps in another problem, the exact opposite is true. In some cases, the cost of resources may mean sacrificing accuracy, and in other cases accuracy may be of utmost importance, for example when human lives and health are involved. It may require more resources to solve the problem using one method, but perhaps the improvement in performance means predicting cancer risk at a rate several percentage points higher translating into thousands or even millions of lives being saved.

Photo by Michael Dziedzic on Unsplash

Approaching the problem of when to use quantum computing is, just like with other methods, an ongoing question with an answer that changes over time based on what resources are available, what question is being asked, what other methods are available, how important accuracy is, and how important the resources we have available are. Addressing this question in terms of effectiveness of the method are addressed in the following paper:

To quantum or not to quantum: towards algorithm selection in near-term quantum optimization

For a great short podcast on the real depth and complexity of defining how important and significant quantum supremacy is, see the MIT technology review article on The Google-IBM “quantum supremacy” feud. We will discuss this “feud” a little more below after a short video by Google on their claims of “quantum supremacy”.
The Most Basic ‘String’ (Vibration) (Fluctuation) (Wave)
By: Ilexa Yardley
Tags: Mathematics, Circular Theory, Quantum Computing, Deep Learning, Quantum Mechanics

If zero, then one. (Meaning, if one, then, zero).

Photo by Juan Sisinni on Unsplash

In mathematics, in ‘string’ theory, we have an open and a closed ‘string.’

Open and Closed

Which is an ‘other’ way of saying we have a ‘zero’ and a ‘one.’

Zero and One

So, an intelligent observer should ask, where does the ‘zero’ and ‘one’ come from?

If zero, then one, means, if one, then zero. Which defines the most basic ‘string.’ (Neither zero nor one; both zero and one; zero and-or one; zero is one.)

This is proven, easily, by the abstraction: if circumference then diameter (meaning if diameter then circumference). This gives us the basis for ‘conditionality,’ and ‘similarity,’ explaining how ancient people were able to ‘build the pyramids.’

If zero, then one (if one, then zero).

That is, it’s basic math, which leads to basic physics, that the most basic string, is a self-referential recursion (quantum entanglement) called (the conservation of) a(n) (uber-basic) circle.

Conservation of the CIrcle

Explaining fluctuations, vibrations, and waves. Sometimes thought of as ‘quantum foam.’

Fluctuation. Vibration. Wave

Self-Referential Recursion (Quantum Entanglement)

Meaning, the circular relationship between circumference and diameter, produces the linear relationship between diameter and circumference. Explaining both repetition (reproduction) and sequence (reproduction). Basic ‘movement.’ Motion, in general. The (circular) (linear) relationship between general and specific (any X and Y).

Reproduction (General and Specific) (Repetition and Sequence)

Where zero is half-the-time one. Meaning zero is all-the-time one. Because it is impossible to have a half without a whole. A zero without a one. A circle without a line.

Conservation of the Circle explains the circular relationship between ‘beginning’ and ‘end.’ Before and after. Open and closed. Zero and one.

Quantum Foam (Before and After)

Meaning, technically, no such thing as ‘quantum foam.’

The circular-linear relationship between background and foreground means pi does not separate 0 from 1, even though an observer is forced to separate 0 and 1 (because pi is the only observer) (you have to use the diagram if you want to understand what’s going on) (pi is both zero and one).

Zero

One

See, also, Circular Theory: Universal Behavior | by Ilexa Yardley | The Circular Theory | Medium

How to ‘solve’ this ? superposition — The Circular Theory — Medium

More in depth: The Josephson Junction. How we will achieve QIS. The… | by Ilexa Yardley | The Circular Theory | Mar, 2021 | Medium
OpenAI Codex “Speaks” Qiskit
By: Iskandar Sitdikov
Tags: Neural Networks, Open Source, Codex, Quantum Computing, Qiskit

Did you notice that we never told Codex to use Qiskit specifically, but it still knew it was supposed to write Qiskit code? This was unexpected for me at first, but actually made total sense. Qiskit is Codex’s quanutm framework of choice because we produce a lot of open-source Qiskit content, tutorials, and examples of how to implement different quantum algorithms and procedures.

Overall Codex is more than impressive when it comes to programming quantum computers. Of course, you have to play around with parameters and formulation of docstrings to make most out of the system. And, as it’s still in beta, the output programs are not always correct. But the target usecase for Codex and Copilot is to act as an assistant for developers to writing code. This demonstration shows that Codex can already serve as an assistant to quantum programmers using Qiskit.

This blog post came from just my first hour of playing around with Codex for quantum computing. I think there’s a lot more to explore, and encourage you to play around with it, too.

Want to read more stories like this? Then subscribe to the Qiskit Medium!