METHOD AND APPARATUS FOR DETECTING SIGNAL WITH QUANTUM COMPUTING IN MIMO SYSTEM
20220038144 · 2022-02-03
Inventors
Cpc classification
H04B7/0456
ELECTRICITY
H04L27/0008
ELECTRICITY
International classification
Abstract
A method of detecting a signal in a wireless communication system supporting multiple-input multiple-output (MIMO) is provided. The method includes obtaining a MIMO channel matrix between a transmission end and a reception end and a reception vector received by the reception end, identifying a modulation scheme of the transmission end, applying a preset equation modification scheme to the MIMO channel matrix and the reception vector according to the identified modulation scheme, and detecting a transmission vector of the transmission end by performing quantum calculation on the modified MIMO channel matrix and the modified reception vector.
Claims
1. A method of detecting a signal in a wireless communication system supporting multiple-input multiple-output (MIMO), the method comprising: obtaining a MIMO channel matrix between a transmission end and a reception end and a reception vector received by the reception end; identifying a modulation scheme of the transmission end; applying a preset equation modification scheme to the MIMO channel matrix and the reception vector according to the identified modulation scheme; and detecting a transmission vector of the transmission end by performing quantum calculation on the modified MIMO channel matrix and the modified reception vector.
2. The method of claim 1, wherein the modulation scheme is one of a binary phase shift keying (BPSK) modulation scheme, a quadrature phase shift keying (QPSK) modulation scheme, an M-ary phase shift keying (MPSK) modulation scheme, or a quadrature amplitude modulation (QAM) modulation scheme, and wherein, M is a power of 2 which is equal to or greater than 2.
3. The method of claim 2, wherein, when the modulation scheme is the MPSK modulation scheme, the modified MIMO channel matrix and the modified reception vector are modified by using the preset equation modification scheme, wherein the preset equation modification scheme is expressed as: denotes a zero matrix of size N×N, Y denotes an N×N matrix in which only a jth column is −y, Ω=diag(1, . . . , 1, N.sup.−1, 1, . . . , 1) denotes an N×N diagonal matrix in which a jth column is N.sup.−1, I.sub.N denotes an identity matrix of size N×N, J=(1 . . . 1).sup.T, Ã denotes a matrix of size MN×MN, and {tilde over (y)} denotes a column vector of length MN.
4. The method of claim 1, wherein performing the quantum calculation on the modified MIMO channel matrix and reception vector comprises: quantizing the modified MIMO channel matrix and reception vector; applying a quantum algorithm to the quantized MIMO channel matrix and reception vector; and detecting the transmission vector by digitizing a result of applying the quantum algorithm.
5. The method of claim 2, wherein, if the modulation scheme is the QAM modulation scheme, performing the quantum calculation on the modified MIMO channel matrix and reception vector comprises: performing the quantum calculation on the modified MIMO channel matrix and the modified reception vector to obtain prior information related to the transmission vector; and detecting the transmission vector based on the prior information, and wherein the prior information includes at least one of a magnitude of the transmission vector, a magnitude of an individual component of the transmission vector, and a phase of the individual component of the transmission vector.
6. The method of claim 5, wherein the modified MIMO channel and the modified reception vector, are modified by using the preset equation modification scheme for obtaining the magnitude of the transmission vector included in the prior information, are expressed as:
7. The method of claim 5, wherein the modified MIMO channel and the modified reception vector, are modified by using the preset equation modification scheme for obtaining the magnitude of the individual component of the transmission vector included in the prior information, and the modified MIMO channel and the modified reception vector are used to obtain a magnitude of a real part component of the transmission vector, wherein the modified MIMO channel and the modified reception vector are expressed as:
8. The method of claim 5, wherein the modified MIMO channel and the modified reception vector, which are modified by using the preset equation modification scheme for obtaining the magnitude of the individual component of the transmission vector included in the prior information, and the modified MIMO channel and the modified reception vector are used to obtain a magnitude of an imaginary part component of the transmission vector, and wherein the modified MIMO channel and the modified reception vector are expressed as:
9. The method of claim 5, wherein the modified MIMO channel and the modified reception vector, which are modified by using the preset equation modification scheme for obtaining the phase of the individual component of the transmission vector included in the prior information, and the modified MIMO channel and the modified reception vector are used to obtain a sign of a real part component of the transmission vector, and wherein the modified MIMO channel and the modified reception vector are expressed as: denotes a zero matrix of size 2N×1, A′ and y′ denote
10. The method of claim 5, wherein the modified MIMO channel and the modified reception vector, which are modified by using the preset equation modification scheme for obtaining the phase of the individual component of the transmission vector included in the prior information, and the modified MIMO channel and the modified reception vector are used to obtain a sign of an imaginary part component of the transmission vector, and wherein the modified MIMO channel and the modified reception vector are expressed as: denotes a zero matrix of size 2N×1, A′ and y′ denote
11. A quantum calculation center in a wireless communication system supporting multiple-input multiple-output (MIMO), the quantum calculation center comprising: a network interface configured to obtain a MIMO channel matrix between a transmission end and a reception end and a reception vector received by the reception end; and a processor configured to: identify a modulation scheme of the transmission end, apply a preset equation modification scheme to the MIMO channel matrix and the reception vector according to the identified modulation scheme, and detect a transmission vector of the transmission end by performing quantum calculation on the modified MIMO channel matrix and the modified reception vector.
12. The quantum calculation center of claim 11, wherein the modulation scheme is one of a binary phase shift keying (BPSK) modulation scheme, a quadrature phase shift keying (QPSK) modulation scheme, an M-ary phase shift keying (MPSK) modulation scheme, or a quadrature amplitude modulation (QAM) modulation scheme.
13. The quantum calculation center of claim 12, wherein, when the modulation scheme is the MPSK modulation scheme, the modified MIMO channel matrix and the modified reception vector which are modified by using the preset equation modification scheme are expressed as a following equation, denotes a zero matrix of size N×N, Y denotes an N×N matrix in which only a jth column is −y, Ω=diag(1, . . . , 1, N.sup.−1, 1, . . . , 1) denotes an N×N diagonal matrix in which a jth column is N.sup.−1, I.sub.N denotes an identity matrix of size N×N, J=(1 . . . 1).sup.T, Ã denotes a matrix of size MN×MN, and {tilde over (y)} denotes a column vector whose length is MN.
14. The quantum calculation center of claim 11, wherein the processor is configured to: quantize the modified MIMO channel matrix and reception vector, apply a quantum algorithm to the quantized MIMO channel matrix and reception vector, and detect the transmission vector by digitizing a result of applying the quantum algorithm.
15. The quantum calculation center of claim 12, wherein, if the modulation scheme is the QAM modulation scheme, the processor is configured to: perform the quantum calculation on the modified MIMO channel matrix and the modified reception vector to obtain prior information related to the transmission vector, and detect the transmission vector based on the prior information, and wherein the prior information includes at least one of a magnitude of the transmission vector, a magnitude of an individual component of the transmission vector, and a phase of the individual component of the transmission vector.
16. The quantum calculation center of claim 15, wherein the modified MIMO channel and the modified reception vector are modified by using the preset equation modification scheme for obtaining the magnitude of the transmission vector included in the prior information, and wherein the modified MIMO channel and the modified reception vector are expressed as:
17. The quantum calculation center of claim 15, wherein the modified MIMO channel and the modified reception vector are modified by using the preset equation modification scheme for obtaining the magnitude of the individual component of the transmission vector included in the prior information, the modified MIMO channel and the modified reception vector are used to obtain a magnitude of a real part component of the transmission vector, and wherein the modified MIMO channel and the modified reception vector are expressed as:
18. The quantum calculation center of claim 15, wherein the modified MIMO channel and the modified reception vector are modified by using the preset equation modification scheme for obtaining the magnitude of the individual component of the transmission vector included in the prior information, and the modified MIMO channel and the modified reception vector are used to obtain a magnitude of an imaginary part component of the transmission vector, and wherein the modified MIMO channel and the modified reception vector are expressed as:
19. The quantum calculation center of claim 15, wherein the modified MIMO channel and the modified reception vector are modified by using the preset equation modification scheme for obtaining the phase of the individual component of the transmission vector included in the prior information, the modified MIMO channel and the modified reception vector are used to obtain a sign of a real part component of the transmission vector, and wherein the modified MIMO channel and the modified reception vector are expressed as: denotes a zero matrix of size 2N×1, A′ and y′ denote
20. The quantum calculation center of claim 15, wherein the modified MIMO channel and the modified reception vector are modified by using the preset equation modification scheme for obtaining the phase of the individual component of the transmission vector included in the prior information, the modified MIMO channel and the modified reception vector are used to obtain a sign of an imaginary part component of the transmission vector, and wherein the modified MIMO channel and the modified reception vector are expressed as: denotes a zero matrix of size 2N×1, A′ and y′ denote
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0039] For a more complete understanding of the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like parts:
[0040]
[0041]
[0042]
[0043]
[0044]
[0045]
[0046]
[0047]
[0048]
[0049]
[0050]
[0051]
[0052]
DETAILED DESCRIPTION
[0053]
[0054] Hereinafter, an embodiment of the disclosure will be described in detail with reference to the accompanying drawings. In describing embodiments, a detailed description of related functions or configurations will be omitted when it is determined that the detailed description thereof may unnecessarily obscure the subject matter of the disclosure. The terms as described below are defined in consideration of the functions in the embodiments, and the meaning of the terms may vary according to the intention of a user or operator, convention, or the like. Therefore, the definitions of the terms should be made based on the contents throughout the specification.
[0055] In the present disclosure, various changes may be made and various embodiments may be provided, and specific embodiments will be described in detail by exemplifying them in the drawings. However, this is not intended to limit the present disclosure to a specific embodiment, it should be understood to include all changes, equivalents, and substitutes included in the spirit and scope of the present disclosure.
[0056] Although ordinal numbers such as “first,” “second,” and so forth will be used to describe various components, those components are not limited herein. The terms are used only for distinguishing one component from another component. For example, a first component may be referred to as a second component and likewise, a second component may also be referred to as a first component, without departing from the teaching of the inventive concept. The term “and/or” used herein includes any and all combinations of one or more of the associated listed items.
[0057] The terminology used herein is for the purpose of describing various embodiments only and is not intended to be limiting. As used herein, the singular forms are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “has,” when used in this specification, specify the presence of a stated feature, number, step, operation, component, element, or combination thereof, but do not preclude the presence or addition of one or more other features, numbers, steps, operations, components, elements, or combinations thereof.
[0058] According to an embodiment, a method according to various embodiments of the disclosure may be included and provided in a computer program product. The computer program products may be traded as commodities between sellers and buyers. The computer program product may be distributed in the form of a machine-readable storage medium (e.g., compact disc read only memory (CD-ROM) or digital video disc (DVD)-ROM), or be distributed (e.g., downloaded or uploaded) online via an application store (e.g., Play Store™), or between two user devices (e.g., smart phones) directly. If distributed online, at least part of the computer program product may be temporarily generated or at least temporarily stored in the machine-readable storage medium, such as memory of the manufacturer's server, a server of the application store, or a relay server.
[0059] According to various embodiments, each component (e.g., a block or a program) of the present disclosure may include a single entity or multiple entities. According to various embodiments, one or more of the above-described components may be omitted, or one or more other components may be added. Alternatively or additionally, a plurality of components (e.g., blocks or programs) may be integrated into a single component. In such a case, according to various embodiments, the integrated component may still perform one or more functions of each of the plurality of components in the same or similar manner as they are performed by a corresponding one of the plurality of components before the integration. According to various embodiments, operations performed by the module, the program, or another component may be carried out sequentially, in parallel, repeatedly, or heuristically, or one or more of the operations may be executed in a different order or omitted, or one or more other operations may be added.
[0060] According to the present disclosure, an electronic device may provide a channel for a wireless communication with a terminal. The electronic device may mean a base station, an access network (AN), a radio access network (RAN), an eNB, an eNodeB, a 5.sup.th generation (5G) node, a transmission/reception point (TRP), or a 5.sup.th generation NodeB (5gNB), and/or the like. For convenience, embodiments of the present disclosure will be described by illustrating the electronic device as the base station. The terminal may mean a user equipment (UE), a mobile station, a subscriber station, a remote terminal, a wireless terminal, or a user device, and/or the like which communicate with the base station via the wireless communication.
[0061] According to the present disclosure, a multiple-input multiple-output (MIMO) system may mean, for example, various wireless communication systems which support a MIMO transmission technology which is a multi-antenna technology such as a long-term evolution (LTE) system, a long-term evolution-advanced (LTE-A) system, and an LTE-A pro system which are proposed in a 3rd generation partnership project (3GPP), or a 5G system, and/or the like.
[0062] According to the present disclosure, the terms ‘transmission end’ and ‘reception end’ may correspond to a terminal and a base station, respectively, or may correspond to the base station and the terminal, respectively, and the terminal and the base station correspond to the aforementioned terminal and base station.
[0063] Unless otherwise defined in the present disclosure, all terms including technical or scientific terms used herein have the same meaning as commonly understood by a person of ordinary skill in a technical field to which the present disclosure belongs. Terms as defined in a commonly used dictionary should be interpreted as having a meaning consistent with the meaning in the context of the related technology, and unless explicitly defined in an embodiments of the present invention, the terms are not to be interpreted in an ideal or excessively formal meaning.
[0064] At least one embodiment of the present disclosure includes modifying a MIMO channel matrix and a reception vector, quantizing the modified MIMO channel matrix and reception vector and applying a quantization algorithm to the quantized MIMO channel matrix and reception vector, and digitalizing (i.e., quantum measuring) a result of the application of the quantization algorithm to obtain an input vector of a MIMO channel, i.e., a transmission vector of a transmission end in order to obtain a solution of a linear equation for estimating the input vector of the MIMO channel.
[0065] Here, the modification of the MIMO channel matrix and the reception vector is applied according to a modulation scheme applied to transmission of the transmission vector at the transmission end.
[0066] Further, depending on the modulation scheme, information related to the solution of the linear equation is first obtained before the MIMO channel matrix and the reception vector are modified, and the modification of the MIMO channel matrix and the reception vector is applied according to this prior information.
[0067] Hereinafter, embodiments of the present disclosure will be described in detail based on the above-described basic concept.
[0068]
[0069] Referring to the illustrative example of
[0070] Continuing with reference to
[0071] In the MIMO system 200, a process of estimating the transmission vector in the quantum calculation center 204 is performed to obtain a solution of a linear equation Ax=y by applying a quantum algorithm. Here, a matrix A denotes a MIMO channel matrix of size N×N of the MIMO channel 202, x=(x.sub.1 . . . x.sub.N).sup.T, which is a column vector of length N, denotes a transmission vector, and y=(y.sub.1 . . . y.sub.N).sup.T, which is a column vector of length N, denotes a reception vector. Here, N denotes the number of antennas of the transmission end 201 and the reception end 203.
[0072] Meanwhile, in some embodiments according to the present disclosure, a matrix A of a linear equation is assumed to be an arbitrary matrix of size N×N.
[0073]
[0074] Referring to the illustrative example of
[0075] Continuing with reference to
[0076] Meanwhile, the C/Q converter 302 is a structure common to all quantum computing devices, and a detailed description of the C/Q converter 302 is for quantum computing implementation itself, which is beyond the scope of the present disclosure, so a detailed description thereof will be omitted.
[0077] Upon receiving the quantum information of the MIMO channel matrix and the reception vector, the QLSS 303 obtains quantum information of the transmission vector by using a quantum algorithm. Here, the quantum algorithm used by the QLSS 303 may include a Harrow-Hassidim-Lloyd (HHL) algorithm. The QLSS 303 transfers the quantum information of the transmission vector to the Q/C converter 304.
[0078] Upon receiving the quantum information of the transmission vector, the Q/C converter 304 obtains digital information for the quantum information of the transmission vector through quantum measurement. The digital information is the transmission vector. In addition, the Q/C converter 304 transfers, to the reception end, the transmission vector, which is an input vector of the MIMO channel.
[0079] Next, a detailed structure of a quantum calculation center if a modulation scheme of a transmission end is a binary phase shift keying (BPSK) modulation scheme, a detailed structure of the quantum calculation center if the modulation scheme of the transmission end is a quadrature phase shift keying (QPSK) modulation scheme, and a detailed structure of the quantum calculation center if the modulation scheme of the transmission end is an M-ary phase shift keying (MPSK) modulation scheme will be described with reference to
[0080]
[0081] Referring to
[0082] A transmission vector x=(x.sub.1 . . . x.sub.N).sup.T of the transmission end in
[0083]
[0084] Referring to the illustrative example of
[0085] A transmission vector x=(x.sub.1 . . . x.sub.N).sup.T of the transmission end in
[0086]
[0087] Referring to the non-limiting example of
[0088] A transmission vector x=(x.sub.1 . . . x.sub.N).sup.T of the transmission end in
for k included in {0, 1, . . . , M−1}. Accordingly, N QLSSs 603 and N Q/C converters 604 are configured in parallel in order for the quantum calculation center 600 in
[0089]
[0090] Referring to the illustrative example of
[0091] Continuing with reference to the explanatory example of
[0092]
[0093] Referring to
[0094] Continuing with reference to
[0095]
[0096] Referring to the illustrative example of
[0097] Continuing with reference to
[0098] Meanwhile, a transmission vector x=(x.sub.1 . . . x.sub.N).sup.T of a transmission end in
[0099]
[0100] Referring to the explanatory example of
[0101] Continuing with reference to
[0102] Meanwhile, for obtaining N values of each of s.sub.j and t.sub.j in each term x.sub.j in a transmission vector x=(x.sub.1 . . . x.sub.N).sup.T in
[0103] A method of obtaining a solution of a linear equation related to a MIMO channel matrix, a reception vector, and a transmission vector according to an embodiment of the present disclosure will be described below.
[0104]
[0105] Referring to the illustrative example of
[0106] In operation 1102, a modulation scheme applied to a transmission vector x is identified. Here, the transmission end and the reception end may share the modulation scheme for the transmission vector x in advance, so the reception end may inform a quantum calculation center of the modulation scheme for the transmission vector x. For convenience of explanation, it has been described that operation 1102 is performed after operation 1101, but operation 1102 may be performed before operation 1101 or simultaneously with operation 1101.
[0107] In operation 1103, A and y are modified to à and {tilde over (y)}, respectively based on a preset equation modification scheme according to the modulation scheme. A specific example of the preset equation modification scheme according to the modulation scheme will be described below.
[0108] à and {tilde over (y)} which are transformed through equation modification are digital information, so à and {tilde over (y)} are transformed into quantum information for applying a quantum algorithm. That is, à and {tilde over (y)} which are the digital information are transformed into U.sub.à and |{tilde over (y)}, which are the quantum information, respectively. Here, U.sub.Ã, which is a unitary operator defined as U.sub.Ã=e.sup.2πiÃ, and is an operator used in a quantum algorithm. In addition, |
is a bracket notation of quantum mechanics which denotes a column vector of size 1, i.e., a quantum state. Hereinafter, when expressing a quantum state to be described, the bracket notation is used instead of a general matrix notation.
[0109] In operation 1105, a solution of a linear equation is obtained by applying a quantum algorithm to U.sub.Ã and |{tilde over (y)}. That is, quantum information |x.sub.j
including information about each term x.sub.j in the transmission vector x=(x.sub.1 . . . x.sub.N).sup.T is obtained by applying the quantum algorithm to U.sub.Ã and |{tilde over (y)}
. In an embodiment, the quantum algorithm such as an HHL algorithm may be used to obtain the solution of the linear equation.
[0110] In operation 1106, the quantum information |x.sub.j is transformed to obtain digital information x.sub.j, and finally, the solution x=(x.sub.1 . . . x.sub.N).sup.T of the linear equation is obtained.
[0111] In operation 1107, is, the obtained transmission vector x=(x.sub.1 . . . x.sub.N).sup.T is transferred to the reception end.
[0112] A preset equation modification method and a method for obtaining a solution of a linear equation will described for each of the following computational cases: a case that a modulation scheme of a transmission end is a BPSK modulation scheme; a case that the modulation scheme of the transmission end is a QPSK modulation scheme; a case that the modulation scheme of the transmission end is an MPSK modulation scheme; and a case that the modulation scheme of the transmission end is a QAM modulation scheme.
[0113] <BPSK Modulation Scheme>
[0114] If a modulation scheme applied to a transmission vector x=(x.sub.1 . . . x.sub.N).sup.T is a BPSK modulation scheme, a MIMO channel matrix A and a reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 1.
[0115] Equation 1 is an equation generated by adding new transmission vector components as expressed in Equation 2 to a linear equation Ax=y. Here, à is a form expanded by adding two rows and columns to the MIMO channel matrix A. O denotes a zero matrix of size N×2. N denotes the number of antennas of a transmission end and a reception end. Also, −N in à is located at the j(1≤j≤N)th column for x.sub.j.
x.sub.N+1=N,x.sub.N+2=Nx.sub.j Equation 2
[0116] In Equation 2, x.sub.N+1 and x.sub.N+2 are variables which are added for the transmission vector.
[0117] The last two rows added in Equation 1 are configured to satisfy x.sub.N+1=N, and −Nx.sub.j+x.sub.N+2=0 according to Equation 2.
[0118] If a modified equation is solved by using a quantum algorithm, Equation 2 provides a solution of the modified equation as quantum information to have information about x.sub.j. So, Equation 2 makes it possible to extract 1 bit information of x.sub.j without an error in a quantum measurement process. This will be described in detail below.
[0119] The values à and {tilde over (y)} for the modified equation given in Equation 1 are transformed into quantum information U.sub.à and |{tilde over (y)}, respectively.
[0120] Referring to Equation 1 and Equation 2, a solution {tilde over (x)} of a linear equation Ã{tilde over (x)}={tilde over (y)} may be expressed by Equation 3.
{tilde over (x)}=(x.sub.1 . . . x.sub.Nx.sub.N+1x.sub.N+2).sup.T=(x.sub.1 . . . x.sub.NNNx.sub.j).sup.TEquation 3
[0121] Meanwhile, due to a characteristic of quantum computing, quantum information is expressed as a vector whose magnitude is normalized to 1. Therefore, a solution |{tilde over (x)} of an equation obtained by applying a quantum algorithm is a vector as expressed in Equation 4 after {tilde over (x)} in Equation 3 is normalized.
[0122] In Equation 4, (x.sub.1 . . . x.sub.N N Nx.sub.j).sup.T is the solution {tilde over (x)} of the linear equation Ã{tilde over (x)}={tilde over (y)} in Equation 3, and 1/√{square root over (N+2N.sup.2)} is a factor which is generated by normalizing {tilde over (x)}.
[0123] |{tilde over (x)} in Equation 4 may be expressed as Equation 5 which is configured with (0 . . . 0 N Nx.sub.j).sup.T, which is a part with a solution which is newly generated by adding an equation, and (x.sub.1 . . . x.sub.N 0 0).sup.T which is a part with a solution of an original equation.
[0124] If each of (0 . . . 0 N Nx.sub.j).sup.T and (x.sub.1 . . . x.sub.N 0 0).sup.T is expressed as normalized quantum information, Equation 5 may be expressed through Equation 6.
[0125] Here,
|x.sub.j is vertical to |ϕ
.
[0126] In |{tilde over (x)} in Equation 6, |x.sub.j
has bit information for x.sub.j, an amplitude of |x.sub.j
is
so, through a quantum measurement process, quantum information |x.sub.j is obtained approximating to probability 100% as N increases.
[0127] Digital information x.sub.j is extracted by performing quantum measurement on the quantum information |x.sub.j. Here, x.sub.j=+1, so quantum information
which may be |x.sub.j are vertical to each other. In quantum measurement, states which are vertical to each other may be distinguished without an error, whether it is x.sub.j=+1 or x.sub.j=−1 is obtained without an error by measuring |x.sub.j
.
[0128] <QPSK Modulation Scheme>
[0129] If a modulation scheme applied to a transmission vector x=(x.sub.1 . . . x.sub.N).sup.T is a QPSK modulation scheme, it is expressed as x.sub.j=a.sub.j+ib.sub.j(1≤j≤N), so different equation modifications are applied to obtain a.sub.j and b.sub.j.
[0130] First, a MIMO channel matrix A and a reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 7 for obtaining a.sub.j.
[0131] Here, à is a matrix of size (2N+2)×(2N+2), and two −Ns in à are located at the jth column and the N+j column for x.sub.j, respectively. In addition, O.sub.1 and O.sub.2 denote zero matrixes of size N×N, and O.sub.3 denotes a zero matrix of size 2N×2. Ā denotes a complex conjugate matrix of A, and
[0132] Equation 7 is an equation generated by newly adding a transmission vector component as expressed in Equation 8 to an original linear equation Ax=y.
Āx′=
[0133] In Equation 8, Ā and
[0134] If a modified equation is solved by using a quantum algorithm, Equation 8 provides a solution of the modified equation as quantum information with information about a.sub.j. So, Equation 8 makes it possible to extract 1 bit information of a.sub.j without an error in a quantum measurement process. This will be described in detail below.
[0135] Referring to Equations 7 and 8, solutions x.sub.1, . . . , x.sub.N are obtained from the first N equations of a linear equation Ã{tilde over (x)}={tilde over (y)}, and solutions
[0136] Meanwhile, due to a characteristic of quantum computing, quantum information is expressed as a vector whose magnitude is normalized to 1. Therefore, a solution |{tilde over (x)} of an equation obtained by applying a quantum algorithm is a vector as expressed in Equation 10 after {tilde over (x)} in Equation 9 is normalized.
[0137] Referring to Equation 10, a part with a solution of an original equation is (x.sub.1 . . . x.sub.N 0 . . . 0 0 0).sup.T, a part with a solution which is newly generated by adding an equation Āx′=
[0138] Here, a part with a solution which is newly generated by adding an equation x.sub.2N+1=N, −Nx.sub.j−Nx.sub.N+j+2x.sub.2N+2=0 in Equation 8 is (0 . . . 0 0 . . . 0N Na.sub.j).sup.T where information for a.sub.j separately exists. (0 . . . 0 0 . . . 0N Na.sub.j).sup.T and a remaining part are separated as expressed in Equation 11.
[0139] If each of (0 . . . 0 0 . . . 0N Na.sub.j).sup.T and (x.sub.1 . . . x.sub.N
[0140] In Equation 12,
|a.sub.j and |ϕ
are vertical to each other.
[0141] In |{tilde over (x)} in Equation 12, |a.sub.j
has bit information for a.sub.j, an amplitude of |a.sub.j
is
so, through a quantum measurement process, quantum information |a.sub.j is obtained approximating to probability 100% as N increases.
[0142] Digital information a.sub.j is extracted by performing quantum measurement on the quantum information |a.sub.j. Here, a.sub.j=±1, so all possible quantum information |a.sub.j
is vertical to each other. In quantum measurement, states which are vertical to each other may be distinguished without an error, a value of a.sub.j is obtained without an error by measuring |a.sub.j
.
[0143] Next, a MIMO channel matrix A and a reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 13 for obtaining b.sub.j.
[0144] In Equation 13, à is a matrix of size (2N+2)×(2N+2), −N and N in à are located at the jth column and the N+j column for x.sub.j, respectively. Ā denotes a complex conjugate matrix of A, and
[0145] Equation 13 is an equation generated by newly adding components of a transmission vector as expressed in Equation 14 to an original linear equation Ax=y.
Āx′=
[0146] In Equation 14, Ā and
[0147] If a modified equation is solved by using a quantum algorithm, Equation 14 makes a solution of the modified equation as quantum information to have information about b.sub.j. So, Equation 14 makes it possible to extract 1 bit information of b.sub.j without an error in a quantum measurement process. This will be described in detail below.
[0148] Values à and {tilde over (y)} for the modified equation given in Equation 13 are transformed into U.sub.à and |{tilde over (y)}, which are quantum information, respectively.
[0149] Referring to Equations 13 and 14, solutions x.sub.1, . . . , x.sub.N are obtained from the first N equations of a linear equation Ã{tilde over (x)}={tilde over (y)}, and solutions
[0150] Meanwhile, due to a characteristic of quantum computing, quantum information is expressed as a vector whose magnitude is normalized to 1. Therefore, a solution |{tilde over (x)} of an equation obtained by applying a quantum algorithm, is a vector, such as expressed in Equation 16 after {tilde over (x)} in Equation 15 is normalized.
[0151] Referring to Equation 16, a part with a solution of an original equation is (x.sub.1 . . . x.sub.N 0 . . . 0 0 0).sup.T, a part with a solution which is newly generated by adding an equation Āx′=
[0152] Here, a part with a solution which is newly generated by adding an equation x.sub.2N+1=N, −Nx.sub.j+Nx.sub.N+1+2x.sub.2N+2=0 in Equation 14 is (0 . . . 0 0 . . . 0N Nb.sub.j).sup.T where information for b.sub.j exists separately as (0 . . . 0 0 . . . 0N Nb.sub.j).sup.T and a remaining part are separated as expressed in Equation 17.
[0153] If each of (0 . . . 0 0 . . . 0N Nb.sub.j).sup.T and (x.sub.1 . . . x.sub.N
[0154] In Equation 18,
Further, |b.sub.j and |ϕ
are vertical to each other.
[0155] In |{tilde over (x)} in Equation 18, |b.sub.j
has bit information for b.sub.j, an amplitude of |b.sub.j
is
so, through a quantum measurement process, quantum information |b.sub.j is obtained approximating to a probability of 100% as N increases.
[0156] Digital information b.sub.j is extracted by performing quantum measurement on the quantum information |b.sub.j. Here, b.sub.j=±1, so all possible quantum information |b.sub.j
is vertical to each other. In quantum measurement, states which are vertical to each other may be distinguished without an error, and a value of b.sub.j is obtained without an error by measuring |b.sub.j
.
[0157] <MPSK Modulation Scheme>
[0158] If a modulation scheme applied to transmission vector x=(x.sub.1 . . . x.sub.N).sup.T is an MPSK modulation scheme, a MIMO channel matrix A and a reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 19.
[0159] In Equation 19, O is a zero matrix of size N×N, and Y is an N×N matrix in which only the j(1≤j≤N)th column for is x.sub.j is −y. Further, Ω=diag(1, . . . 1, N.sup.−1, 1, . . . , 1) is an N×N diagonal matrix whose jth term for x.sub.j is N.sup.−1, and J=(1 . . . 1).sup.T. I.sub.N is an identity matrix of size N×N. Also, N denotes the number of antennas of a transmission end and a reception end.
[0160] In Equation 19, Ã is an MN×MN matrix, and {tilde over (y)}, which is generated by modifying a linear equation Ax=y to an equation whose variable is MN, is a column vector of length MN.
[0161] A solution {tilde over (x)} of a linear equation Ã{tilde over (x)}={tilde over (y)} is expressed for x.sub.j as expressed in Equation 20.
{tilde over (x)}=N(1x.sub.jx.sub.j.sup.2 . . . x.sub.j.sup.M).Math.u+r Equation 20
[0162] In Equation 20, u=(0 . . . 0 1 0 . . . 0).sup.T is a column vector in which only the jth term is 1 for x.sub.j, and r is a remaining part except for a preceding term N(1 x.sub.j x.sub.j.sup.2 . . . x.sub.j.sup.M).Math.u in {tilde over (x)}.
[0163] Meanwhile, due to a characteristic of quantum computing, quantum information is expressed as a vector whose magnitude is normalized to 1. Therefore, a solution |{tilde over (x)} of an equation obtained by applying a quantum algorithm becomes a vector as expressed in Equation 21 after {tilde over (x)} in Equation 20 is normalized.
[0164] In Equation 21,
and |j−1 is an expression of a quantum state of u in Equation 20. |ϕ
is a part which is vertical to |x.sub.j
|j−1
.
[0165] In |{tilde over (x)} in Equation 21, |x.sub.j
is a part which includes information for x.sub.j, an amplitude of |x.sub.j
is
so, through a quantum measurement process, a quantum state |x.sub.j is obtained, approximating to a probability of 100% as N increases.
[0166] The quantum state |x.sub.j may be expressed as Equation 22.
|x.sub.j=.Math..sub.t=0.sup.m-1|x.sub.j.sup.(t)
=|x.sub.j.sup.(m-1)
.Math.|x.sub.j.sup.(m-2)
.Math. . . . .Math.|x.sub.j.sup.(0)
Equation 22
[0167] In Equation 22, m=log.sub.2 M, and
[0168] The quantum state |x.sub.j in Equation 22 may be regarded as a case in which each quantum state |x.sub.j.sup.(t)
exists in m systems.
[0169] In Equation 22, the information for is extracted through a quantum measurement process sequentially from a quantum state |x.sub.j.sup.(m-1) in the first system of the quantum state |x.sub.j
to a quantum state
in the last system of the quantum state |x.sub.j. This will be described in detail below.
so the quantum state |x.sub.j.sup.(m-1) in the first system of the quantum state |x.sub.j
in Equation 22 may be expressed as Equation 23.
[0170] k is a number which belongs to {0, 1, . . . , M−1}, so k is expressed as Equation 24 when being expressed in a binary notation.
k=k.sub.m-1k.sub.m-2 . . . k.sub.0(2) Equation 24
[0171] Referring to Equation 24, k2.sup.m-1 in |x.sub.j.sup.(m-1) in in Equation 23 may be expressed as Equation 25.
k2.sup.m-1=k.sub.00 . . . 0.sub.(2)=2.sup.m-1k.sub.0 Equation (25)
[0172] Referring to Equation 25, |x.sub.j.sup.(m-1) in Equation 23 may be expressed as Equation 26.
[0173] Where k.sub.0 is 0 or 1, so states which |x.sub.j.sup.(m-1) in Equation 26 may satisfy a condition that they are vertical to each other. In quantum measurement, states which are vertical to each other may be distinguished without an error, and a value of k.sub.0 may be obtained by measuring |x.sub.j.sup.(m-1)
.
[0174] A quantum state |x.sub.j.sup.(m-2) which exists in the second system in the quantum state |x.sub.j
in Equation 22 may be expressed as Equation 27.
[0175] Referring to Equation 24, k2.sup.m-2 in |x.sub.j.sup.(m-2) in Equation 27 be expressed as Equation 28.
k2.sup.m-2=k.sub.1k.sub.00 . . . 0O.sub.(2)=2.sup.m-1k.sub.1+2.sup.m-2k.sub.0 Equation 28
[0176] Referring to Equation 28, |x.sub.j.sup.(m-2) in Equation 27 be expressed as Equation 29.
[0177] The value of k.sub.0 is obtained in the previous operation, k.sub.1 is 0 or 1, so states which |x.sub.j.sup.(m-2) in Equation 29 may satisfy the condition that they are vertical to each other. In quantum measurement, states which are vertical to each other may be distinguished without an error, a value of k.sub.1 is obtained by measuring |x.sub.j.sup.(m-2)
.
[0178] In this way, if a quantum measurement process is sequentially performed to a quantum state
in the last system in |x.sub.j in Equation 22, a value of k is obtained by obtaining from a value of k.sub.0 to a value of k.sub.m-1.
so a value of x.sub.j is extracted without an error.
[0179] A preset equation modification method and a method of obtaining a solution of a linear equation in a norm extractor 701, an amplitude extractor 702, and a phase extractor 703 in
[0180] <QAM Modulation Scheme: Norm Extractor>
[0181] A MIMO channel matrix A and a reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 30 for obtaining a magnitude of a transmission vector x=(x.sub.1 . . . x.sub.N).sup.T.
[0182] In Equation 30, Ã is a matrix of size (N+1)×(N+1). O.sub.1 is a zero matrix of size 1×N, and O.sub.2 is a zero matrix of size N×1. Also, N denotes the number of antennas of a transmission end and a reception end.
[0183] A solution {tilde over (x)} of a linear equation Ã{tilde over (x)}={tilde over (y)} may be expressed by Equation 31.
{tilde over (x)}=(Nx.sub.1 . . . x.sub.N).sup.T Equation 31
[0184] Meanwhile, quantum information is expressed as a vector whose magnitude is normalized to 1, a solution |{tilde over (x)} of an equation which is obtained by applying a quantum algorithm (e.g., an HHL) is a vector as expressed in Equation 32 where {tilde over (x)} in Equation 31 is normalized.
[0185] In Equation 32, |ϕ is a quantum state vertical to |0
.
[0186] A probability amplitude a of the quantum state |0 in Equation 32 is defined by Equation 33.
[0187] If a value of Equation 33 is extracted by applying a quantum algorithm (e.g., a QAE algorithm), a magnitude ∥x∥ of the transmission vector is obtained.
[0188] <QAM Modulation Scheme: Amplitude Extractor>
[0189] For obtaining |s.sub.j| and |t.sub.j| which are values of individual amplitudes for each term x.sub.j=s.sub.j+i.Math.t.sub.j(1≤j≤N) of a transmission vector x=(x.sub.1 . . . x.sub.N).sup.T, different equation modifications are applied.
[0190] First, a MIMO channel matrix A and a reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 34 to obtain |s.sub.j|.
[0191] The MIMO channel matrix A and the reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 34.
[0192] In Equation 34, O.sub.1 is a zero matrix of size N×1, and O.sub.2 is a zero matrix of size N×N. Ā and th column and the N+jth column for x.sub.j, respectively. Also, N denotes the number of antennas of a transmission end and a reception end.
[0193] A solution {tilde over (x)} of a linear equation Ã{tilde over (x)}={tilde over (y)} is expressed as Equation 35.
{tilde over (x)}=(Ns.sub.jx.sup.T
[0194] In Equation 35,
[0195] Meanwhile, due to a characteristic of quantum computing, quantum information is expressed as a vector whose magnitude is normalized to 1. Therefore, a solution |{tilde over (x)} of an equation obtained by applying a quantum algorithm is a vector as expressed in Equation 36 after {tilde over (x)} in Equation 35 is normalized.
[0196] In Equation 36, |ϕ is a quantum state vertical to |0
.
[0197] A probability amplitude a of the quantum state |0 in Equation 36 is defined as Equation 37.
[0198] If a value of Equation 37 is extracted by applying a quantum algorithm (e.g., a QAE algorithm), a value |s.sub.j| of an individual amplitude of the transmission vector is obtained by using a magnitude ∥x∥ of the transmission vector transferred from a norm extractor (for example, norm extractor 701 in
[0199] A MIMO channel matrix A and a reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 38 for obtaining |t.sub.j|.
[0200] In Equation 38, O.sub.1 is a zero matrix of size N×1, and O.sub.2 is a zero matrix of size N×N. Ā and
[0201] A solution {tilde over (x)} of a linear equation Ã{tilde over (x)}={tilde over (y)} is expressed as Equation 39.
{tilde over (x)}=(Nt.sub.jx.sup.T
[0202] In Equation 39, {tilde over (x)} is a complex conjugate matrix of x.
[0203] Meanwhile, due to a characteristic of quantum computing, quantum information is expressed as a vector whose magnitude is normalized to 1. Therefore, a solution |{tilde over (x)} of an equation obtained by applying a quantum algorithm is a vector as expressed in Equation 40 after {tilde over (x)} in Equation 39 is normalized.
[0204] In Equation 40, |ϕ is a quantum state vertical to |0
.
[0205] A probability amplitude a of the quantum state |0 in Equation 40 is defined as Equation 41.
[0206] If a value of Equation 41 is extracted by applying a quantum algorithm (e.g., a QAE algorithm), a value |t.sub.j| of an individual amplitude of the transmission vector is obtained by using a magnitude ∥x∥ of the transmission vector transferred from a norm extractor 701 in
[0207] <QAM Modulation Scheme: Phase Extractor>
[0208] For obtaining s.sub.j and t.sub.j which are values of individual amplitudes for each term x.sub.j=s.sub.j+i.Math.t.sub.j(1≤j≤N) of a transmission vector x=(x.sub.1 . . . x.sub.N).sup.T, different equation modifications are applied.
[0209] First, a MIMO channel matrix A and a reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 42 to obtain s.sub.j.
[0210] In Equation 42, I.sub.2N is an identity matrix of size 2N×2N, and is a zero matrix of size 2N×1. A′ and y′ are expressed as Equation 43. Also, N denotes the number of antennas of a transmission end and a reception end.
[0211] In Equation 43, O.sub.1 is a zero matrix of size N×1, and O.sub.2 is a zero matrix of size N×N. Ā and
[0212] A solution {tilde over (x)} of a linear equation Ã{tilde over (x)}={tilde over (y)} is expressed as Equation 44.
[0213] In Equation 44,
[0214] Meanwhile, due to a characteristic of quantum computing, quantum information is expressed as a vector whose magnitude is normalized to 1. Therefore, a solution |{tilde over (x)} of an equation obtained by applying a quantum algorithm is a vector as expressed in Equation 45 after {tilde over (x)} in Equation 44 is normalized.
[0215] In Equation 45,
and |ϕ is a part vertical to |s.sub.j
|0
.
[0216] In |{tilde over (x)} in Equation 45, |s.sub.j
is a part which has information for s.sub.j/|s.sub.j|. An amplitude of |s.sub.j
is
however, a value of ∥x∥.sup.2 is about a constant multiple of N, so, through a quantum measurement process, a quantum state |s.sub.j is obtained approximating to probability 100% as N increases.
[0217] Then information for s.sub.j/|s.sub.j| is obtained from the quantum state |s.sub.j. Here, values which s.sub.j/|s.sub.j| may have are ±1, so possible quantum states |s.sub.j
s are vertical to each other. In quantum measurement, states which are vertical to each other may be distinguished without an error, a value of s.sub.j/|s.sub.j| is obtained without an error by measuring |s.sub.j
.
[0218] A value of s.sub.j is obtained by using |s.sub.j| which is a value of an individual amplitude of the transmission vector received from an amplitude extractor 702 in
[0219] Next, a MIMO channel matrix A and a reception vector y=(y.sub.1 . . . y.sub.N).sup.T are modified as expressed in Equation 46 for obtaining t.sub.j.
[0220] In Equation 46, I.sub.2N is an identity matrix of size 2N×2N, and is a zero matrix of size 2N×1. Also, N denotes the number of antennas of a transmission end and a reception end. A′ and y′ are expressed as Equation 47.
[0221] In Equation 47, O.sub.1 is a zero matrix of size N×1, and O.sub.2 is a zero matrix of size N×N. Ā and
[0222] A solution {tilde over (x)} of a linear equation Ã{tilde over (x)}={tilde over (y)} is expressed as Equation 48.
[0223] In Equation 48,
[0224] Meanwhile, due to a characteristic of quantum computing, quantum information is expressed as a vector whose magnitude is normalized to 1. Therefore, a solution |{tilde over (x)} of an equation obtained by applying a quantum algorithm is a vector as expressed in Equation 49 after {tilde over (x)} in Equation 48 is normalized.
[0225] In Equation 49,
and |ϕ is a part vertical to |t.sub.j
|0
.
[0226] In |{tilde over (x)} in Equation 49, |t.sub.j
is a part which has information for t.sub.j/|t.sub.j|. An amplitude of |t.sub.j is
is however, a value of ∥x∥.sup.2 is a constant multiple of N, so, through a quantum measurement process, a quantum state |t.sub.j can be obtained, approximating to a probability of 100% as N increases.
[0227] Then information for t.sub.j/|t.sub.j| is obtained from the quantum state |t.sub.j. Here, values which t.sub.j/|t.sub.j| may have are ±1, so possible quantum states |t.sub.j
s are vertical to each other. In quantum measurement, states which are vertical to each other may be distinguished without an error, a value of t.sub.j/|t.sub.j| is obtained without an error by measuring |t.sub.j
.
[0228] A value of t.sub.j is obtained by using |t.sub.j| which is a value of an individual amplitude of the transmission vector received from an amplitude extractor (for example, amplitude extractor 702 in
[0229]
[0230] Referring to the illustrative example of
[0231] Meanwhile, a MIMO channel matrix A and a reception vector y used in a quantum calculation center may be transmitted from a device (e.g., a terminal or a base station), which requests calculation from a quantum calculation center, to the quantum calculation center, and an input vector x of a MIMO channel (or a transmission vector) calculated in the quantum calculation center may be transmitted to a designated device as well as the device which requests the calculation from the quantum calculation center. Here, the designated device may be designated by the device which requests the calculation from the quantum calculation center.
[0232] In addition, considering practical use, a quantum calculation center may be shared and used by several devices. So, time division multiplexing (TDM), frequency division multiplexing (FDM), and/or the like may be applied by applying a multiplexing technology which may be used by a plurality of users. Accordingly, a device which manages use of the quantum calculation center may transmit and receive time, frequency, and/or the like, which are used resources, to and from, a device which uses the quantum calculation center and the quantum calculation center to transmit A, x, and y.
[0233]
[0234] Referring to the illustrative example of
[0235] The network interface 1301 receives a MIMO channel matrix and a reception vector, and transfers an obtained input vector (or a transmission vector) of the MIMO channel to a reception end.
[0236] The processor 1302 performs a role of a linear equation modification module 301, a C/Q converter 302, a QLSS 303, and a Q/C converter 304 in
[0237] Meanwhile, in the explanatory example of
[0238] An embodiment of the present disclosure may efficiently process an operation performed in a detection stage in a MIMO system by using a quantum calculation center.
[0239] An embodiment of the present disclosure may decrease complexity of a detection stage by modifying a linear equation for detecting an input vector of a MIMO channel in a MIMO system.
[0240] An embodiment of the present disclosure may reduce complexity of a process of extracting digital information in an HHL algorithm.
[0241] An embodiment of the present disclosure may apply an HHL algorithm to a detection stage in a MIMO system while maintaining performance advantage of the HHL algorithm over an existing digital algorithm as it is.
[0242] Although the present disclosure has been described with various embodiments, various changes and modifications may be suggested to one skilled in the art. It is intended that the present disclosure encompass such changes and modifications as fall within the scope of the appended claims.