Related papers: Quantum Instruction Set Design for Performance

Quantum Instruction Set Design for Performance

URL: http://arxiv.org/abs/2105.06074v3
Date: Tue, 28 Jun 2022 20:24:40 GMT
Title: Quantum Instruction Set Design for Performance
Authors: Cupjin Huang, Tenghui Wang, Feng Wu, Dawei Ding, Qi Ye, Linghang Kong, Fang Zhang, Xiaotong Ni, Zhijun Song, Yaoyun Shi, Hui-Hai Zhao, Chunqing Deng, Jianxin Chen
Abstract summary: A quantum instruction set is where quantum hardware and software meet. We develop new characterization and compilation techniques for non-Clifford gates to accurately evaluate different quantum instruction set designs.
Score: 30.049549820997996
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: A quantum instruction set is where quantum hardware and software meet. We develop new characterization and compilation techniques for non-Clifford gates to accurately evaluate different quantum instruction set designs. We specifically apply them to our fluxonium processor that supports mainstream instruction $\mathrm{iSWAP}$ by calibrating and characterizing its square root $\mathrm{SQiSW}$. We measure a gate fidelity of up to $99.72\%$ with an average of $99.31\%$ and realize Haar random two-qubit gates using $\mathrm{SQiSW}$ with an average fidelity of $96.38\%$. This is an average error reduction of $41\%$ for the former and a $50\%$ reduction for the latter compared to using $\mathrm{iSWAP}$ on the same processor. This shows designing the quantum instruction set consisting of $\mathrm{SQiSW}$ and single-qubit gates on such platforms leads to a performance boost at almost no cost.

Related papers

Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
arXiv Detail & Related papers (2024-11-06T22:51:27Z)
Rank Is All You Need: Estimating the Trace of Powers of Density Matrices [1.5133368155322298]
Estimating the trace of powers of identical $k$ density matrices is a crucial subroutine for many applications. Inspired by the Newton-Girard method, we developed an algorithm that uses only $mathcalO(r)$ qubits and $mathcalO(r)$ multi-qubit gates.
arXiv Detail & Related papers (2024-08-01T06:23:52Z)
Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z)
Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits [42.979881926959486]
We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
arXiv Detail & Related papers (2023-08-16T17:54:56Z)
Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
arXiv Detail & Related papers (2023-08-06T10:24:23Z)
A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
arXiv Detail & Related papers (2022-01-31T22:19:49Z)
Calculable lower bounds on the efficiency of universal sets of quantum gates [0.0]
Currently available quantum computers, so called Noisy Intermediate-Scale Quantum (NISQ) devices, are characterized by relatively low number of qubits and moderate gate fidelities. In this paper we derive lower bounds on $mathrmgap_r(mathcalS)$ and, as a consequence, on the efficiency of universal sets of $d$-dimensional quantum gates.
arXiv Detail & Related papers (2022-01-27T19:38:13Z)
Solving the sampling problem of the Sycamore quantum circuits [6.0604034858265345]
We study the problem of generating independent samples from the output distribution of Google's Sycamore quantum circuits with a target fidelity. We propose a new method to classically solve this problem by contracting the corresponding tensor network just once. For the Sycamore quantum supremacy circuit with $53$ qubits and $20$ cycles, we have generated one million uncorrelated bitstrings.
arXiv Detail & Related papers (2021-11-04T17:13:09Z)
Fast estimation of outcome probabilities for quantum circuits [0.0]
We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits. Our algorithms complement each other by performing best in different parameter regimes. We provide a C+Python implementation of our algorithms and benchmark them using random circuits.
arXiv Detail & Related papers (2021-01-28T19:00:04Z)
Exponential Error Suppression for Near-Term Quantum Devices [0.0]
In NISQ era, complexity and scale required to adopt even the smallest QEC is prohibitive. We show that for the crucial case of estimating expectation values of observables one can indeed achieve an effective exponential suppression.
arXiv Detail & Related papers (2020-11-11T18:00:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.