<p>I would like to know how the gates are defined in quantum random access codes? Consider the <span class="math-container">$2 \to 1$</span> code described in Lemma 3.1 of <a href="https://arxiv.org/pdf/quant-ph/9804043.pdf" rel="nofollow noreferrer">this paper</a>.</p>
<p>The section defines the encoding and decoding circuits. But it is not clear to me how to define gates. Say, I want to apply an <span class="math-container">$Rz(\theta)$</span> on the first qubit or a CNOT gate on both qubits.</p>
<p>I was able to make some progress. For single qubit gates, applying it directly means applying on the first encoded qubit. To apply it on the second qubit, you have to conjugate it with the H gate. I am still not sure how to apply the CNOT gate.</p>

CC BY-SA 4.0
2020-08-24T06:48:38.790Z
Notice that these codes encode *classical bits* into qubits, so applying quantum gates to the encoded bits is not necessarily meaningful. Moreover, the encoding is not linear (there is a nontrivial normalization factor), so that a CNOT gate on the encoded bits might not correspond to a linear operator (i.e., gate) on the encoding qubit.
smapers
CC BY-SA 4.0
2020-08-24T15:47:37.727Z
@smapers, since $BPP \subseteq BQP$, shouldn't it be always meaningful to apply quantum gates to encoded classical bits?
Omar Shehab
CC BY-SA 4.0
2020-08-24T18:10:03.843Z
No, that is a statement about randomized vs quantum algorithms, unrelated to the study of encoding.
smapers
CC BY-SA 4.0
2020-08-24T23:21:08.660Z
@smapers, let's say I want to adopt QRAC for Grover's algorithm. Now I need to be able to apply CNOT, right?
Omar Shehab
CC BY-SA 4.0
2020-08-25T09:25:11.443Z
That's not quite how this works. The encoding is really not defined for qubits (e.g., the encoded state would depend on the global phase, which is not physical), hence it makes no sense to run Grover's algorithm on the *classical* input bits.
smapers
<quantum-computing><quantum-information><quantum-walk>
Gate definitions for quantum random access codes
Omar Shehab
# Gate definitions for quantum random access codes

(Asked by: username_0 on 2020-08-23)

I would like to know how the gates are defined in quantum random access codes? Consider the $2 \to 1$ code described in Lemma 3.1 of [this paper](https://arxiv.org/pdf/quant-ph/9804043.pdf).

The section defines the encoding and decoding circuits. But it is not clear to me how to define gates. Say, I want to apply an $Rz(\theta)$ on the first qubit or a CNOT gate on both qubits.

I was able to make some progress. For single qubit gates, applying it directly means applying on the first encoded qubit. To apply it on the second qubit, you have to conjugate it with the H gate. I am still not sure how to apply the CNOT gate.

**Tags:** quantum-computing, quantum-information, quantum-walk
> **Comments:**
> **username_1**: Notice that these codes encode *classical bits* into qubits, so applying quantum gates to the encoded bits is not necessarily meaningful. Moreover, the encoding is not linear (there is a nontrivial normalization factor), so that a CNOT gate on the encoded bits might not correspond to a linear operator (i.e., gate) on the encoding qubit.  
> **username_0**: @smapers, since $BPP \subseteq BQP$, shouldn't it be always meaningful to apply quantum gates to encoded classical bits?  
> **username_1**: No, that is a statement about randomized vs quantum algorithms, unrelated to the study of encoding.  
> **username_0**: @smapers, let's say I want to adopt QRAC for Grover's algorithm. Now I need to be able to apply CNOT, right?  
> **username_1**: That's not quite how this works. The encoding is really not defined for qubits (e.g., the encoded state would depend on the global phase, which is not physical), hence it makes no sense to run Grover's algorithm on the *classical* input bits.  

---

## 0 answers

