Comment puis-je construire un circuit pour générer une superposition égale de 3 résultats pour 2 qubits?


18

Étant donné un système à 2 qubits et donc 4 mesures possibles, on obtient la base {|00 , |01 , |10 , |11} , comment puis - je préparer l'état, où:

  1. seulement 3 de ces 4 résultats de mesure sont possibles ( par exemple, |00 , |01 , |10 )?

  2. ces mesures sont tout aussi probables? (comme l'état de Bell mais pour 3 résultats)


1
Vous voulez écrire l'état réel ou créer un circuit pour préparer un tel état avec une entrée?
Josu Etxezarreta Martinez

@JosuEtxezarretaMartinez, je veux dire le circuit.
2018

@Blue, comment dit - vous réussi à les convertir 00et 11à la notation de Dirac? J'ai essayé $\ket{00}$et échoué.
2018 à 10h02

1
@weekens Si vous cliquez sur "modifier", vous pouvez voir le code MathJax. Voir aussi ceci .
Sanchayan Dutta

1
La solution de Niel de Beaudrap dans Quirk ...
stestet

Réponses:


10

Brisez le problème en plusieurs parties.

Disons que nous avons déjà envoyé à 100. Nous pouvons l'envoyer à11300+2301par un1300+(12(1+i))2301+(12(1i))2310 . Cela satisfait vos exigences avec toutes les probabilités 1SWAP mais avec différentes phases. Si vous voulez utiliser des portes de déphasage sur chacune pour obtenir les phases que vous souhaitez, si vous voulez les rendre toutes égales.13

Maintenant , comment pouvons-nous obtenir de à 100? Si c'était11300+2301, nous pourrions faire un Hadamard sur la deuxième qubit. Ce n'est pas facile avec cela, mais nous pouvons toujours utiliser un unitaire uniquement sur le deuxième qubit. Cela se fait par un opérateur de rotation uniquement sur le deuxième qubit en factorisant comme1200+1201

IdU:0(0)→∣0(130+231)

U=(13232313)
works. Decompose this into more basic gates if you need to.

In total we have:

001300+23011300+(12(1+i))2301+(12(1i))23101300+eiθ1301+eiθ2310

How do I construct U from basic gates? Let's say, from those available on IBM Q Experience.
weekens

1
@weekens There's an 'advanced' gate called U3 that allows you to implement any single qubit unitary - you input the values for θ,λ and ϕ to implement
U3(θ,λ,ϕ)=(cosθ2eiλsinθ2eiϕsinθ2ei(λ+ϕ)cosθ2),
which can be approximated using θ1.91,λ=π and ϕ=0
Mithrandir24601

To do this in basic gates, it looks like you would need to rotate into the right basis, then do a phase rotation, then rotate back which may require a fair few gates. However, in a sense, the above U3 is basic in that it's a physically implemented gate (i.e. is directly achieved by performing a couple of physical operations on the qubit instead of the many the would be required by stringing lots of 'not-advanced' gates together)
Mithrandir24601

@Mithrandir24601, thanks for your explanation! I haven't used U3 yet, will experiment with it in nearest time.
weekens

@AHusain, implemented your approach in Quirks simulator: here
weekens

8

I'll tell you how to create any two qubit pure state you might ever be interested in. Hopefully you can use it to generate the state you want.

Using a single qubit rotation followed by a cnot, it is possible to create states of the form

α|0|0+β|1|1.

Then you can apply an arbitrary unitary, U, to the first qubit. This rotates the |0 and |1 states to new states that we'll call |a0 and |a1,

U|0=|a0,U|1=|a1

Our entangled state is then

α|a0|0+β|a1|1.

We can similarly apply a unitary to the second qubit.

V|0=|b0,V|1=|b1

which gives us the state

α|a0|b0+β|a1|b1.

Due to the Schmidt decomposition, it is possible to express any pure state of two qubits in the form above. This means that any pure state of two qubits, including the one you want, can be created by this procedure. You just need to find the right rotation around the x axis, and the right unitaries U and V.

To find these, you first need to get the reduced density matrix for each of your two qubits. The eigenstates for the density matrix of your first qubit will be your |a0 and |a1. The eigenstates for the second qubit will be |b0 and |b1. You'll also find that |a0 and |b0 will have the same eigenvalue, which is α2. The coefficient β can be similarly derived from the eigenvalues of |a1 and |b1.


8

Here is how you might go about designing such a circuit. Suppose that you would like to produce the state |ψ=13(|00+|01+|10). Note the normalisation of 1/3, which is necessary for |ψ to be a unit vector.

If we want to consider a straightforward way to realise this state, we might want to think in terms of the first qubit being a control, which determines whether the second qubit should be in the state |+=12(|0+|1), or in the state |0, by using some conditional operations. This motivates considering the decomposition

|ψ=23|0|++13|1|0.
Taking this view it makes sense to consider preparing |ψ as follows:
  1. Prepare two qubits in the state |00.
  2. Rotate the first qubit so that it is in the state 23|0+13|1.
  3. Apply a coherently controlled operation on the two qubits which, when the first qubit is in the state |0, performs a Hadamard on the second qubit.

Which specific operations you would apply to realise these transformations — i.e. which single-qubit transformation would be most suitable for step 2, and how you might decompose the two-qubit unitary in step 3 into CNOTs and Pauli rotations — is a simple exercise. (Hint: use the fact that both X and the Hadamard are self-inverse to find as simple a decomposition as possible in step 3.)


0

Here is an implementation of a circuit producing state |ψ=13(|00+|01+|10) on IBM Q:

Circuit

Note that θ=1.2310 for Ry on q0. θ=π4 and θ=π4 for first and second Ry on q1.

The Ry on q0 prepares qubit in superposition |q0=23|0+13|1. Ry gates on q1 and CNOT implements controlled Hadamard gate. When q0 is in state |0 the Hadamard acts on q1 thanks to negation X. This happens with probability 23. Since Hadamard turns |0 to |+, i.e. equally distributed superposition, final states |00 and |01 can be measured with probability 13. When q0 is in state |1, controled Hadamard does not act and state |10 is measured. Since q0 is in state |1 with probability 13, |10 is measured also with probability 13.

En utilisant notre site, vous reconnaissez avoir lu et compris notre politique liée aux cookies et notre politique de confidentialité.
Licensed under cc by-sa 3.0 with attribution required.