Abstract
Scrambling is a concept introduced from information loss problem arising in black hole. In this paper we discuss the effect of scrambling from a perspective of pure quantum information theory regardless of the information loss problem. We introduce 7-qubit quantum circuit for a quantum teleportation. It is shown that the teleportation can be perfect if a maximal scrambling unitary is used. From this fact we conjecture that “the quantity of scrambling is proportional to the fidelity of teleportation”. In order to confirm the conjecture, we introduce \(\theta \)-dependent partially scrambling unitary, which reduces to no scrambling and maximal scrambling at \(\theta = 0\) and \(\theta = \pi / 2\), respectively. Then, we compute the average fidelity analytically, and numerically by making use of qiskit (version 0.36.2) and 7-qubit real quantum computer ibm\(\_\)oslo. Finally, we show that our conjecture can be true or false depending on the choice of qubits for Bell measurement.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
Nowadays, quantum information science (QIS) [1] is one of the subjects, which attract much attention recently. This seems to be mainly due to the rapid development of quantum technology such as realization of quantum cryptography [2, 3] and quantum computer [4, 5]. In QIS quantum entanglement [1, 6, 7] plays an important role as a physical resource in the various types of quantum information processing (QIP). It is used in many QIP such as in quantum teleportation [8, 9], superdense coding [10], quantum cloning [11], quantum cryptography [2, 12], quantum metrology [13], and quantum computers [4, 14, 15]. In particular, quantum computing attracted a lot of attention recently after IBM and Google independently realized quantum computers.
Quantum gravity (QG) is a field of physics that seeks to describe gravity according to the principles of quantum mechanics. Experimental access to QG, however, is challenging at present since it requires the ability to measure miniscule physical effects. Recent rapid development of quantum computer, however, may allow different possibility to test QG indirectly. Using quantum simulators and quantum computers, we may be able to probe QG in the laboratory [16,17,18,19].
Already there were several papers investigating QG toward this direction. In Ref. [20] matrix quantum mechanics is simulated by adopting the quantum-classical hybrid algorithm called VQE [21]. In particular, the authors of Ref. [20] computed the low-energy spectra of bosonic and supersymmetric matrix models and compare them to the results of Monte Carlo simulations. In Ref. [22] quantum teleportation with scrambling unitary was implemented on a fully connected trapped-ion quantum computer [23]. This is based on the Hayden-Preskill protocol [24,25,26]. The protocol proposes a way for the information that falls into a black hole to be “scrambled” in a way that it can eventually be recovered by making use of the entangled pair of particle. Thus, the intuition behind their approach is to reinterpret the black hole’s information loss problem via the quantum teleportation. In Ref. [27] wormhole-inspired teleportation was simulated by making use of Quantinuum’s trapped-ion System Model H1-1 and five IBM superconducting quantum processing units. This is indirect approach to verify the ER=EPR conjecture [28, 29], which assumes that the quantum channel generated by entangled quantum state is nothing but the wormhole. It was shown that the teleportation signals reach \(80 \%\) of theoretical predictions.
(Color online) a Quantum circuit for usual quantum teleportation. b Quantum circuit for quantum teleportation with scrambling unitary. If U is maximally scrambling unitary, perfect quantum teleportation might be possible. In both figures the vertical lines correspond to the initial maximally entangled state \(|\beta _0 \rangle = \frac{1}{\sqrt{2}} (|00 \rangle + |11 \rangle )\)
Although our paper is motivated by the Hayden–Preskill protocol, the purpose is to study the teleportation scheme with a scrambling unitary from a viewpoint of pure QIS regardless of the information loss problem. The scrambling [25, 26, 30,31,32] is a concept introduced from information loss problem [33, 34] in black hole physics. Although there is more rigorous definition [30, 31], roughly speaking, “scrambling” means the delocalization of quantum information. In other words, when the quantum information of the subsystem is completely DISPERSED with remaining systems, we use the terminology “scrambling”.Footnote 1
The quantum circuit for this scheme is different from usual quantum teleportation as shown in Fig. 1. Figure 1a is well-known 3-qubit quantum circuit for usual quantum teleportation. Alice has first two qubits and Bob has last one. The vertical line means the maximally entangled state \(|\beta _0 \rangle = \frac{1}{\sqrt{2}} (|00 \rangle + |11 \rangle )\). The task is to teleport the unknown state \(|\psi \rangle = \alpha |0 \rangle + \beta |1 \rangle \) to Bob. It is easy to show that the quantum state \(|\Psi \rangle \) in Fig. 1a is
Thus, the task is completed by applying X and/or Z to Bob’s qubit appropriately, where X, Y, and Z are the Pauli operators.
Figure 1b is a 7-qubit quantum circuit for teleportation with scrambling. First qubit, i.e., 0th-qubit, in Fig. 1b represents the Alice’s secret qubit. In this paper we assume \(|\psi \rangle _A = \alpha |0 \rangle + \beta |1 \rangle \) with \(|\alpha |^2 + |\beta |^2 = 1\). The 1th- and 2th-qubits are Charlie’s qubits. Thus, unitary operator U scrambles the quantum information of Alice’s and Charlie’s qubits. The 3th- and 4th-qubits denote Daniel’s qubits. Finally, the 5th- and 6th-qubits are Bob’s ancillary qubits.Footnote 2 The vertical lines in Fig. 1b mean \(|\beta _0 \rangle \) too. Of course, \(U^*\) is a complex conjugate of unitary U. Here, we assume that Daniel can access to all parties. Therefore, Daniel can select the unitary operator U and quantum measurement freely. Then, the question is as follows: is it possible to teleport Alice’s qubit \(|\psi \rangle _A\) to Bob’s 6th qubit if Daniel selects U and quantum measurement appropriately? This is a main question we would like to explore in this paper.
It was suggested [22, 24,25,26] that if U is chosen as maximally scrambling unitary, perfect teleportation might be possible if Daniel chooses a quantum measurement appropriately and notifies the outcome to Bob through a classical channel. If this is right, one can guess that if U is partially scrambling unitary, the fidelity of teleportation would be lowered from one even though Daniel performs the optimal quantum measurement. This means that the quantity of scrambling of U might be proportional to the fidelity for the teleportation. The purpose of the paper is to examine this conjecture. In order to explore this problem we introduce \(U(\theta )\), where \(\theta = 0\) and \(\theta = \pi / 2\) correspond to the no scrambling and maximally scrambling. Since there is no measure which quantify the scrambling, we cannot say how much quantum information is scrambled by \(U(\theta )\). But from the parametrization in \(\theta \), we guess that the quantity of scrambling of \(U(\theta )\) is proportional to \(\theta \). Then, we will compute the \(\theta \)-dependence of the fidelities between \(|\psi \rangle _A\) and \(\rho _B\) analytically. In order to examine the noise effect we also compute the fidelities numerically by making use of qiskit (version 0.36.2) and 7-qubit real quantum computer ibm\(\_\)oslo. From the analytical and numerical results, we conclude that our conjecture “the quantity of scrambling is proportional to the fidelity of teleportation” can be true or false depending on the Daniel’s choice of qubits for Bell measurement. As far as we know, the connection between quantity of scrambling and fidelity of teleportation is firstly discussed. Our result suggests that if a certain QIP requires an entanglement, it is possible to construct a quantum circuit with making use of the scrambling unitary.
The paper is organized as follows. In next section we examine the quantum teleportation with maximally scrambling U. If Daniel chooses Bell measurement in one of \(\{2,3\}\), \(\{1,4\}\) or \(\{0,5\}\) qubits and notifies the outcomes to Bob, it is shown that the perfect teleportation is possible. In Sect. 3 we examine the teleportation again with \(U(\theta )\), which is no scrambling at \(\theta = 0\) and maximally scrambling at \(\theta = \pi / 2\). If Daniel takes Bell measurement of either \(\{2,3\}\) or \(\{1,4\}\) qubits, it is shown that the fidelities are the exactly the same. The \(\theta \)-dependence of average fidelity is monotonically increasing function with respect to \(\theta \), which supports the conjecture. If, however, Daniel takes Bell measurement of \(\{0,5\}\) qubits, it is shown that the average fidelity is not monotonic. In Sect. 4 the numerical calculation for the fidelities is discussed. Comparing the analytically computed fidelities with the numerical ones, it is shown that qiskit and ibm\(\_\)oslo yields errors less than \(1\%\). Therefore, the effect of noise is negligible in the calculation of fidelities. Thus, if we need to discuss a similar issue in the future with large number of qubits, we can adopt the numerical approach without producing much error. In Sect. 5 a brief conclusion is given. In appendix A the partial scrambling property of \(U(\theta )\) is more clearly verified. The numerical results are summarized in appendix B and appendix C.
2 Quantum teleportation with maximally scrambling unitary
(Color online) Quantum circuit for implementing the unitary U in Eq. (2.1)
In this section we choose U in a form:
This unitary operator can be experimentally implemented up to the global phase by a quantum circuit in Fig. 2. It is straightforward to show
where X, Y, Z and I are the three Pauli operators and the Identity operator. Equation (2.2) verifies the maximal scrambling property of U by showing that it delocalizes all singlet-qubit into three-qubit operators. One can show that the quantum state \(|\Psi \rangle \) in Fig. 1b is
up to global phase. In Eq. (2.3) \(b_{ijk} = |\beta _i \rangle _{05} |\beta _j \rangle _{14} |\beta _k \rangle _{23}\), where
(Color online) Quantum circuit for Bell measurement, which generates Eq. (2.5)
From Eq. (2.3) it is easy to show that the teleportation process is completed if Daniel performs a Bell measurement in one of \(\{2,3\}\), \(\{1,4\}\), or \(\{0,5\}\) qubits and notifies the measurement outcomes to Bob. The Bell measurement can be easily implemented by using a quantum circuit of Fig. 3. This circuit transforms the Bell states into the computation basis as
Let us assume that Daniel chooses \(\{2,3\}\) or \(\{1,4\}\) qubits as a Bell measurement. If the measurement outcomes are (0, 0), (0, 1), (1.0), or (1, 1), Bob’s 6th-qubit state can be \(|\psi \rangle _A\) if Bob operates I, Z, ZX, or X to his qubit. If Daniel takes \(\{0,5\}\) qubits, Bob’s state also can be \(|\psi \rangle _A\) by operating I, X, Z, or ZX to his qubit. Therefore, the maximal scrambling unitary U given in Eq. (2.1) really allows the perfect teleportation.
3 Quantum teleportation with partial scrambling unitary
(Color online) Quantum circuit for implementing the unitary in Eq. (3.1)
In the previous section we showed that perfect quantum teleportation is possible if the maximal scrambling unitary (2.1) is used. In order to understand the role of scrambling property in the teleportation process more clearly, we consider in this section the teleportation with partial scrambling unitary. For this purpose we choose U as a \(\theta \)-dependent unitary in the form:
where
When \(\theta =0\), it reduces to the identity, which has no scrambling property. When \(\theta = \pi / 2\), it reduces to Eq. (2.1), which has a maximal scrambling property. When \(0< \theta < \pi / 2\), this is a partially scrambling unitary. This fact can be explicitly verified by examining how the maximal scrambling property (2.2) is modified if U is replaced by Eq. (3.1). This is summarized in appendix A. The unitary (3.1) can be implemented up to the global phase by a quantum circuit in Fig. 4. Then, one can show that the quantum state \(|\Psi \rangle \) in Fig. 1b can be written in a form:
It is interesting to note that \(b_{100}\), \(b_{111}\), \(b_{113}\), \(b_{131}\), \(b_{311}\) and \(b_{333}\) have both \(\beta |0 \rangle + \alpha |1 \rangle \) and \(-\beta |0 \rangle + \alpha |1 \rangle \) in Bob’s last qubit. Of course, it reduces to Eq. (2.3) when \(\theta = \pi / 2\).
3.1 Bell measurement of \(\{2,3\}\) or \(\{1,4\}\) qubits
In this subsection we assume that Daniel takes \(\{2,3\}\) or \(\{1,4\}\) qubits for the Bell measurement. Examining Eq. (3.3) carefully, one can show that the probabilities for outcomes and Bob’s 6th-qubit state are independent of Daniel’s choice for measurement. The probability for each outcome is
It is easy to show \(\sum _{i=0}^3 P_i = 1\). After measurement, the Bob’s 6th-qubit state should be derived by taking a partial trace over remaining qubits. Therefore, Bob’s state can be generally mixed state. In order to examine how well the quantum teleportation is accomplished, we will compute the fidelity \(\mathcal{F} (\rho , \sigma ) = \text{ Tr } \sqrt{\rho ^{1/2} \sigma \rho ^{1/2}}\) between Alice’s secret state and Bob’s last-qubit state. If \(\mathcal{F} = 1\), this means a perfect teleportation.
In Table 1 Bob’s 6th-qubit state is summarized for each measurement outcome, where
Then, it is straightforward to compute the fidelities \(\mathcal{F}_j^2 = \mathcal{F}^2 (\rho _A, \sigma _{j,B})\), where \(\rho _A = |\psi \rangle _A \langle \psi |\), whose explicit expressions are in the form:
If \(\alpha \) is real and \(\beta = \sqrt{1 - \alpha ^2} e^{i \phi }\), Eq. (3.6) becomes
The \(\theta \)-dependence of \(\mathcal{F}_j^2\) is plotted in Fig. 5a when \(\alpha = 1 / \sqrt{3}\) and \(\phi = 0\). This figure shows that \(\mathcal{F}_j^2\) do not reach to 1 at \(\theta = \pi / 2\) except \(j = 0\). In fact, this can be expected from Eq. (2.3).
(Color online) a The \(\theta \)-dependence of \(\mathcal{F}_{avg}^2\) presented in Eq. (3.10) when \(\alpha = 1/\sqrt{3}\) and \(\phi = 0\). b The \(\phi -\)dependence of \(\mathcal{F}_{avg}^2\) when \(\alpha = 1 / \sqrt{3}\) and \(\theta = \pi / 4\). These figures exhibit monotonic behavior in \(\theta \) direction and oscillator behavior in \(\phi \) direction. In both figures the red crossing and blue dot are numerical results computed by qiskit and ibm\(\_\)oslo, respectively
In order to increase the fidelities at \(\theta = \pi / 2\), we define
Then, \(\widetilde{\mathcal{F}}_j^2 \equiv \mathcal{F}^2 (\rho _A, \widetilde{\sigma }_{j,B})\) becomes
The \(\theta \)-dependence of \(\widetilde{\mathcal{F}}_j^2\) is plotted in Fig. 5b when \(\alpha = 1 / \sqrt{3}\) and \(\phi = 0\). As expected, this figure shows that all \(\widetilde{\mathcal{F}}_j^2\) approach to 1 at \(\theta = \pi / 2\), which indicates the perfect teleportation in the maximal scrambling unitary (2.1). In Fig. 6a we plot the \(\theta \)-dependence of the average fidelity defined
when \(\alpha = 1 / \sqrt{3}\) and \(\phi = 0\). It approaches to 0.5 and 1 when \(\theta = 0\) (no scrambling) and \(\theta = \pi / 2\) (maximal scrambling). The monotonic increasing behavior of \(\mathcal{F}_{avg}^2\) supports the conjecture “the quantity of scrambling is proportional to the fidelity of quantum teleportation”. In Fig. 6b we plot the \(\phi \)-dependence of \(\mathcal{F}_{avg}^2\) when \(\alpha = 1 / \sqrt{3}\) and \(\theta = \pi / 4\). As expected, this figure exhibits oscillatory behavior. In Fig. 6 the red crossing and blue dot are numerical results computed by qiskit and ibm\(\_\)oslo. This will be discussed in next section.
3.2 Bell measurement of \(\{0,5\}\)qubits
(Color online) a The \(\theta \)-dependence of \(\mathcal{F}_{avg}^2\) presented in Eq. (3.14) when \(\alpha = 1/\sqrt{3}\) and \(\phi = 0\). b The \(\phi -\)dependence of \(\mathcal{F}_{avg}^2\) when \(\alpha = 1 / \sqrt{3}\) and \(\theta = \pi / 3\). In both figures the red crossing and blue dot are numerical results computed by qiskit and ibm\(\_\)oslo, respectively
In this subsection we assume that Daniel takes \(\{0,5\}\) qubits as a Bell measurement. From Eq. (3.3) it is straightforward to show that the probability \(Q_j\) for each outcome is
After taking a partial trace over remaining qubits, Bob’s 6th-qubit state, \(\rho _{j, B}\), for each measurement outcome is summarized in Table 2, where
In order to increase the fidelities at \(\theta = \pi / 2\), we define
It is interesting to note that \(\rho _{0, B}\) and \(\widetilde{\rho }_{j, B} (j=1,2,3)\) reduce to \(\rho _A = |\psi \rangle _A \langle \psi |\) at \(\theta = 0\) and \(\pi /2\). Therefore, the fidelities \(\mathcal{F}_0^2 \equiv \mathcal{F}^2 (\rho _A, \rho _{0,B})\) and \(\widetilde{\mathcal{F}}_j^2 \equiv \mathcal{F}^2 (\rho _A, \widetilde{\rho }_{j,B})\) should be one at both \(\theta = 0\) and \(\pi /2\). The explicit expressions of those fidelities are
where \(\beta = \sqrt{1 - \alpha ^2} e^{i \phi }\) for real \(\alpha \) is used in the second expression of each fidelity.
In Fig. 7a we plot the \(\theta \)-dependence of the average fidelity defined by Eq. (3.10) when \(\alpha = 1 / \sqrt{3}\) and \(\phi = 0\). As expected it approaches to 1 at both \(\theta = 0\) and \(\theta = \pi / 2\), which does not support the conjecture “the quantity of scrambling is proportional to the fidelity of quantum teleportation”. In Fig. 7b the \(\phi \)-dependence of average fidelity is plotted when \(\alpha = 1 / \sqrt{3}\) and \(\theta = \pi /3\). In Fig. 7 the red crossing and blue dot are numerical results computed by qiskit and ibm\(\_\)oslo.
4 Numerical simulation
(Color online) a Full quantum circuit for the teleportation when \(|\psi \rangle _A = \frac{1}{\sqrt{3}} (|0 \rangle + \sqrt{2} |1 \rangle )\) when \(\theta = 1.5\) and \(\phi = 0\). b Full quantum circuit for the teleportation when \(|\psi \rangle _A = \frac{1}{\sqrt{3}} (|0 \rangle + \sqrt{2} e^{i \phi } |1 \rangle )\) when \(\theta = 1.5\) and \(\phi = 0.5\). In both figures it is assumed that Daniel chooses \(\{2,3\}\) qubits for a Bell measurement
In order to examine the noise effect, we compute the fidelities numerically in this section by making use of the qiskit and 7-qubit real quantum computer ibm\(\_\)oslo, and compare them with the theoretical results. First, we assume that Alice’s secret state is \(|\psi \rangle _A = \sqrt{\frac{1}{3}} |0 \rangle + \sqrt{\frac{2}{3}} |1 \rangle \). In order to compute the fidelities numerically we prepare a quantum circuit of Fig. 8a. In this figure \(\theta =1.5\) is chosen and we assume that Daniel chooses \(\{2,3\}\) qubits for Bell measurement. In the circuit the gates of purple color represent U and \(U^*\) presented in Eq. (3.1). The numerical experiment is repeated \(10^3\) times, and we compute their average value.
Next, we take \(|\psi \rangle _A = \sqrt{\frac{1}{3}} |0 \rangle + \sqrt{\frac{2}{3}} e^{i \phi } |1 \rangle \). In this case we should prepare a quantum circuit of Fig. 8b. In this figure we choose \(\theta =1.5\) and \(\phi =0.5\), and Bell measurement of \(\{2,3\}\) qubits. The numerical results are summarized in appendix B and C as Tables 4, 5, 6, and 7.
If we define the error as \( \bigg (\frac{1}{N} \sum (\text{ theoretical } \text{ value } - \text{ experimental } \text{ value}) \bigg ) \times 100\) where N is a number of data, the errors derived from Tables 4, 5, 6, and 7 are summarized in Table 3. From the table the noise effect is negligible in the computation of the average fidelities although the ibm\(\_\)oslo is little bit robust than qiskit against noise at Tables 4 and 5, and vice versa at Tables 6 and 7. Thus, we can adopt the numerical approach when we need to discuss a similar issue with huge number of qubits, where analytical calculation of fidelities is highly difficult.
5 Conclusions
In this paper we study the role of scrambling unitary in the quantum teleportation scheme. In order to explore the issue, we introduce \(U(\theta )\) in Eq. (3.1), which parametrizes identity and maximally scrambling unitary (2.1) at \(\theta = 0\) and \(\theta = \pi / 2\), respectively. Of course, it is a partially scrambling unitary when \(0< \theta < \pi / 2\).
Applying \(U(\theta )\) to the 7-qubit quantum circuit presented in Fig. 1b, we compute the fidelities between Alice’s secret state \(\alpha |0 \rangle + \beta |1 \rangle \) and Bob’s 6th-qubit state after Bell measurement in one of \(\{2,3\}\), \(\{1,4\}\), or \(\{0,5\}\) qubits.
For the case of Bell measurement of \(\{2,3\}\) or \(\{1,4\}\) qubits, it is shown that the fidelities are exactly the same. The average fidelity exhibits a monotonic behavior from 0.5 to 1 in \(\theta \), which supports our conjecture “the quantity of scrambling is proportional to the fidelity of quantum teleportation”. For the case of Bell measurement of \(\{0,5\}\) qubits, however, perfect teleportation occurs at \(\theta = 0\) and \(\theta = \pi / 2\). Thus, in this case the result does not support the conjecture. In this reason we conclude that the proportionality of scrambling with fidelity is dependent on the Daniel’s choice of qubits for the Bell measurement. If \(\alpha \) is real and \(\beta = \sqrt{1 - \alpha ^2} e^{i \phi }\), the average fidelities exhibit an oscillatory behavior in \(\phi \). All fidelities are compared to the numerical results computed by qiskit and ibm\(\_\)oslo. It is shown that the noise effect is negligible when quantum computer is used to compute the average fidelity. Therefore, we can adopt the numerical approach when we discuss a similar issue with a quantum circuit of large number of qubits, where analytical calculation of fidelities is highly difficult.
In this paper it is shown that perfect teleportation is possible if U is maximally scrambling unitary as shown in Eq. (2.1). However, there exist so many maximally scrambling unitary. We are not sure whether all maximal scrambling always allow a perfect teleportation or not. We want to examine this issue in the future.
So far, we examined the role of scrambling in the teleportation scheme from the aspect of pure QIS. However, our analysis has some implication in the information loss problem if we replace Charlie’ qubits with black hole’s qubits and Daniel’s qubits with qubits of Bob’s quantum memory. If we model the internal dynamics of a black hole by fast scrambling random unitary, Fig. 1b can be interpreted as a quantum teleportation in the black hole. Thus, the role of U in Fig. 1b is to mix the quantum information of Alice’s and black hole’s qubits. The Bell measurement corresponds to the measurement of Hawking quanta. Then, Eq. (2.3) implies that the complete decoding of Alice’s secret state is possible if U is maximally scrambling unitary. In this case we are not sure how asymptotic observer Bob can get a information on black hole’s random unitary U. Without the information how can he apply \(U^*\) to his quantum memory and ancillary qubits. To be honest, we have no definite answer on this question.
Data availability
The datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.
Change history
29 May 2023
A Correction to this paper has been published: https://doi.org/10.1007/s11128-023-03997-0
Notes
In the information loss problem the scrambling time is important to check the validity of quantum mechanics.
If Charlie’ and Daniel’s qubits are replaced with black hole’s and Bob’s quantum memory qubits, respectively, this circuit can be used to explore the information loss problem.
References
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Kollmitzer, C., Pivk, M.: Applied Quantum Cryptography. Springer, Heidelberg (2010)
Ghernaouti-Helie, S., Tashi, I., Laenger, T., Monyk, C.: SECOQC Business White Paper. arXiv:0904.4073 (quant-ph)
Ladd, T.D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., O’Brien, J.L.: Quantum computers. Nature 464, 45 (2010). [arXiv:1009.2267 (quant-ph)]
see https://bsiegelwax.medium.com/ibm-quantum-summit-2022-d1c646169189
Schrödinger, E.: Die gegenwärtige Situation in der Quantenmechanik. Naturwissenschaften 23, 807 (1935)
Horodecki, R., Horodecki, P., Horodecki, M., Horodecki, K.: Quantum Entanglement, Rev. Mod. Phys. 81, 865 (2009) [quant-ph/0702225] and references therein
Bennett, C.H., Brassard, G., Crepeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channles. Phys. Rev. Lett. 70, 1895 (1993)
Luo, Y.H., et al.: Quantum teleportation in high dimensions. Phys. Rev. Lett. 123, 070505 (2019). [arXiv:1906.09697 (quant-ph)]
Bennett, C.H., Wiesner, S.J.: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett. 69, 2881 (1992)
Scarani, V., Lblisdir, S., Gisin, N., Acin, A.: Quantum cloning, Rev. Mod. Phys. 77, 1225 (2005) [quant-ph/0511088] and references therein
Ekert, A.K.: Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 67, 661 (1991)
Wang, K., Wang, X., Zhan, X., Bian, Z., Li, J., Sanders, B.C., Xue, P.: Entanglement-enhanced quantum metrology in a noisy environment. Phys. Rev. A 97, 042112 (2018). [arXiv:1707.08790 (quant-ph)]
Vidal, G.: Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91, 147902 (2003). ([quant-ph/0301063])
Arute, F., et al.,Quantum supremacy using a programmable superconducting processor. Nature 574, 505 (2019). Its supplementary information is given in arXiv:1910.11333 (quant-ph)
García-Álvarez, L., Egusquiza, I.L., Lamata, L., del Campo, A., Sonner, J., Solano, E.: Digital quantum simulation of minimal AdS/CFT. Phys. Rev. Lett. 119, 040501 (2017)
Danshita, I., Hanada, M., Tezuka, M.: Creating and probing the Sachdev–Ye–Kitaev model with ultracold gases: towards experimental studies of quantum gravity. Prog. Theor. Exp. Phys. 2017, 083I01 (2017)
Franz, M., Rozali, M.: Mimicking black hole event horizons in atomic and solid-state systems. Nat. Rev. Mater. 3, 491 (2018)
Brown, A.R., Gharibyan, H., Leichenauer, S., Lin, H.W., Nezami, S., Salton, G., Susskind, L., Swingle, B., Walter, M.: Quantum gravity in the lab: teleportation by size and traversable wormholes. arXiv:1911.06314 (quant-ph)
Rinaldi, E., Han, X., Hassan, M., Feng, Y., Nori, F., McGuigan, M., Hanada, M.: Matrix model simulations using quantum computing, deep learning, and lattice Monte Carlo, PRX. Quantum 3, 010324 (2022). [arXiv:2108.02942 (quant-ph)]
Moll, N., Barkoutsos, P., Bishop, L.S., Chow, J.M., Cross, A., Egger, D.J., Filipp, S., Fuhrer, A., Gambetta, J.M., Ganzhorn, M., Kandala, A., Mezzacapo, A., Müller, P., Riess, W., Salis, G., Smolin, J., Tavernelli, I., Temme, K.: Quantum optimization using variational algorithms on near-term quantum devices. Quantum Sci. Technol. 3, 030503 (2018)
Landsman, K.A., Figgatt, C., Schuster, T., Linke, N.M., Yoshida, B., Yao, N.Y., Monroe, C.: Verified quantum information scrambling. Nature 567, 61 (2019). [arXiv:1806.02807 (quant-ph)]
Debnath, S., Linke, N.M., Figgatt, C., Landsman, K.A., Wright, K., Monroe, C.: Demonstration of a small programmable quantum computer with atomic qubits. Nature 536, 63 (2016). [arXiv:1603.04512 (quant-ph)]
Hayden, P., Preskill, J.: Black holes as mirrors: quantum information in random subsystems. JHEP 09, 120 (2007). [arXiv:0708.4025 (hep-th)]
Yoshida, B., Kitaev, A.: Efficient decoding for the Hayden–Preskill protocol. arXiv:1710.03363 (hep-th)
Yoshida, B., Yao, N.Y.: Disentangling scrambling and decoherence via quantum teleportation. Phys. Rev. X 9, 011006 (2019). [arXiv:1803.10772 (quant-ph)]
Shapoval, I., Su, V.P., de Jong, W., Urbanek, M., Swingle, B.: Towards quantum gravity in the lab on quantum processors. arXiv:2205.14081 (quant-ph)
Maldacena, J., Susskind, L.: Cool horizons for entangled black holes. arXiv:1306.0533 (hep-th)
Susskind, L.: ER=EPR, GHZ, and the consistency of quantum measurements. Fortschr. Phys. 64, 72 (2016). [arXiv:1412.8483 (hep-th)]
Sekino, Y., Susskind, L.: Fast scramblers. JHEP 10, 065 (2008). [arXiv:0808.2096 (hep-th)]
Lashkari, N., Stanford, D., Hastings, M., Osborne, T., Hayden, P.: Towards the fast scrambling conjecture. JHEP 04, 22 (2013). [arXiv:1111.6580 (hep-th)]
Maldacena, J., Shenker, S.H., Stanford, D.: A bound on chaos. JHEP 08, 106 (2016). [arXiv:1503.01409 (hep-th)]
Hawking, S.W.: Breakdown of predictability in gravitational collapse. Phys. Rev. D 14, 2460 (1976)
Page, D.N.: Information in black hole radiation. Phys. Rev. Lett. 71, 3743 (1993)
Acknowledgements
This work was supported by the National Research Foundation of Korea (NRF) Grant funded by the Korea government (MSIT) (No. 2021R1A2C1094580).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The original online version of this article was revised: The error in affiliation of authors has been corrected.
Appendices
Appendix A: Partial scrambling property of Eq. (3.1)
In this appendix we summarize how the maximal scrambling property (2.2) is changed by the partial scrambling unitary (3.1). After long calculation, one can show
It is straightforward to show that Eq. (A.1) reduces to the maximal scrambling property (2.2) when \(\theta = \pi / 2\).
Appendix B: Numerical result for bell measurement of \(\{2,3\}\) or \(\{1,4\}\) qubits
Appendix C: Numerical results for bell measurement of \(\{0,5\}\) qubits
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Kim, M., Hwang, MR., Jung, E. et al. Scrambling and quantum teleportation. Quantum Inf Process 22, 176 (2023). https://doi.org/10.1007/s11128-023-03922-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11128-023-03922-5