Encode 0 by phase zero and 1 by phase π. Alice and Bob choose their bits independently and keep their choices private. Bob announces the trial numbers with a D0 click over an authenticated public channel. For each retained trial, c guarantees that their bits agree. In the ideal symmetric setup, the two equal-phase cases 00 and 11 give the same click probability, so announcing success does not itself reveal which shared bit was used.
The matching-phase cases occur with probability1/2, and a matching case succeeds with probability1/16. Therefore
Thus a no-click trial supplies neither a known equal bit nor a known complemented bit. This is why it cannot be retained by the direct error-free sifting rule. The source's “cannot use” should be understood in this sense: the events are not statistically independent, so an absolute claim that they contain no information would be false.
To obtain a secret final key, reveal and discard a random subset of retained bits to test the observed error rate, then apply reconciliation and privacy amplificationas required by a security analysis of the actual implementation. Resolving which time path a photon took removes the accepted histories' quantum coherence and can turn destructive interference into false D0 clicks, providing a simple disturbance test. Equal-phase click correlations alone are not a proof of security against every attack, particularly in the presence of losses and device imperfections. The supplied idealmodel fixes the sifted rate N/32; it does not fix a positive secure final length without an adversary model and observed parameters.
Let S denote immediate transmission through the BS1 subsystem between Bob's lower-right port and Alice's upper-left port; let L denote transmission after one visit to each internal mirror. From the same beam splitter rules as in b, the corresponding amplitudes in either direction are
up toa common fixed two-mirror propagation phase. The minus sign in L comes from the 1′→1 or reverse 1→1′scattering. The two paths selected by D0'stime gate are L on the outward journey followed by S on the return, and S outward followed by L on the return. They have the same total delay and fixed propagation phase, so their probability amplitudes interfere.
For the firsthistory, Alice applies eiϕA to the late component, while Bob's return-timemodulation is not encountered in the return delay arm. For the second, Alice's early component is unmodulated and Bob applies eiϕB in the return delay arm. Bob must time his modulation to the return passage, leaving the outward reference preparation unchanged; this is implicit in the stated encoding. Each enabled modulator is traversed twice, so its π/2 single-pass phase becomes the stipulated π.
For the allowed values 0,π, this is 1/16 when ϕA=ϕB and zero otherwise. The ignored trajectories exit other ports or other time bins; excluding them from D0's acceptance does not increase the success probability. Equal mirror reflection phases, channel phases and Alice'smirror phase multiply both accepted histories equally and cancel from the interference condition. A residual relative phase would need calibration.
Starting at port 1, the first beam splitter encounter sends amplitude c straight out through port 0 and stores amplitude −c towards M2. A return from M2 enters port 1′; it sends the stored amplitudetimes −c out through port 1 and times c towards M1. A return from M1 enters port 0′; it sends amplitudetimes c out through port 0 and times c towards M2. Both internal continuations carry +c, so two additional encounters multiply the surviving amplitude by +c2.
and c0,2j=c1,2j+1=0. The first nonzero terms are c0,1=1/2, c1,2=1/2, c0,3=−1/(22) and c1,4=1/4. If fixed reflection amplitudes r1,r2 are retained instead, multiply c0,2j+1 by (r1r2)j and c1,2j by r2jr1j−1, as well as the appropriate delay propagation phases. These unit-modulus factors do not alter the following probabilities.
Distinct exit events are orthogonal because they differ in output port or arrival-time bin. This requires the incident wavepacket to resolve the delay. Summing the squared moduli as geometric series gives
Their sum is one. After n encounters the probability of still being inside is 2−n, which tends to zero, so no trapped component is omitted.
The source drawing places the delay line in the M2 arm. A visit to M2 crosses that line in both directions. If τ is its one-way delay, then an exit after n encounters has crossed it 2⌊n/2⌋times:
If the phrase “delay time τ” instead denotes the complete M2-arm round-trip delay, replace 2τ by τ in the floor formula. The wording does not explicitly distinguish these conventions. Consecutive encounters can produce the same exit time in different ports: for example n=2,3 both follow one M2 visit. If the incident wavepacket were much longer than the arm delay, different histories in the same port would overlap and their probability amplitudes would have to be added before squaring; the asserted time-bin expansion would then not be an orthonormal eventbasis.
The relative phase in the first rule is essential to the repeated-path calculation. Overall port phases may be changed consistently; they cannot be changed on one pass alone while retaining the original scattering rules. In the following, take unit mirror reflection amplitudes by incorporating fixed reflection phases into the propagation-mode convention, and keep any unremoved propagation phase explicitly if needed.
Only the control qubit needs to be pure. A uniformly randomized computational basis preparation supplies the target maximally mixed state. This is the principle of trace estimation by a maximally mixed Hadamard test. The extension is algebraic; efficiently implementing controlled-U still requires a known suitable gate construction. Moreover, estimating the unnormalized trace to fixed additive precision requires increasingly precise estimation of the normalized signalas k grows. There is no automatic efficient reconstruction of all entries of U.
The Born rule in the orthonormal computational basis gives P00=∣a0∣2, P01=∣a1∣2, and similarly for the two outcomes beginning with one. Ignoring the second outcome therefore gives
Both ∣+⟩ and ∣−⟩ give either final computational basis outcome with probability1/2. Thus, after Alice records the second outcome b, she assigns ∣b⟩, whereas Bob assigns
This equality follows directly by evaluating the four diagonal entries: the first three are +1 and the 11 entry is −1. Negative J can be handled by refocusing or reversing the effective interaction sign. The global phase can be ignored.
Here ∣−⟩=(∣0⟩−∣1⟩)/2. Since X∣−⟩=−∣−⟩, phase kickback gives Uf(∣x⟩∣−⟩)=(−1)f(x)∣x⟩∣−⟩. The third qubit remains separable and unchanged. A direct marked-state phase oracleOf∣x⟩=(−1)f(x)∣x⟩ therefore replaces the three-qubit query using only two qubits:
Scalable characterized qubits. Two long-lived hyperfine structure levels or an optical ground/metastable pair in each ion encode ∣0⟩,∣1⟩. An ion trap confines individually addressed ions. Extending a chain adds qubits, but increasing motional complexity, addressing errors and heating limit straightforward scaling; segmented traps and transport can help.
Initialization. Cooling plus optical pumping prepares the internal quantum state. Filling or rearranging traps prepares a usable register; motional cooling is needed when the chosen quantum gate depends on motion.
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable asa static site.