Quantum Computer with Swappable Logical Qubits

    公开(公告)号:US20240169240A1

    公开(公告)日:2024-05-23

    申请号:US18108550

    申请日:2023-02-10

    申请人: Psiquantum, Corp.

    发明人: Daniel Litinski

    IPC分类号: G06N10/40 G06N10/20 G06N10/70

    CPC分类号: G06N10/40 G06N10/20 G06N10/70

    摘要: A fault-tolerant quantum computer using topological codes such as surface codes can have an architecture that reduces the amount of idle volume generated. The architecture can include qubit modules that generate surface code patches for different qubits and a network of interconnections between different qubit modules. The interconnections can include “port” connections that selectably enable coupling of boundaries of surface code patches generated in different qubit modules and/or “quickswap” connections that selectably enable transferring the state of a surface code patch from one qubit module to another. Port and/or quickswap connections can be made between a subset of qubit modules. For instance port connections can connect a given qubit module to other qubit modules within a fixed range. Quickswap connections can provide a log-tree network of direct connections between qubit modules.

    UNIVERSAL RANDOMIZED BENCHMARKING
    10.
    发明公开

    公开(公告)号:US20240169233A1

    公开(公告)日:2024-05-23

    申请号:US18177422

    申请日:2023-03-02

    IPC分类号: G06N10/20 G06N10/70

    CPC分类号: G06N10/20 G06N10/70

    摘要: Systems and methods are disclosed for benchmarking a set of quantum gates using a universal randomized benchmarking (URB) framework. This framework supports benchmarking of gate sets that lack a group structure, enabling new benchmarking schemes beyond group-based and other existing schemes. Benchmarking a set of quantum gates according to the URB framework can include selecting a probability distribution, an implementation map, and a measurement map based on the set of quantum gates. When the probability distribution, implementation map, and measurement map possess certain properties, the probability of correctly measuring a final state, as a function of the length of a sequence of gates applied to the quantum system, can approximate an exponential decay. This exponential decay can be used to determine a benchmark average fidelity for the set of quantum gates.