Global Patent Index - EP 4254275 A1

EP 4254275 A1 20231004 - DATA READING METHOD AND APPARATUS, STORAGE MEDIUM AND ELECTRONIC APPARATUS

Title (en)

DATA READING METHOD AND APPARATUS, STORAGE MEDIUM AND ELECTRONIC APPARATUS

Title (de)

DATENLESEVERFAHREN UND -VORRICHTUNG, SPEICHERMEDIUM UND ELEKTRONISCHE VORRICHTUNG

Title (fr)

PROCÉDÉ ET APPAREIL DE LECTURE DE DONNÉES, SUPPORT DE STOCKAGE ET APPAREIL ÉLECTRONIQUE

Publication

EP 4254275 A1 20231004 (EN)

Application

EP 21896214 A 20210526

Priority

  • CN 202011376079 A 20201130
  • CN 202011436096 A 20201210
  • CN 2021096095 W 20210526

Abstract (en)

Disclosed are a method, device, storage medium and electronic device for data reading, applied to a pre-constructed quantum random access memory (QRAM) architecture for accessing data, wherein the QRAM architecture is a binary tree structure and comprises the following nodes: N layers of subtree node and one layer of leaf node, the N being an address length; the method includes: determining an address represented by a quantum state distributedly stored in each layer of subtree node (S201); and moving, according to the address, data stored in the leaf node to the upper layer of subtree node via a first preset quantum circuit, until data corresponding to the address is output at a subtree node at the root of the binary tree structure (S202). Also disclosed is a data reading method, applied to a pre-constructed QRAM architecture for accessing data, wherein the QRAM architecture is a binary tree structure and comprises the following nodes: N layers of subtree node and one layer of leaf node, the subtree node comprising address bits and first data bits, and the leaf node comprising second data bits for storing data, the N being an address length, the method including: receiving the address represented by a quantum state (S901); parsing the address, and moving each bit of the address respectively to address bits of subtree node of a corresponding layer (S902); wherein each one bit of the address corresponds to one respective layer of the N layers of subtree node; and starting from the leaf node, moving, according to an address stored in address bits of each layer of subtree node, data stored in the leaf node to data bits of the upper layer of subtree node, until data corresponding to the address is output at a subtree node at the root of the binary tree structure (S903). (Fig. 1)

IPC 8 full level

G06N 10/00 (2022.01)

CPC (source: EP US)

G06N 10/20 (2022.01 - EP US); G06N 10/40 (2022.01 - US); G11C 13/04 (2013.01 - US); G11C 13/04 (2013.01 - EP)

Designated contracting state (EPC)

AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

Designated extension state (EPC)

BA ME

Designated validation state (EPC)

KH MA MD TN

DOCDB simple family (publication)

EP 4254275 A1 20231004; US 2024095565 A1 20240321; WO 2022110704 A1 20220602

DOCDB simple family (application)

EP 21896214 A 20210526; CN 2021096095 W 20210526; US 202118039429 A 20210526