CN109829545B - Quantum preparation method of video data - Google Patents
Quantum preparation method of video data Download PDFInfo
- Publication number
- CN109829545B CN109829545B CN201811572967.1A CN201811572967A CN109829545B CN 109829545 B CN109829545 B CN 109829545B CN 201811572967 A CN201811572967 A CN 201811572967A CN 109829545 B CN109829545 B CN 109829545B
- Authority
- CN
- China
- Prior art keywords
- information
- qubits
- quantum
- state
- pixel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Abstract
The invention provides a quantum preparation method of video data. The invention relates to a complete technical method for storing video data on a quantum computer, which comprises the steps of designing a mode for storing video data in the quantum computer by utilizing the intrinsic characteristics of quantum, and providing a quantum operation gate circuit design method for realizing the storage mode. The invention realizes the quantum preparation of video data with any time length and any picture size, and establishes a technical basis for realizing the high-efficiency storage and processing of mass video data by using a quantum computer.
Description
Technical Field
The invention relates to a video processing technology and a quantum computing technology, in particular to a quantum preparation method of video data.
Background
In the past decades, the performance of computer hardware is rapidly developed according to the Moore's law, and the exponential growth of the computing power of classical computers brings great revolution to human society. However, limited by the limits of conventional manufacturing techniques, the computational speed of classical computers cannot be increased without limit. The bottleneck of increasing the computing power of a classical computer is revealed, and the current 7-nanometer process of the white thermalization competition of various factories is close to the end point of the moore's law. Although there are some methods that can further leverage the capabilities of the manufacturing process, such as 5 nm processes, multilayer etching, etc., these are only approaching the process limits and are the last afterglow emitted by this technical route. In fact, at chip fabrication processes below 20 nm, quantum effects begin to affect chip design and production, and it is difficult to continue to follow moore's law simply by reducing the process. In recent years, the growth rate of supercomputers is gradually decreasing, and it is the manifestation of the Morie-law failure.
The quantum calculation is quantum mechanics and calculationThe cross discipline formed by combining multiple disciplines such as computer science, photoelectric technology, information science and the like is a new computing mode which has great potential and can surpass classical computing and solve the problem of molar law failure. Quantum information processing uses qubits as its basic information units, with substantial parallelism and superposition. Compared with the traditional computing theory, quantum computing has outstanding advantages in the aspects of storage performance and parallel computing: on the one hand, since n-bit quantum bits can store 2 at the same time n The storage capacity of the data is exponentially improved compared with that of the traditional memory; on the other hand, quantum computing can realize super-parallel computing due to the characteristics of superposition, entanglement, interference and the like of quantum states. In the face of such advantages, research on quantum information technology becomes a competitive focus of the world national strategies.
Quantum computing vision is an interdisciplinary discipline of quantum computing combined with visual information processing, and the main processing object is visual data. Visual data is an important source for humans to recognize and understand the objective world. In recent years, with the rapid development of optical imaging, internet, high-performance computing and other fields, the cost of acquiring, computing and exchanging visual data using video as a carrier is greatly reduced, and the scale of the visual data is increased explosively, so that the problem of large visual data is caused. How to store and efficiently process massive visual data is a key technology which is urgently needed to be broken through.
The quantum video information processing is an important exploration way for solving the problems of efficiently storing and processing mass video data. Storing video data into a quantum computer is a basic premise for processing video data by using the quantum computer, and therefore, quantum preparation of video data becomes an important task. Actually, there is no public document commonly used for quantum computing processing of video data with any duration and any picture size at present, and for this reason, there is no universal preparation method suitable for video data with any duration and any picture size, which is a key technical obstacle.
The invention designs a storage mode which can be realized on a quantum computer based on the quantum essential characteristics, and adopts a quantum circuit to complete the technical scheme of preparing video data with any time length and any picture size into the quantum computer. A key technical obstacle is removed for solving the problem of efficiently storing and processing mass video data by using a quantum computer.
Disclosure of Invention
The invention aims to provide a quantum preparation method of video data, and designs a storage mode which can be realized on a quantum computer based on the quantum essential characteristics, and adopts a quantum circuit to complete the technical scheme of preparing video data with any time length and any picture size into the quantum computer. A key technical obstacle is removed for solving the problems of efficiently storing and processing massive video data by using a quantum computer.
Storing the video data into the quantum computer is the basis for various processing of the video on the quantum computer afterwards. To store video data in a quantum computer, a technical means for storing video data in the quantum computer is first implemented by using quantum essence. The quantum preparation method of video data is essentially a quantum superposition state obtained by quantum operation of a group of quantum bits, wherein the superposition state comprises video data information. The original video data can be encoded into such a quantum superposition state by a specific encoding technique, and the video data can be decoded from such a quantum superposition state by a corresponding decoding technique. The process of developing a certain quantum operation gate circuit and storing video data on a quantum computer is called quantum video preparation.
The technical characteristics of a method for preparing video data into a quantum computer are given in the following two parts of preparation algorithm formula and preparation algorithm implementation.
1. Formula of preparation algorithm
A two-stage quantum system is adopted as a quantum bit of a quantum computer. Using |0>Representing a vector
With |1>Representing a vector
|0>And |1>Is two single-quantum-bit computation ground states. The qubit may be at |0>And |1>Other states than the above. Possible superposition states of qubits can be represented by |0>And |1>Represents the linear combination of: phi psi>＝α|0>+β|1>. Alpha and beta are complex numbers satisfying | alpha- 2 +|β| 2 ＝1，|α| 2 And | β | 2 Respectively, that the qubit collapsed to |0 when measured>Sum of states |1>The probability of a state.
In the video data V, the width and height of each picture are W, H, and the number of frames is D. Respectively representing the quantum bit number required for storing the position information on the three dimensions by using w, h and d; the relationship between the specific number of information required quanta for storing information in each dimension and the three dimensions of the video is as follows:
the invention realizes the quantum storage of the video with the frame number of any positive integer. In video, the picture width and height can be any positive integer.
Specifically, when the value of a certain dimension is 1, the dimension of the data is reduced. For example, if the video frame number D is 1, the video data degenerates to picture data, and at this time, the number of qubits D used to store frame order information is 0.
In video data, X, Y, T represents the specific values of a pixel in three dimensions of width, height and frame number.
The gradation value of a pixel in video data is f = f (X, Y, T). For a piece of video data, given the width, height and number of frames a pixel is located, the gray scale value for that pixel can be determined.
With A XYT Indicating the gray scale values of the pixels located at width, height and frame number of X, Y, T.
Let the number of gray scales of the video be K. In standard video data, the gray scale of a pixel is typically an integer power of 2, i.e., K =2 k And k is an integer.
Based on the quantum scientific essence, the invention designs a quantum state vector | V > which can be realized on a quantum computer to store video data, realizes the technical scheme of preparing the video data with any duration and any picture size into the quantum computer, and removes a key technical obstacle for solving the problems of storing and efficiently processing mass video data by using the quantum computer. The expression for the quantum state vector | V > is as follows:
wherein | XYT > is the tensor product of | X >, | Y >, | T >,
|A XYT >＝|(a XYT ) k-1 (a XYT ) k-2 …(a XYT ) 0 >for any i e {0,1, … k-1}, there is (a) XYT ) i ∈{0,1}；
Video gray scale number of K =2 k For any gray value of a pixel, k qubits are required to be represented in combination. The width, height and frame number of the gray value A of the pixel are X, Y, T XYT Information is stored in | A XYT >In (1), k qubits are combined to represent the bit. Here, the k qubits are k | (a) when i takes k different integers from 0 to k-1 XYT ) i >The way k qubits are combined is k (a) XYT ) i >The tensor product of (a).
|X>＝|x w-1 x w-2 …x 0 >For any i e {0,1, … w-1}, there is x i ∈{0,1}；
The position in the width direction where one pixel is located is denoted by X. Information of X is stored in a quantum state vector | X>In, due to
Information about the width position X where the pixel is located requires w qubits to be combined for representation. w qubits are w single-qubits where i takes w different integers from 0 to w-1 to compute the ground state | x i >The w qubits are combined in w | x i >The tensor product of (a).
That is, the quantum state vector | X>Information on where one pixel is located in the width direction is stored. Quantum state vector | X>From w qubit combinations. The w quantum bits are w single quantum bits when i takes w different integers from 0 to w-1 to calculate the ground state | x i >The way w qubits are combined is w | x i >The tensor product of (a). I.e. a quantum-state vector | X that stores information about the width of a pixel>Is the calculation of the ground state | x for w single-quantum bits when i takes w different integers from 0 to w-1 i >The tensor product of (c).
|Y>＝|y h-1 y h-2 …y 0 >For any i e {0,1, … h-1}, there is y i ∈{0,1}；
Quantum state vector | Y>Information of the position in height of one pixel is stored. Quantum state vector | Y>From the h qubit combinations. The h qubits are h single-qubit-counting ground states | y where h qubits are taken from h different integers i from 0 to h-1 i >The way h qubits are combined is h y bits i >The tensor product of (a). I.e. a quantum-state vector Y storing information on the position of a pixel in height>H single-quantum bits when i takes h different integers from 0 to h-1 to calculate the ground state | y i >The tensor product of (c).
|T>＝|t d-1 t d-2 …t 0 >For any i e {0,1, … d-1}, there is t i ∈{0,1}。
Frame sequential quantum state vector | T>Information of the frame number in which a pixel is located is stored. Vector | T>From a combination of d qubits. The d quantum bits are d single quantum bits of the d different integers i takes from 0 to d-1 to calculate the ground state | t i >The d qubits are combined in d | t i >The tensor product of (a). That is, a quantum state vector | T that stores information of the frame number in which a pixel is located>The basis state | t is calculated for d single-quantum bits when i takes d different integers from 0 to d-1 i >The tensor product of (a).
Using a state vector | V>Storing a portion of video data, k qubits are required to store grey scale information, and w qubits are wideDegree information, h-qubit storage height information, d-qubit storage time information. The total required number of qubits is b q K + w + h + d, i.e.
And (4) respectively. The same video data, using a classical computer, requires b bits c = k × W × H × D pieces. B is to q And b c By contrast, the great advantage of quantum storage can be seen.
2. Steps of preparation algorithm
The invention adopts the technical means, namely the quantum state vector
A piece of video data is stored. Using this technique requires a total number of qubits of b q K + w + h + d, where k is the number of qubits storing gray scale information, w is the number of qubits storing width information, h is the number of qubits storing height information, and d is the number of qubits storing frame order information. The quantum preparation is carried out, namely, the video data information is coded to b according to the video data storage technical means q Processes in qubits.
1. K quantum bits storing gray value information are placed in an |0> state, and w + h + d quantum bits storing width information, height information, and frame order information are placed in a superposition state.
(1) All b q Computing a ground state |0 for a single qubit for each of the qubits>State.
(2) Pass w qubits storing width information in parallel through w Hadamard gates. Hadamard gate transmission matrix of
In a calculation of the ground state |0>After passing through an Hadamard gate, the qubits in superposition state>
In the calculation of the ground state |1>After passing through an Hadamard gate, the qubits in superposition state>
w qubits pass through w Hadamard gates in parallel, meaning that each qubit passes through one Hadamard gate. w quantum bits pass through a Hadamard gate respectively to obtain a quantum superposition state, and the superposition state is collapsed to 2 in an equiprobable manner w The ground state is calculated for w qubits, 2 of these w qubits w The first W of the calculated ground states correspond to W position values that the pixel may take in the width direction. That is, obtain 2 w An equiprobable superposition state of quantum computation ground states including W quantum computation ground states representing W pieces of width-direction positional information from 0 to W-1. For example, for a system consisting of two qubits, there are four ground states, |00>、|01>、|10>And |11>(ii) a If the coordinate is used for representing the position of a pixel in the width direction, the corresponding coordinates in the width direction are respectively 0,1, 2 and 3; if the frame width is 3, the first three ground states are actually used to represent the width information of the pixel, and the last ground state is not used to represent the width information of the pixel in the frame.
(3) Passing each of the h qubits storing height information through a Hadamard gate, resulting in 2 h The equal probability superposition state of the quantum computation ground states includes H quantum computation ground states representing H pieces of height direction positional information from 0 to H-1.
(4) Passing each of the d qubits storing frame order information through a Hadamard gate, resulting in 2 d The equal probability superposition states of the quantum computation ground states include D quantum computation ground states representing D kinds of frame order information from 0 to D-1.
(5) Now, the w + h + d qubits, carrying width, height and frame order information, enter a superposition state, with the k qubits, carrying grey value information, all remaining in the |0> state.
2. The k quantum bits carrying the grey value information are quantum entangled with the w + h + d quantum bits carrying the width information, height information and frame order information. So that when the w + h + d qubits collapse to a quantum state representing the information of a pixel of a certain width, height and frame order, the k qubits carrying grey value information necessarily collapse to a quantum state representing the grey value of this pixel.
The number of pixel points in the video data is W × H × D, and the total of 2 is the calculated ground state of W + H + D quantum bits w+h+d In each of the calculation base states, width information, height information, and frame order information of all pixels of video data are stored. Each of the W × H × D calculation basis states represents one pixel width information, height information, and frame order information, and uniquely determines the position of one pixel in the video data.
Each of w + h + d quantum bits storing the width information, the height information, and the frame order information represents a calculation ground state of pixel position information and a calculation ground state of k quantum bits representing gradation values of the corresponding pixel points are entangled in order. Before quantum entanglement, all k qubits carrying grey value information are in state |0>, so that only the qubits of the k qubits that need to be in state |1> need to be controlled and inverted one by one. The control bits are w + h + d quantum bits that store width, height, and frame order. Each control bit is set to either |0> state control or |1> state control depending on whether a corresponding 0 or 1 is present in the binary encoding of the stored location information. When a w + h + d qubit collapses to the computed ground state representing the positional information for a certain pixel, the k qubits, which carry the grey value information, necessarily collapse to the computed ground state representing the grey value for this pixel.
After the computation ground states of w + h + d quantum bits corresponding to the position information of all the pixels are entangled with the computation ground state of k quantum bits corresponding to the gray value of the pixel at the position, no matter which quantum state the w + h + d quantum bits representing the position information collapse to the quantum state corresponding to the position of which pixel, the k quantum bits carrying the gray value information collapse to the quantum state representing the gray value of the pixel with the probability 1. The k + W + H + D qubits contain all the information for the video data for the frame number D with the frame widths and heights W and H, respectively.
Drawings
FIG. 1 is a schematic diagram of video data according to the present invention.
FIG. 2 is a diagram illustrating the invention where all of the k + w + h + d qubits are initialized to the |0> state.
FIG. 3 is a diagram of the parallel passage of w + h + d qubits representing width information, height information and frame order information through w + h + d Hadamard gates in accordance with the present invention.
FIG. 4 is a block diagram of a pixel of the present invention
When the information of (2) is written into the quantum system, a vector | X representing width information>Schematic diagram of quantum states.
FIG. 5 shows a pixel of the present invention
When the information of (2) is written into the quantum system, a vector | Y representing height information>Schematic diagram of quantum states.
FIG. 6 shows a pixel of the present invention
When information of (2) is written into the quantum system, a vector | X representing frame sequence information>Schematic diagram of quantum states.
FIG. 7 shows a pixel of the present invention
The information is written into the circuit module schematic diagram of the quantum system.
Fig. 8 is a circuit diagram of quantum preparation of video data according to the present invention.
Detailed Description
The invention is further described with reference to the accompanying drawings.
As shown in fig. 1, the video data V has a screen width W, a screen height H, and a total video frame number D. In the figure, video data W =19, H =12, and D =6. Coordinates of pixel points in the video in three dimensions of width, height and frame number are represented by X, Y, T respectively, and X, Y, T starts to count from 0. Pixel P exemplified in the figure XYT Has coordinates in the three directions of X, Y, T of decimal (8) 10 、(1) 10 、(2) 10 . Pixel P XYT Has a gray value of pixel A XYT In the figure, pixels are exemplified
Has a gray value of->
The number of gray levels of pixels in the video is K =2 k For any gray value of a pixel, k qubits are required to be represented in combination.
For example, if the number of gray levels of the video data V is 256, the gray level of each pixel requires 8 qubits for representation. The eight-bit grey scale value ranges from 0 to 255, binary (00000000) 2 To (11111111) 2 。
For example, a pixel
Is greater than or equal to>
Is 80, i.e. binary (01010000) 2 。
Next, the video data V is stored to the quantum state vector
In (1). />
Step one, as shown in FIG. 2, all the k + w + h + d qubits are initialized to the |0> state.
Step two, as shown in FIG. 3, w + h + d qubits representing width information, height information and frame order information are passed in parallel through w + h + d Hadamard gates, i.e.
In the following step, it is necessary to write each pixel information in the video data V into the superposition state | V > of the k + w + h + d qubit system one by one. The specific method is that for the information of each pixel, w + h + d quantum bits representing width, height and frame order are used to control the quantum bit needing to be converted into |1> state in k quantum bits carrying gray value information to be inverted from |0> state.
The third to the sixth steps are to use the gray value
80 pixel>
For example, a method of writing one pixel information is explained. Video grey scale number of 256=2 8 And thus the gray scale value is represented by an 8-bit binary number,
the width, height, and frame number of video data are W =19, H =12, D =6, respectively, and qubits for representing width information, height information, and frame order information need to be ÷ reserved respectively>
Representing a pixel by a 5-bit binary number>
The position of the width direction of (2) is X = (8) 10 ＝(01000) 2 Representing a pixel by a 4-bit binary number->
The height direction position of (2) is Y = (1) 10 ＝(0001) 2 Representing a pixel by a 3-bit binary number->
The frame number direction position of (2) is T = 10 ＝(010) 2 。
Step three, pixel
Width direction position value of (8) = 10 ＝(01000) 2 Therefore, when a qubit to be inverted in k qubits representing gray scale value information is inverted, the 5 qubits representing width information as control bits must be in a state of | X>＝|x 4 x 3 x 2 x 1 x 0 >＝|01000>. As shown in FIG. 4,. Indicates that the control bit is |1>Status is a necessary condition for the inversion of the controlled quantum bit, is present>
Indicates that the control bit is |0>A state is a necessary condition for inversion of the controlled quantum bit. A in FIG. 4 i Is a controlled inversion of a qubit representing a bit of gray scale value.
Step four, pixel
Height direction position value Y = (1) 10 ＝(0001) 2 Therefore, when a qubit to be inverted in k qubits representing gradation value information is inverted, 4 qubits representing height information as control bits must be in a state of | Y>＝|y 3 y 2 y 1 y 0 >＝|0001>I.e. the control state is as shown in fig. 5. A in FIG. 5 i Is a controlled inversion of a qubit representing a bit of gray scale value.
Step five, pixels
Height direction position value T = (2) 10 ＝(010) 2 Therefore, when a qubit to be inverted in k qubits representing gray scale value information is inverted, 3 qubits representing frame order information as control bits must be in a state of | T>＝|t 2 t 1 t 0 >＝|010>I.e. the control state is as shown in fig. 6. A in FIG. 6 i Is a controlled inverted qubit representing a bit of the gray value.
The above steps three to five determine the state in which the qubit representing the width information, the height information, and the frame order information as the control bits should be in when the qubit requiring inversion among the k qubits representing the gradation value information is inverted.
Step six, the pixel
Has a gray value of->
Representing the gray value by 8 qubits
Wherein the content of the first and second substances,
and &>
Need to be in |1>The state, and therefore the qubit, needs to be inverted. To pixel>
The line module of the information write quantum system of (2) is shown in fig. 7.
The third step to the sixth step complete the pixel
The information of (2) is written into the quantum system. The line of operations for writing all pixel information into the quantum system is shown in fig. 8. As another example in FIG. 8, assume that a pixel is ≧ H>
Has a gray value of
I.e. is>
X＝(9) 10 ＝(01001) 2 、Y＝(7) 10 ＝(0111) 2 、T＝(6) 10 ＝(110) 2 . Combining pixels>
The operation of the information write quantum system of (2) is illustrated by the corresponding blocks in fig. 8.
After writing the information of each pixel one by one, the state vector | V of a quantum system composed of 20 qubits>The information of all pixels in the video data is contained, that is, the quantum preparation of the video data is completed. For comparison, a classical computer is adopted, and the number of classical bits required for storing the video data is b c K × W × H × D =8 × 19 × 12 × 6=10944 bits. Quantum preparation of video data is accomplished, then at | V>On which the basis for various processing of the video data is performed.
Claims (3)
1. A method for quantum preparation of video data,
the formula of the video data quantum preparation algorithm is
Wherein the content of the first and second substances,
|A XYT >＝|(a XYT ) k-1 (a XYT ) k-2 …(a XYT ) 0 >storing gray level information of pixel points, and for any i epsilon {0,1, … k-1}, (a) XYT ) i ∈{0,1}；
|X>＝|x w-1 x w-2 …x 0 >Storing width information, for any i e {0,1, … w-1}, there is x i ∈{0,1}；
|Y>＝|y h-1 y h-2 …y 0 >Storing height information, having y for any i e {0,1, … h-1}, and storing height information i ∈{0,1}；
|T>＝|t d-1 t d-2 …t 0 >Storing frame sequence information, and having t for any i e {0,1, … d-1}, wherein t is the value of the sequence of the frame sequence i ∈{0,1}，
Video gray scaleNumber K =2 k K is an integer, k qubits are required to represent gray values of any pixel, W, H, D respectively represents the width, height and frame number of a picture of video data V, X, Y, T respectively represents specific values of a pixel point in three dimensions of width, height and frame number, w, h and d respectively represent the number of qubits required for storing position information in the three dimensions, and the relationship between the specific number of qubits required for storing information in each dimension and the three dimensions of the video is as follows:
using a state vector | V>Storing a portion of video data requiring k qubits for storing gray scale information, w qubits for storing width information, h qubits for storing height information, and d qubits for storing time information; the total required number of qubits is b q K + w + h + d, i.e.
A plurality of;
the method is characterized by comprising the following steps:
the method comprises the following steps: placing k quantum bits storing gray value information in video data of a quantum state vector | V > in a |0> state, and placing w + h + d quantum bits storing width information, height information, and frame order information in a superposition state; k is the number of qubits storing the grey information, w is the number of qubits storing the width information, h is the number of qubits storing the height information, d is the number of qubits storing the frame order information;
step two: quantum-entangling the k qubits carrying grey-value information with the w + h + d qubits carrying width information, height information and frame order information, such that when the w + h + d qubits collapse to a quantum state representing information for a pixel of a certain width, height and frame number, the k qubits carrying grey-value information necessarily collapse to a quantum state representing the grey-value of this pixel; no matter which quantum state the W + H + D quantum bits representing the position information collapse to the corresponding quantum state of the position of which pixel, the k quantum bits carrying the gray value information collapse to the quantum state representing the gray value of the pixel with the probability of 1, and the k + W + H + D quantum bits contain all the information of the video data with the picture width and height of W and H, respectively, and the frame number of D.
2. A method of quantum preparation of video data according to claim 1, characterized in that:
the first step is specifically as follows:
(1) All b q Computing a ground state |0 for a single qubit for each of the qubits>State;
(2) Passing the w qubits of the stored width information in parallel through w Hadamard gates having a transmission matrix of
In a calculation ground state |0>After passing through an Hadamard gate, the qubits in superposition state>
In the calculation of the ground state |1>The qubits pass through a Hadamard gate and are superposed>
w qubits pass through w Hadamard gates in parallel, meaning that each qubit passes through one Hadamard gate; w quantum bits pass through a Hadamard gate respectively to obtain a quantum superposition state, and the superposition state is collapsed to 2 in an equiprobable manner w The ground state is calculated for w qubits, 2 of these w qubits w The first W calculation ground states in the calculation ground states correspond to W position values that the pixel may take in the width direction, that is, 2 are obtained w An equiprobable superposition state of quantum computation ground states including W quantum computation ground states representing W pieces of width-direction positional information from 0 to W-1;
(3) Each of the h qubits that will store height information passes through a Hadamard gate,to obtain 2 h An equiprobable superposition state of quantum computation ground states including H quantum computation ground states representing H kinds of height direction position information from 0 to H-1;
(4) Passing each of the d qubits storing frame order information through an Hadamard gate, resulting in 2 d An equiprobable superposition state of quantum computation ground states including D quantum computation ground states representing D kinds of frame order information from 0 to D-1;
(5) The w + h + d qubits carrying the width information, the height information and the frame order information enter a superposition state, the k qubits carrying the grey value information all remaining in the state |0 >.
3. A method for quantum preparation of video data according to claim 1, characterized in that:
the second step is specifically as follows: quantum-entangling the k qubits carrying the grey-value information with the w + h + d qubits carrying the width, height and frame order information, such that when the w + h + d qubits collapse to a quantum state representing the information of a pixel of a certain width, height and frame order, the k qubits carrying the grey-value information necessarily collapse to a quantum state representing the grey-value of this pixel; the number of pixel points in the video data is W × H × D, and the total of 2 is the calculated ground state of W + H + D quantum bits w+h+d Storing width information, height information, and frame order information of all pixels of the video data using the W × H × D calculation basis states; in the WXHXD calculation ground states, each calculation ground state represents pixel width information, height information and frame sequence information, and the position of a pixel point in video data is uniquely determined by each calculation ground state; sequentially entangling a calculation ground state of each of w + h + d quantum bits storing the width information, the height information, and the frame order information, which represents the pixel position information, and a calculation ground state of k quantum bits representing the gradation value of the corresponding pixel point; before quantum entanglement, all the k qubits carrying grey value information are |0>State, therefore, only the k qubits need be set to |1>The quantum bits of the state are controlled and inverted one by one; the control bits are w + h + d quantum bits storing width, height and frame order;each control bit is set to |0 depending on whether a binary encoding of the stored location information corresponds to 0 or 1>State control of either |1>Controlling the state; when the w + h + d qubits collapse to the computed ground state representing positional information for a pixel, the k qubits, which carry grey value information, necessarily collapse to the computed ground state representing the grey value for this pixel; after the calculation ground states of w + h + d qubits corresponding to the position information of all the pixels are entangled with the calculation ground state of k qubits corresponding to the gray value of the pixel at the position, no matter to which of the quantum states corresponding to the position of the pixel the w + h + d qubits representing the position information collapse, the k qubits carrying the gray value information collapse to the quantum state representing the gray value of the pixel with probability 1; the k + W + H + D qubits contain all the information for the video data of the frame number D with the widths and heights of the pictures W and H, respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811572967.1A CN109829545B (en) | 2018-12-21 | 2018-12-21 | Quantum preparation method of video data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811572967.1A CN109829545B (en) | 2018-12-21 | 2018-12-21 | Quantum preparation method of video data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109829545A CN109829545A (en) | 2019-05-31 |
| CN109829545B true CN109829545B (en) | 2023-04-18 |
Family
ID=66859932
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811572967.1A Active CN109829545B (en) | 2018-12-21 | 2018-12-21 | Quantum preparation method of video data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109829545B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106454382A (en) * | 2016-09-20 | 2017-02-22 | 北京工业大学 | Quantum image preparation method |
| CN107204008A (en) * | 2017-06-08 | 2017-09-26 | 上海海事大学 | Quantum image matching method |
| CN109002894A (en) * | 2018-07-10 | 2018-12-14 | 华东交通大学 | A kind of quantum adder designs method based on quantum superposition state |
-
2018
- 2018-12-21 CN CN201811572967.1A patent/CN109829545B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106454382A (en) * | 2016-09-20 | 2017-02-22 | 北京工业大学 | Quantum image preparation method |
| CN107204008A (en) * | 2017-06-08 | 2017-09-26 | 上海海事大学 | Quantum image matching method |
| CN109002894A (en) * | 2018-07-10 | 2018-12-14 | 华东交通大学 | A kind of quantum adder designs method based on quantum superposition state |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109829545A (en) | 2019-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108198196B (en) | Design and implementation method of quantum image edge detection based on Sobel operator | |
| US20200242451A1 (en) | Method, system and apparatus for pattern recognition | |
| JPS5813020A (en) | Encoder | |
| CN109002894B (en) | Quantum adder design method based on quantum superposition state | |
| US11521133B2 (en) | Method for large-scale distributed machine learning using formal knowledge and training data | |
| CN109740758B (en) | Quantum computation-based nuclear method | |
| Sleator et al. | Short encodings of evolving structures | |
| Rançon et al. | Stereospike: Depth learning with a spiking neural network | |
| CN109389208B (en) | Data quantization device and quantization method | |
| CN108038548B (en) | Quantum line realization method for image binarization | |
| CN110648348B (en) | Quantum image segmentation method based on NEQR expression | |
| CN108335312B (en) | Design and implementation method of quantum morphological gradient algorithm of gray level image | |
| US20230351640A1 (en) | Point cloud attribute encoding and decoding method and device | |
| CN109829545B (en) | Quantum preparation method of video data | |
| CN108932388B (en) | Mode 2 based on quantum superposition statenDesign method of subtracter | |
| Rostami et al. | Deep learning with persistent homology for orbital angular momentum (OAM) decoding | |
| CN109389209B (en) | Processing apparatus and processing method | |
| CN108228823A (en) | A kind of binary-coding method and system of high dimensional image dimensionality reduction | |
| CN115861635B (en) | Unmanned aerial vehicle inclined image semantic information extraction method and equipment for resisting transmission distortion | |
| Miranda et al. | Hyperdimensional computing encoding schemes for improved image classification | |
| CN116095183A (en) | Data compression method and related equipment | |
| US11663289B1 (en) | Quantum modulation-based data search | |
| US11335045B2 (en) | Combining feature maps in an artificial intelligence semiconductor solution | |
| KR101664743B1 (en) | Apparatus for generating high resolution image and method thereof | |
| JP7349106B2 (en) | Encoding device, encoding method and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |