0% found this document useful (0 votes)
23 views2 pages

Position Encoding: M N (N 1) M M

The document describes a method for encoding the positions of unknown users and known base stations into a quantum state. It involves preparing an initial state, applying encoding unitaries based on the distance-dependent phase shifts between each user-station pair, and then performing measurements to extract the phase information and determine the user positions.

Uploaded by

Vaughan Png
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views2 pages

Position Encoding: M N (N 1) M M

The document describes a method for encoding the positions of unknown users and known base stations into a quantum state. It involves preparing an initial state, applying encoding unitaries based on the distance-dependent phase shifts between each user-station pair, and then performing measurements to extract the phase information and determine the user positions.

Uploaded by

Vaughan Png
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1

Position encoding
Given M base station (with index j ) with know location and N user (with index i) with unknown location, the
position encoding in the M N degree of freedom is as followed

Figure 1: Quantum circuit for position/phase encoding for N = 2, M = 3

Step 1: preperation
h i
|0⟩⊗M ⊗N → H|0⟩|0⟩⊗(N −1) X ⊗M |0⟩⊗M


N −1  
O 1  ⊗(N −1) ⊗(N −1)
→ CN OT1,i+1 √ |0⟩|0⟩ + |1⟩|0⟩ |1⟩⊗M
i=1
2
 
1
→ √ |0⟩⊗N + |1⟩⊗N ⊗ |1⟩⊗M

2

where |0⟩⊗N = |0⟩i ⊗ ... ⊗ |0⟩N , X ⊗M = X1 ⊗ ... ⊗ X3 and CN OT1,i+1 is denoted with the rst user's qubit as
control and the rest of the user as target.
The state after the preparation read
 
1
|Ψ⟩prep = √ |0⟩⊗N + |1⟩⊗N ⊗ |1⟩⊗M

2
Step 2 : encoding

Utot |Ψ⟩prep → |Ψ⟩en


where  
1  ⊗N P
⊗N
|Ψ⟩en = √ |0⟩ +e i i,j ϕi,j
|1⟩ ⊗ |1⟩⊗M
2
and
 
N
Y M
Y
Utot = Ci  Uj 
i=1 j=1
 
1 0
with Uj = and Ci [Uj ] is the controlled rotation which has the form of
0 e−iϕj
2

 
1 0 0 0
 0 1 0 0 
Ci [Uj ] = 
 
0 0 1 0 
0 0 0 e−iϕj
Here i is the control (users') qubit and j is the target (stations') qubit. controlled give the following

C0 [U0 ] |00⟩ → |00⟩


C0 [U1 ] |01⟩ → |01⟩
C1 [U0 ] |10⟩ → |10⟩
C1 [U1 ] |11⟩ → eiϕj |11⟩

Step 3 : readout

|Ψ⟩user = T rbase [|Ψ⟩f in ⟨Ψ|f in ]


 
1  ⊗N P
i i,j ϕi,j ⊗N
= √ |0⟩ +e |1⟩
2

k = M × N copies of |Ψ⟩user need to be generated simultaneously to extract the phase ϕi,j

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy