activity
20172020
most citedClassical Simulation of Quantum Supremacy Circuits

85 citations · 101 across the 6 of their papers we have counts for

collaborators

11 papers

quant-ph202085 cited

Classical Simulation of Quantum Supremacy Circuits

Cupjin Huang, Fang Zhang, Michael Newman +10

It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a…

quant-ph2020

Finding Angles for Quantum Signal Processing with Machine Precision

Rui Chao, Dawei Ding, Andras Gilyen +2

We describe an algorithm for finding angle sequences in quantum signal processing, with a novel component we call halving based on a new algebraic uniqueness theorem, and another w…

quant-ph20208 cited

Alibaba Cloud Quantum Development Platform: Surface Code Simulations with Crosstalk

Cupjin Huang, Xiaotong Ni, Fang Zhang +11

We report, in a sequence of notes, our work on the Alibaba Cloud Quantum Development Platform (AC-QDP). AC-QDP provides a set of tools for aiding the development of both quantum co…

quant-ph2019

Alibaba Cloud Quantum Development Platform: Applications to Quantum Algorithm Design

Cupjin Huang, Mario Szegedy, Fang Zhang +3

We report our work on the Alibaba Cloud Quantum Development Platform (AC-QDP). The capability of AC-QDP's computational engine was already reported in \cite{CZH+18, ZHN+19}.In this…

quant-ph2019

Alibaba Cloud Quantum Development Platform: Large-Scale Classical Simulation of Quantum Circuits

Fang Zhang, Cupjin Huang, Michael Newman +10

We report, in a sequence of notes, our work on the Alibaba Cloud Quantum Development Platform(AC-QDP). AC-QDP provides a set of tools for aiding the development of both quantum com…

quant-ph20194 cited

Explicit lower bounds on strong simulation of quantum circuits in terms of -gate count

Cupjin Huang, Michael Newman, Mario Szegedy

We investigate Clifford+ quantum circuits with a small number of -gates. Using the sparsification lemma, we identify time complexity lower bounds in terms of -gate count b…