Method of performing a simon's or a shor's quantum algorithm and relative quantum gate
    1.
    发明申请
    Method of performing a simon's or a shor's quantum algorithm and relative quantum gate 审中-公开
    执行西蒙或者沙量子算法和相对量子门的方法

    公开(公告)号:US20040179622A1

    公开(公告)日:2004-09-16

    申请号:US10736237

    申请日:2003-12-15

    CPC classification number: B82Y10/00 G06N10/00

    Abstract: A method for performing a Simon's or Shor's quantum algorithm over a function encoded with n qubits is provided. The method includes performing a superposition operation over a set of input vectors for generating a superposition vector, performing an entanglement operation for generating a corresponding entanglement vector, and performing an interference operation for generating a corresponding output vector. The superposition operation is carried out in a comparably fast manner by generating the superposition vector by identifying the non-null components thereof and by calculating, as a function of the n qubits, the value nulln/2 of all the non-null components of the superposition vector, and by calculating indices of these components according to an arithmetic succession. The seed of this calculation is 1 and the common difference is 2n. The method may be implemented in a quantum gate.

    Abstract translation: 提供了一种用n量子位编码的函数执行Simon's或Shor's量子算法的方法。 该方法包括对一组输入矢量执行叠加操作以产生叠加矢量,执行用于产生相应纠缠矢量的纠缠操作,以及执行用于产生相应输出矢量的干涉操作。 通过产生叠加矢量通过识别其非零分量并通过根据n个量子位计算所有非零值的值½来以相当快的方式执行叠加操作 叠加矢量的分量,以及根据算术连续性计算这些分量的指标。 该计算的种子为1,公差为2 。 该方法可以在量子门中实现。

    Method and relative quantum gate for running a grover's or a Deutsch-Jozsa's quantum algorithm
    2.
    发明申请
    Method and relative quantum gate for running a grover's or a Deutsch-Jozsa's quantum algorithm 有权
    用于运行grover或者Deutsch-Jozsa的量子算法的方法和相对量子门

    公开(公告)号:US20040059765A1

    公开(公告)日:2004-03-25

    申请号:US10615446

    申请日:2003-07-08

    CPC classification number: G06N99/002 B82Y10/00

    Abstract: A method of performing a Grover's or a Deutsch-Jozsa's quantum algorithm being input with a binary function defined on a space having a basis of vectors of n of qubits includes carrying out a superposition operation over input vectors for generating components of linear superposition vectors referred to a second basis of vectors of nnull1 qubits. An entanglement operation is performed over components of the linear superposition vectors for generating components of numeric entanglement vectors. The method allows a non-negligible time savings because the entanglement operation does not multiply a superposition vector for an entanglement matrix, but generates components of an entanglement vector simply by copying or inverting respective components of the superposition vector depending on values of the binary function. An interference operation is performed over components of the numeric entanglement vectors for generating components of output vectors.

    Abstract translation: 使用在具有量子位n的向量的基础的空间上定义的二进制函数来输入Grover或Deutsch-Jozsa的量子算法的方法包括对输入向量执行叠加操作,该输入向量用于生成涉及的线性叠加向量的分量 n + 1量子位向量的第二个基础。 对于用于产生数字纠缠矢量的分量的线性叠加矢量的分量执行纠缠操作。 该方法允许不可忽略的时间节省,因为纠缠操作不会叠加纠缠矩阵的叠加矢量,而是简单地通过根据二进制函数的值复制或反转叠加矢量的各个分量来生成纠缠矢量的分量。 对数字纠缠矢量的分量进行干扰运算,以产生输出矢量的分量。

Patent Agency Ranking