中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

28 records (took 0.022 seconds)

    Nanometric structure and corresponding manufacturing method
    1.
    发明公开
    Nanometric structure and corresponding manufacturing method 有权
    纳米结构和其制备方法

    公开(公告)号：EP1630882A1

    公开(公告)日：2006-03-01

    申请号：EP04425649.3

    申请日：2004-08-31

    Applicant: STMicroelectronics S.r.l.

    Inventor： Mascolo, Danilo ,  Cerofolini, Gianfranco ,  Rizzotto, Gianguido

    IPC: H01L51/00 ,  G11C13/02

    CPC classification number: H01L51/0021 ,  H01L51/0595 ,  Y10S977/712 ,  Y10S977/781

    Abstract: A hosting structure of nanometric components is described advantageously comprising:

    a substrate (1);
    n array levels (20, 30, 40) on said substrate (1), with n ≥ 2, arranged consecutively on growing and parallel planes,
    each including a plurality of conductive spacers (11, 41) alternated to a plurality of insulating spacers (12, 42) and substantially perpendicular to said substrate (1), with definition between consecutive conductive spacers (11, 41) of at least a gap (13),
    conductive spacers of consecutive array levels (20, 30, 40) lying on distinct and parallel planes, said gaps (13) of different array levels being at least partially aligned along a direction substantially perpendicular to said substrate (1) with definition of a plurality of transversal hosting seats (13a, 130a) extended along said direction and suitable for hosting at least a nanometric component.

    A nanometric electronic device is also described comprising such a hosting structure and a method for realising it.

    METHOD FOR REALISING A HOSTING STRUCTURE OF NANOMETRIC ELEMENTS
    2.
    发明公开
    METHOD FOR REALISING A HOSTING STRUCTURE OF NANOMETRIC ELEMENTS 有权
    一种生产用于纳米尺寸元素的宿主结构的方法

    公开(公告)号：EP1630127A1

    公开(公告)日：2006-03-01

    申请号：EP04425647.7

    申请日：2004-08-31

    Applicant: STMicroelectronics S.r.l.

    Inventor： Mascolo, Danilo ,  Cerofolini, Gianfranco ,  Rizzotto, Gianguido

    IPC: B81C1/00 ,  B82B3/00

    CPC classification number: H01L21/0337 ,  H01L21/0338 ,  Y10S977/70 ,  Y10S977/701

    Abstract: Method for realising a hosting structure of nanomettric elements (A, B) comprising the steps of depositing on an upper surface (12) of a substrate (10), of a first material, a block-seed (15) having at least one side wall (18). Depositing on at least one portion of sad surface (12) and on the block-seed (15) a first layer (20), of predetermined thickness of a second material, and subsequently selectively and anisotropically etching it realising a spacer-seed (22) adjacent to the side wall (18). The method thus providing to repeat n times, with n >= 2, a step comprising a deposition on the substrate (10) of a layer (20, 30) of a predetermined material followed by a selective and anisotropic etching of the layer with realisation of at least one relative spacer (25, 35). This predetermined material being different for each pair of consecutive depositions. The above n steps defining at least one multilayer body (50, 150, 250). The method thus providing the step of selectively etching the multilayer body (50, 150, 250) removing a fraction of the spacers realising at least one plurality of nanometric hosting seats (40), the remaining fraction of the spacers realising contact terminals for a plurality of molecular transistors hosted in said hosting seats (40).

    Method and relative quantum gate for running a Grover's or Deutsch-Jozsa's quantum algorithm
    4.
    发明公开
    Method and relative quantum gate for running a Grover's or Deutsch-Jozsa's quantum algorithm 审中-公开
    Verfahren und亲戚Quantengatter zurAusführungeines Grover oder Deutsch-Josza-Quantenalgorithmus

    公开(公告)号：EP1380991A1

    公开(公告)日：2004-01-14

    申请号：EP02425447.6

    申请日：2002-07-08

    Applicant: STMicroelectronics S.r.l.

    Inventor： Rizzotto, Gianguido ,  Amato, Paolo ,  Porto, Domenico

    IPC: G06N1/00

    CPC classification number: G06N99/002 ,  B82Y10/00

    Abstract: A method of performing a Grover's or a Deutsch-Jozsa's quantum algorithm using a certain binary function defined on a space having a basis of vectors of n of qubits, comprises carrying out a superposition operation over input vectors for generating components of linear superposition vectors referred on a second basis of vectors of n +1 qubits, an entanglement operation over components of the linear superposition vectors for generating components of numeric entanglement vectors, and an interference operation over components of the numeric entanglement vectors for generating components of output vectors.
    The method allows a non negligible time saving because the entanglement operation is carried out by generating, for components of each superposition vector, corresponding components of a numeric entanglement vector, each component referred to a respective vector of the second basis being

    equal to the corresponding component of the respective superposition vector, if the binary function is null in correspondence of the vector of the first basis constituted by the first n qubits of the respective vector of the second basis, or
    the opposite of the corresponding component of the respective superposition vector, if the binary function is non null in correspondence of the vector of the first basis constituted by the first n qubits of the respective vector of the second basis.
    This method can be implemented in a relative quantum gate for running a Grover's or a Deutsch-Jozsa's quantum algorithm.

    Abstract translation: 使用在具有量子位n的向量的基础的空间上定义的特定二进制函数来执行Grover或Deutsch-Jozsa的量子算法的方法包括对输入向量执行叠加操作，用于生成参考的线性叠加向量的分量 n + 1个量子位的向量的第二基础，对于产生数字纠缠矢量的分量的线性叠加矢量的分量的纠缠操作，以及对于产生输出矢量的分量的数字纠缠矢量的分量的干扰操作。 该方法允许不可忽略的时间节省，因为纠缠操作是通过对每个叠加向量的分量产生数字纠缠矢量的对应分量来执行的，每个分量被称为第二基础的相应矢量相等 对应于相应叠加矢量的相应分量，如果二进制函数对应于由第二基元的相应矢量的第一n个量子位构成的第一基准矢量或与相应叠加矢量的相应分量相反的二进制函数为零 如果二进制函数对应于由第二基础的相应向量的第一n个量子位构成的第一基数的向量，则该二进制函数是非零的。 该方法可以在相对量子门中实现，用于运行Grover或Deutsch-Jozsa的量子算法。

    A method of performing the superposition operation of a Grover's or a Deutsch-Jozsa's quantum algorithm and a relative quantum gate
    6.
    发明公开
    A method of performing the superposition operation of a Grover's or a Deutsch-Jozsa's quantum algorithm and a relative quantum gate 审中-公开
    一种用于执行格罗弗或德国Josza量子算法和相对量子栅极的叠加操作的方法

    公开(公告)号：EP1267304A1

    公开(公告)日：2002-12-18

    申请号：EP01830383.4

    申请日：2001-06-12

    Applicant: STMicroelectronics S.r.l.

    Inventor： Rizzotto, Gianguido ,  Amato, Paolo ,  Porto, Domenico

    IPC: G06N1/00

    CPC classification number: G06N99/002 ,  B82Y10/00

    Abstract: A quantum gate carries out the superposition operation of a Grover's or of a Deutsch-Jozsa's quantum algorithm in a very fast manner because it performs all multiplications by using logic gates, that immediately output the result. The superposition operation of a Grover's and a Deutsch-Jozsa's quantum algorithm substantially consists in performing the Hadamard rotation over an input set of vectors producing a set of rotated vectors, calculating the tensor product of all the rotated vectors among them outputting a linear superposition set of vectors. The tensor product of all rotated vectors among them is carried out by logic gates. Moreover, a method of performing the superposition operation of a Grover's or of a Deutsch-Jozsa's quantum algorithm over an input set of vectors is disclosed.

    Abstract translation: 量子门进行外科Grover的的或德国乔沙的以非常快速的方式量子算法的叠加因为它通过使用逻辑门执行所有乘法，没有立即输出结果。 的Grover的和德国Jozsa量子的量子算法基本上besteht在到输入设定矢量产生一组旋转的矢量的执行阿达玛旋转，计算所有它们之间的旋转矢量输出廷的线性叠加组的张量积叠加手术 向量。 其中所有旋转的矢量的张量积是由逻辑门开展。 更结束了，到输入设定向量的执行的外科Grover的或德国Jozsa量子的量子算法的叠加的方法游离缺失盘。

    Encryption process employing modified chaotic maps and relative digital signature process
    8.
    发明公开
    Encryption process employing modified chaotic maps and relative digital signature process 有权
    Verschlüsselungsverfahrenmit Verwendung chaotischer Abbildungen und verwandtes digitales Signaturverfahren

    公开(公告)号：EP1467514A1

    公开(公告)日：2004-10-13

    申请号：EP04101145.3

    申请日：2004-03-19

    Applicant: STMicroelectronics S.r.l.

    Inventor： Kocarev, Ljupco ,  Amato, Paolo ,  Rizzotto, Gianguido

    IPC: H04L9/00

    CPC classification number: H04L9/001 ,  H04L9/3013 ,  H04L9/302 ,  H04L9/3093

    Abstract: An encryption process comprises the following steps:

    preliminarily choosing at least a secret key and a set of permutable functions defined on a certain phase space for encrypting/decrypting messages,
    choosing a code for encoding messages to be sent in the form of a number belonging to the phase space,
    and wherein the set of permutable functions is composed of modified chaotic maps generated by a composite function, the image of which is calculated modulo a certain pre-established integer number, obtained composing a first function, a second function and the inverse of said first function,

    the secret key is defined by using the second function.

    This process uses a particular type of chaotic maps, the "modified chaotic maps", that work only on integer numbers. Given that operations on integers are faster than operations in floating-point arithmetic, this encryption process is faster than other processes that use chaotic maps.

    Abstract translation: 一种加密过程包括以下步骤：初步选择在某个相位空间定义的至少一个秘密密钥和一组可置换的功能，用于加密/解密消息，选择一个代码，以编码属于 所述相位空间，并且其中所述可置换函数集合由由复合函数生成的修改的混沌映射组成，所述复合函数的图像被模拟为特定的预先建立的整数，由组成第一函数获得，第二函数和反相 所述第一功能的秘密密钥由第二功能定义。 这个过程使用一种特殊类型的混沌映射，即仅修改整数的“修改混沌映射”。 假定整数的操作比浮点算术中的操作更快，则该加密过程比使用混沌映射的其他进程更快。

Patent Agency Ranking