METHODS AND APPARATUSES FOR GENERATING QUANTUM STATE PREPARATION CIRCUIT AND PREPARING QUANTUM STATE AND QUANTUM CHIP

    公开(公告)号:US20230376815A1

    公开(公告)日:2023-11-23

    申请号:US18212777

    申请日:2023-06-22

    IPC分类号: G06N10/20 G06F30/327

    CPC分类号: G06N10/20 G06F30/327

    摘要: The present disclosure relates to a method and apparatus for generating a quantum state preparation circuit, a quantum chip, an electronic device, a storage medium, and a computer program product. The method includes: determining a target qubit set with a binary tree restriction and applying a single qubit flip gate to a first target sub-node qubit; applying a two-qubit phase offset gate between sub-node qubits; applying a two-qubit SWAP gate between the first target sub-node qubit and a second target sub-node qubit; taking the sub-node qubits as the root node qubit and iteratively performing until the sub-node qubits are leaf node qubits; and applying the two-qubit phase offset gate with a path restriction between leaf node qubits and applying a single qubit phase offset gate to the leaf node qubits to obtain a quantum state preparation circuit.

    SARO: scalable attack-resistant obfuscation of logic circuits

    公开(公告)号:US11797736B2

    公开(公告)日:2023-10-24

    申请号:US17443815

    申请日:2021-07-27

    摘要: A method of obfuscating a circuit design includes, in part, receiving a netlist of the circuit design, splitting the circuit design into a multitude of partitions, transforming each partitions so as to obfuscate each partition, and stitching the multitude of transformed partitions to form the obfuscated circuit. The netlist may be a register transfer level netlist. The number and the size of partitions may vary. The partitions may be distributed throughout the entirety of the design. The method may further include generating a randomized circuit associated with at least a subset of the partitions, and merging each partition with the partition's associated randomized circuit. The method may further include quantifying the amount of transformation associated with each partition. The method may further include adding a first key to at least one of the obfuscated partitions, and adding a second key to the partition's associated randomized circuit.

    DIE LOCATION BASED LOGICAL BLOCK FORMATION AND HANDLING

    公开(公告)号:US20230334206A1

    公开(公告)日:2023-10-19

    申请号:US17659809

    申请日:2022-04-19

    摘要: Aspects of a storage device are provided for efficient handling of logical metablock formation based on a heat distribution within the storage device. The storage device includes a plurality of memory dies each including a physical block, and a controller which forms a logical metablock from the physical blocks based on a location of each of the memory dies with respect to the controller. The controller stores a mapping of heat credit points to each of the physical blocks, where each of the heat credit points are associated with a respective heat level. The controller forms logical metablocks from the physical blocks based on the mapping. For instance, the controller forms different logical metablocks from physical blocks based on respective heat levels associated with memory dies including those blocks. As a result, efficient logical block formation may be achieved without significant complexity in firmware implementation.

    RECOVERY OF A HIERARCHICAL FUNCTIONAL REPRESENTATION OF AN INTEGRATED CIRCUIT

    公开(公告)号:US20230289502A1

    公开(公告)日:2023-09-14

    申请号:US18197869

    申请日:2023-05-16

    IPC分类号: G06F30/323 G06F30/327

    摘要: A Register Transfer Level (RTL) representation is recovered from a netlist representing an integrated circuit (IC). The netlist is converted to a graph comprising nodes belonging to a set of node types and edges connecting the nodes. The set of node types includes an instance node type representing an electronic component and a wire node type representing signal transfer between components. The graph is converted to a standardized graph by replacing subgraphs of the graph with standardized subgraphs. An RTL representation of the standardized graph is generated by operations including building signal declarations in a hardware description language (HDL) from the wire nodes of the standardized graph and building signal assignments in the HDL from instance nodes of the standardized graph.