Share Your Experience: Take the 2024 Developer Survey

# Tag Info

### What exactly is "Random Circuit Sampling"?

There are a continuous set of possible states for $n$ qubits, each of which can be expressed as a superposition of the $2^n$ basis states. Mostly of these states are highly entangled, and would ...
• 11.3k

### Sampling random circuits vs Solovay-Kitaev compiler

The Solovay-Kitaev algorithm is not practical. It is very useful theoretically because it proves that once you have a "dense" set of quantum gates (i.e. a set with which you can approximate any other ...
• 4,987
Accepted

### Understanding Google's “Quantum supremacy using a programmable superconducting processor” (Part 3): sampling

What does "obtaining samples" mean in this context? The same thing it means in a more classical context. Consider the probability distribution of the possible outcomes of a (possibly biased) coin ...
• 25.2k
Accepted

### Understanding Google's “Quantum supremacy using a programmable superconducting processor” (Part 2): simplifiable and intractable tilings

TL/DR: The two-qubit gates are going by the moniker "Sycamore gates" in the paper, and it appears that they would ideally want to explore more of the $(\phi, \theta)$ phase-space but for ...
• 12.5k
Accepted

### Multiplication by a Haar random unitary two times

There is an explicit formula for the integral with respect to the Haar measure of any polynomial in the entries of a unitary and its conjugate, due to Collins and Śniady: Benoît Collins and Piotr ...
• 6,097

### Help Identifying a Gate In Nielsen and Chuang

Here are the corresponding decompositions of each gate with use of Toffoli and $X$ gates: The first one applies $X$ gate on the third qubit if control qubits are in the $|00\rangle$ state. The second ...
• 4,341
Accepted

### What is the HOG test and how would it help proving quantum supremacy?

There are a couple variants of the HOG test. "Old HOG" computed the proportion of unique samples whose probability is larger than the median probability of the distribution. It then compares that ...
• 37.5k
Accepted

### Computing expectation value of $|\langle z|C|0^n\rangle|^2$ over Haar random circuit

The issue that easily leads to confusion is the dual role played by output bitstring probability. It enters the computation of the average in two ways. On one hand, it determines how often one sees ...
• 22.9k
Accepted

### Compute the large $n$ distribution of $|\langle z_i|\psi\rangle|^2$ over Haar random quantum states

In the following, I'll show the evaluation of the probability densities of the transition probabilities: $|\langle \psi | z\rangle^2$ and their pairwise independence. I didn't work out the full mutual ...
• 2,575
Accepted

### Randomness using simple parallel Hadamard circuit

The issue is that you are using noisy hardware with imperfect operations and measurements. In particular, the most likely problem here is that after you prepare a qubit it immediately begins decaying ...
• 37.5k
Accepted

### Random circuits with google cirq

Cirq does have some methods for generating random circuits, such as cirq.testing.random_circuit and cirq.random_rotations_between_grid_interaction_layers_circuit. That being said, in my experience, ...
• 37.5k
Accepted

### Understanding Google's “Quantum supremacy using a programmable superconducting processor” (Part 1): choice of gate set

While a follow-up question asks for the motivation behind the two-qubit gates used in Sycamore, this question focuses on the random nature of the single qubit operations used in Sycamore, that is, the ...
• 12.5k
Accepted

### How exactly is solving the random circuit sampling problem a computation in the Church-Turing thesis sense?

The Church-Turing thesis is not in and of itself a rigorous concept, but rather a judgment on rigorous concepts of computability. As such, it's negotiable. The language in Rosser's 1939 expository ...
• 1,436
Accepted

### How does successfully sampling from a random quantum circuit invalidate the Extended Church-Turing Thesis?

A computational task doesn't have to have or be an application in order to be part of a valid model. If you claim that you can run a mile faster than I can, your four-minute mile doesn't have to be ...
• 1,436
Accepted

### What did exactly Google do in simulating a random quantum circuit on a classical computer in supremacy experiment?

All quantum circuits can be simulated on a classical computer, but not all circuits take the same amount of time to simulate. If information about the circuit is known in advance, certain patterns may ...
• 121
Accepted

### How to make circuit for randomly selected gate?

This is very similar to an function in terra random_circuit: https://github.com/Qiskit/qiskit-terra/blob/master/qiskit/circuit/random/utils.py#L30-L113 It randomly ...
• 1,617
Accepted

• 5,027
Accepted

• 12.5k