RSSAmplifier

Blog

Earl T. Campbell

Quantum wizardry, etcetera

earltcampbell.comRSS feed ↗10 posts

Latest posts

Posting elsewhere

I not posting here as much as I used to. But I am more active on the Riverlane website. Some of my post on the Riverlane site include: https://www.riverlane.com/news/introducing-the-world-s-first-low-latency-qec-experiment https://www.riverlane.com/blog/2024-s-qec-highlights-aka-the-12-days-of-qechristmas…

Quantifying quantum speedups

I just finished a fun collaboration arXiv2002.06181 on magic monotones, classical simulation and related results. The paper is pretty long (23+4) and we had to write a 3-page summary in order to submit to TQC conference. So if you want to get an overview or find out why you should read the full paper, our Continue reading Quantifying quantum speedups

The quantum ENIAC and Schrodinger’s glass

Language is wonderfully subtle. Two sentences can mean the same thing but leave the reader with completely different impressions. Everyone can appreciate that The glass is half empty and The glass is half full actually mean the same thing. Yet, they leave different impressions on the reader. Sabine Hossenfelder s recent Guardian column on quantum computation Continue reading The quantum ENIAC and…

Quantum dynamics goes Monte Carlo!

This post is a light summary of a project just published in Physical Review Letters. I am very pleased that this work got selected as an editor s suggestion and that the legendary Dominic Berry was commissioned to write a Physics view-point. His viewpoint really is a superb summary and you should go read it now, Continue reading Quantum dynamics goes Monte Carlo!

Are quantum computers more powerful than classical computers and the stabiliser rank story. (part 1)

Of course, quantum computers are more powerful than classical computers, but how do you prove it! Until recently there was not much known except for some oracle separation results. In 2017, we got the already infamous Bravyi-Gosset-Koenig result that proved quantum computers can solve some problems in constant time that for a classical computer require Continue reading Are quantum computers more…

Joint PhD position between Sheffield and Oxford

Circuit compilers for near-term quantum computers This position has been filled Summary: The number of elementary gates in a quantum computation determines the runtime of the quantum computer. It is clearly advantageous to have faster computations that use fewer gates and circuit compilation is the art of optimizing and automating this process. For near-term quantum Continue reading Joint PhD…

QEC ’19 call for submissions.

Hi folks, Here is a message from Dan about QEC 19. It is coming to the UK!!! Very excited and pleased to be helping out with chairing the programme. *** Dear colleagues, I’m pleased to announce that the 5th International Conference on Quantum Error Correction (QEC’19) is now open for the submission of contributed talks Continue reading QEC 19 call for submissions.

The folly of fidelity and how I learned to love randomness

If a quantum device would ideally prepare a state , but instead we prepare some other approximation state . Then how should the error be quantified? For many people, the gold standard is to use the fidelity. This is defined as One of the main goals of this blog post is to explain why the Continue reading The folly of fidelity and how I learned to love randomness

Explainer for topological quantum error correction

Explain topological quantum error correction in 2 minutes without too much jargon. Sure, we ll give it a go:

PhD applicant F.A.Q.

Many emails I get regarding PhD projects under my supervision often ask similar questions. To reduce the number of emails sent/received, I will address below the most common questions. When should I apply? Applications are best submitted in either late December or early January. Funding decisions regarding university studenships are typically made around February time Continue reading PhD…