TY - JOUR T1 - Cross-Platform Comparison of Arbitrary Quantum Computations Y1 - 2021 A1 - Daiwei Zhu A1 - Ze-Pei Cian A1 - Crystal Noel A1 - Andrew Risinger A1 - Debopriyo Biswas A1 - Laird Egan A1 - Yingyue Zhu A1 - Alaina M. Green A1 - Cinthia Huerta Alderete A1 - Nhung H. Nguyen A1 - Qingfeng Wang A1 - Andrii Maksymov A1 - Yunseong Nam A1 - Marko Cetina A1 - Norbert M. Linke A1 - Mohammad Hafezi A1 - Christopher Monroe AB -
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information for a single QC. On the other hand, a comparison between different QCs on the same arbitrary circuit provides a lower-bound for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform fidelities.
UR - https://arxiv.org/abs/2107.11387 ER - TY - JOUR T1 - Efficient quantum programming using EASE gates on a trapped-ion quantum computer Y1 - 2021 A1 - Nikodem Grzesiak A1 - Andrii Maksymov A1 - Pradeep Niroula A1 - Yunseong Nam AB -Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show a n-qubit Clifford circuit can be implemented using 6log(n) EASE gates, a n-qubit multiply-controlled NOT gate can be implemented using 3n/2 EASE gates, and a n-qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.
UR - https://arxiv.org/abs/2107.07591 ER -