“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 sam…”
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for circuits of such and larger sizes is a fundamental step to assess both the correctness, performance, and scaling behavior of quantum algorithms and the fidelities of quantum devices. However, resource requirements for such calculations on classical computers grow exponentially. We show that deferring tensor contractions can extend the boundaries of what can be computed on classical systems. To demonstrate this technique, we present results obtained from a calculation of the complete set of output amplitudes of a universal random circuit with depth 27 in a 2D lattice of $7 \times 7$ qubits, and an arbitrarily selected slice of $2^{37}$ amplitudes of a universal random circuit with depth 23 in a 2D lattice of $8 \times 7$ qubits. Combining our methodology with other decomposition approaches found in the literature, we show that we can simulate $7 \times 7$-qubit random circuits to arbitrary depth by leveraging secondary storage. These calculations were thought to be impossible due to resource requirements.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“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 clas…”
“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-qub…”
“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…”
- Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits ↗ingve · 2017-10-22 · 1 分
- Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits ↗rbanffy · 2017-10-23 · 3 分
- Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits [pdf] ↗vtomole · 2017-10-24 · 2 分