Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral · HackerPapers discussions

Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral — mentioned by comicjk

Fri, 10 Nov 2017 20:42:46 GMT

Quantum computers can be simulated classically, in a timeframe exponentially related to the number of qubits. So as long as the quantum computer is not too big you can compare the results to an exact classical simulation and see if it works. The current record for classical simulation is 56 qubits (https://arxiv.org/abs/1710.05867). This is an active area of research, since we want to be able to check the early-generation quantum computers carefully.

Paper and discussion history. A mention is not an endorsement.

Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral — mentioned by jameshclark

Fri, 10 Nov 2017 18:46:34 GMT

The last news from IBM on HN about their quantum offering was that they had optimised the memory required for simulating quantum computers. 50-qubits seemed to the the upper limit before, but they managed to simulate a 56-qubit circuit. It was a good read: https://arxiv.org/abs/1710.05867 They've had real hardware for a while, though, and they have 5-qubit and 16-qubit machines that anyone can try via IBM Q experience. So this is 100% legit as far as I'm concerned.

Paper and discussion history. A mention is not an endorsement.

Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral — mentioned by _rpd

Tue, 24 Oct 2017 15:57:21 GMT

From the paper ... > With the current rate of progress in quantum computing technologies, 50-qubit systems will soon become a reality. To assess, refine and advance the design and control of these devices, one needs a means to test and evaluate their fidelity. https://arxiv.org/abs/1710.05867 It is for testing new quantum computers. We can now use classical computers to simulate larger ( > 49-qubit ) quantum computers. Previously ... > Such calculations were previously thought to be impossible due to impracticable memory requirements.

Paper and discussion history. A mention is not an endorsement.

Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral — mentioned by Strilanc

Tue, 24 Oct 2017 12:54:11 GMT

The work is about simulating wide-but-shallow quantum circuits (e.g. 49 qubits with 27 layers of operations, or 56 qubits x 23 layers [edit: HN title much better now]). The article entirely fails to mention the depth restriction. (The paper is very upfront about it: [1].) Personally, I happen to agree with Scott Aaronson's take [2]: > The goal, with sampling-based quantum supremacy, was always to target the “sweet spot,” which we estimated at around 50 qubits, where classical simulation is still possible, but it’s clearly orders of magnitude more expensive than doing the experiment itself. If…

Paper and discussion history. A mention is not an endorsement.

Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral — HN submission

Tue, 24 Oct 2017 01:15:34 GMT

Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits [pdf]

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral — HN submission

Mon, 23 Oct 2017 09:05:28 GMT

Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral — HN submission

Sun, 22 Oct 2017 20:42:59 GMT

Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.