Search

Recently, Halder et al. (in Phys Rev Lett 122:040403, 2019) present two sets of strong nonlocality of orthogonal product states based on the local irreducibility. However, for a set of locally indistinguishable orthogonal entangled states, the remaining question is whether the states can reveal strong quantum nonlocality. Here we present a general definition of strong quantum nonlocality based on the local indistinguishability. Then, in $$2 \otimes 2 \otimes 2$$ quantum system, we show that a set of orthogonal entangled states is locally reducible but locally indistinguishable in all bipartitions, which means the states have strong nonlocality. Furthermore, we generalize the result in N-qubit quantum system with $$N\geqslant 3$$ . Finally, we also construct a class of strong nonlocality of orthogonal entangled states in $$d\otimes d\otimes \cdots \otimes d, d\geqslant 3$$ . Our results extend the concept of strong nonlocality for entangled states.

Quantum dual-signature means that two signed quantum messages are combined and expected to be sent to two different recipients. A quantum signature requires the cooperation of two verifiers to complete the whole verification process. As an important quantum signature aspect, the trusted third party is introduced to the current protocols, which affects the practicability of the quantum signature protocols. In this paper, we propose a quantum dual-signature protocol without arbitrator and entanglement for the first time. In the proposed protocol, two independent verifiers are introduced, here they may be dishonest but not collaborate. Furthermore, strongly nonlocal orthogonal product states are used to preserve the protocol security, i.e., no one can deny or forge a valid signature, even though some of them conspired. Compared with existing quantum signature protocols, this protocol does not require a trusted third party and entanglement resources.

Dempster-Shafer Theory (DST) of belief function is a basic theory of artificial intelligence, which can represent the underlying knowledge more reasonably than Probability Theory (ProbT). Because of the computation complexity exploding exponentially with the increasing number of elements, the practical application scenarios of DST are limited. In this paper, we encode Basic Belief Assignments (BBA) into quantum superposition states and propose the implementation and operation methods of BBA on quantum circuits. We decrease the computation complexity of the matrix evolution on BBA (MEoB) on quantum circuits. Based on the MEoB, we realize the quantum belief functions' implementation, the similarity measurements of BBAs, evidence Combination Rules (CR), and probability transformation on quantum circuits.

The Quantum State Preparation problem aims to prepare an $n$-qubit quantum state $|\psi_v\rangle =\sum_{k=0}^{2^n-1}v_k|k\rangle$ from the initial state $|0\rangle^{\otimes n}$, for a given unit vector $v=(v_0,v_1,v_2,\ldots,v_{2^n-1})^T\in \mathbb{C}^{2^n}$ with $\|v\|_2 = 1$. The problem is of fundamental importance in quantum algorithm design, Hamiltonian simulation and quantum machine learning, yet its circuit depth and size complexity remain open when ancillary qubits are available. In this paper, we study efficient constructions of quantum circuits with $m$ ancillary qubits that can prepare $|\psi_v\rangle$ in depth $\tilde O\left(\frac{2^n}{m+n}+n\right)$and size $O(2^n)$, achieving the optimal value for both measures simultaneously. These results also imply a depth complexity of $\Theta(4^n/(m+n))$ for quantum circuits implementing a general $n$-qubit unitary using $m = O(2^n/n)$ ancillary qubits. This resolves the depth complexity for circuits without ancillary qubits, and for circuits with exponentially many ancillary qubits, this gives a quadratic saving from $O(4^n)$ to $\tilde \Theta(2^n)$. Our circuits are deterministic, prepare the state and carry out the unitary precisely, utilize the ancillary qubits tightly and the depths are optimal in a wide range of parameter regime. The results can be viewed as (optimal) time-space tradeoff bounds, which is not only theoretically interesting, but also practically relevant in the current trend that the number of qubits starts to take off, by showing a way to use a large number of qubits to compensate the short qubit lifetime.

In this paper, we generalize the concept of strong quantum nonlocality from two aspects. First, in a tripartite quantum system, we present a construction of strongly nonlocal quantum states containing $6{(d\ensuremath{-}1)}^{2}$ orthogonal product states in ${\mathbb{C}}^{d}\ensuremath{\bigotimes}{\mathbb{C}}^{d}\ensuremath{\bigotimes}{\mathbb{C}}^{d}$ and build $6{d}^{2}\ensuremath{-}8d+4$ product states in ${\mathbb{C}}^{d}\ensuremath{\bigotimes}{\mathbb{C}}^{d}\ensuremath{\bigotimes}{\mathbb{C}}^{d+1}$, which have been proved to be strongly nonlocal. Obviously, both results turn out to be one order of magnitude smaller than the number of basis states ${d}^{3}$ for $d\ensuremath{\ge}3$. Second, we give explicit forms of strongly nonlocal orthogonal product basis in ${\mathbb{C}}^{3}\ensuremath{\bigotimes}{\mathbb{C}}^{3}\ensuremath{\bigotimes}{\mathbb{C}}^{3}\ensuremath{\bigotimes}{\mathbb{C}}^{3}$ and ${\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}$ quantum systems, where four is the largest known number of subsystems in which there exists strong quantum nonlocality without entanglement up to now. All the results positively answer the open problems raised by Halder et al. [Phys. Rev. Lett. 122, 040403 (2019)]; that is, there do exist a small number of quantum states that can demonstrate strong quantum nonlocality without entanglement.

The unremitting pursuit for quantum advantages gives rise to the discovery of a quantum-enhanced randomness processing named quantum Bernoulli factory (QBF). This quantum enhanced process can show its priority over the corresponding classical process through readily available experimental resources, thus in the near term it may be capable of accelerating the applications of classical Bernoulli factories, such as the widely used sampling algorithms. In this work, we provide the framework analysis of the QBF. We thoroughly analyze the quantum state evolution in this process, discovering the field structure of the constructible quantum states. Our framework analysis shows that naturally, the previous works can be described as specific instances of this framework. Then, as a proof of principle, we experimentally demonstrate this framework via an entangled two-photon source along with a reconfigurable photonic logic, and show the advantages of the QBF over the classical model through a classically infeasible instance. These results may stimulate the discovery of advantages of the quantum randomness processing in a wider range of tasks, as well as its potential applications., Comment: 9 pages, 4 figures

Graph isomorphism is to determine whether two graphs have the same topological structure. It plays a significant role in areas of image matching, biochemistry, and information retrieval. Quantum walk, as a novel quantum computation model, has been employed to isomorphic mapping detection to optimize the time complexity compared with a classical computation model. However, these quantum-inspired algorithms do not perform well&mdash, and even cease to work&mdash, for graphs with inherent symmetry, such as regular graphs. By analyzing the impacts of graphs symmetry on isomorphism detection, we proposed an effective graph isomorphism algorithm (MapEff) based on the discrete-time quantum walk (DTQW) to improve the accuracy of isomorphic mapping detection, especially for regular graphs. With the help of auxiliary edges, this algorithm can distinguish the symmetric nodes efficiently and, thus, deduct the qualified isomorphic mapping by rounds of selections. The experiments tested on 1585 pairs of graphs demonstrated that our algorithm has a better performance compared with other state-of-the-art algorithms.

For any bipartite state, how strongly can one subsystem be quantum correlated with another? Using the Koashi---Winter relation, we study the upper bound of purified quantum discord, which is given by the sum of the von Neumann entropy of the unmeasured subsystem and the entanglement of formation shared between the unmeasured subsystem with the environment. In particular, we find that Luo et al.'s conjecture on the quantum correlations and the Lindblad conjecture are true under the condition that the entanglement of formation vanishes. Let the discord distance be defined as the difference between the left discord and the right discord. If the Lindblad conjecture is true, we show that the joint entropy is a tight upper bound for the discord distance. Further, we obtain a necessary and sufficient condition for saturating upper bounds of purified quantum discord and discord distance separately with the equality conditions for the Araki---Lieb inequality and the Lindblad conjecture.

We investigate the upper bound on unambiguous discrimination by local operations and classical communication. We demonstrate that any set of linearly independent multipartite pure quantum states can be locally unambiguously discriminated if the number of states in the set is no more than $$\max \{d_{i}\}$$max{di}, where the space spanned by the set can be expressed in the irreducible form $$\otimes _{i=1}^{N}d_{i}$$?i=1Ndi and $$d_{i}$$di is the optimal local dimension of the $$i\hbox {th}$$ith party. That is, $$\max \{d_{i}\}$$max{di} is an upper bound. We also show that it is tight, namely there exists a set of $$\max \{d_{i}\}+1$$max{di}+1 states, in which at least one of the states cannot be locally unambiguously discriminated. Our result gives the reason why the multiqubit system is the only exception when any three quantum states are locally unambiguously distinguished.

In this paper, we study the local unitary classification for pairs (triples) of generalized Bell states, based on the local unitary equivalence of two sets. In detail, we firstly introduce some general unitary operators which give us more local unitary equivalent sets besides Clifford operators. And then we present two necessary conditions for local unitary equivalent sets which can be used to examine the local inequivalence. Following this approach, we completely classify all of pairs in $d\otimes d$ quantum system into $\prod_{j=1}^{n} (k_{j} + 1) $ LU-inequivalent pairs when the prime factorization of $d=\prod_{j=1}^{n}p_j^{k_j}$. Moreover, all of triples in $p^\alpha\otimes p^\alpha$ quantum system for prime $p$ can be partitioned into $\frac{(\alpha + 3)}{6}p^{\alpha} + O(\alpha p^{\alpha-1})$ LU-inequivalent triples, especially, when $\alpha=2$ and $p>2$, there are exactly $\lfloor \frac{5}{6}p^{2}\rfloor + \lfloor \frac{p-2}{6}+(-1)^{\lfloor\frac{p}{3}\rfloor}\frac{p}{3}\rfloor + 3$ LU-inequivalent triples., Comment: 13 pages, 2 figures

We present a necessary condition for two sets of maximally entangled states to be locally equivalent in terms of local invariants. With the help of these invariants, first, we are able to completely classify all the distinguishable and indistinguishable sets of four generalized Bell states in the $4\ensuremath{\bigotimes}4$ quantum system: there are ten inequivalent classes including three locally indistinguishable and seven locally distinguishable quadruples. All distinguishable quadruples in this case can be distinguished by using only one-way classical communication, implying that the two-way classical communication has no advantage over one-way classical communication, similar to the case of qubit lattice states. Second, we are able to completely classify all the triplets of generalized Bell states in the quantum systems of all prime dimensions as well as in some composite dimensions.

In this letter, we mainly study the local indistinguishability of mutually orthogonal maximally entangled states, which are in canonical form. Firstly, we present a feasible sufficient and necessary condition for distinguishing such states by one-way local operations and classical communication (LOCC). Secondly, for the application of this condition, we exhibit one class of maximally entangled states that can be locally distinguished with certainty. Furthermore, sets of $$d-1$$d-1 indistinguishable maximally entangled states by one-way LOCC are demonstrated in $$d \otimes d$$d?d (for $$d=7, 8, 9, 10$$d=7,8,9,10). Interestingly, we discover there exist sets of $$d-2$$d-2 such states in $$d \otimes d$$d?d (for $$d=8, 9, 10$$d=8,9,10), which are not perfectly distinguishable by one-way LOCC. Finally, we conjecture that there exist $$d-1$$d-1 or fewer indistinguishable maximally entangled states in $$d \otimes d(d \ge 5)$$d?d(d?5) by one-way LOCC.

It has been shown that for two different multipartite unitary operations U1 and U2, when tr(U1†U2) = 0, they can always be perfectly distinguished by local operations and classical communication in the single-run scenario. However, how to find the detailed scheme to complete the local discrimination is still a fascinating problem. In this paper, aiming at some U1 and U2 acting on the bipartite and tripartite space respectively, especially for U1†U2 locally unitary equivalent to the high dimensional X-type hermitian unitary matrix V with trV = 0, we put forward the explicit local distinguishing schemes in the single-run scenario.

It is known that there exist two locally operational settings, local operations with one-way and two-way classical communication. And recently, some sets of maximally entangled states have been built in specific dimensional quantum systems, which can be locally distinguished only with two-way classical communication. In this paper, we show the existence of such sets is general, through constructing such sets in all the remaining quantum systems. Specifically, such sets including p or n maximally entangled states will be built in the quantum system of (np − 1) ⊗ (np − 1) with n ≥ 3 and p being a prime number, which completes the picture that such sets do exist in every possible dimensional quantum system.

It has been shown that any two different multipartite unitary operations are perfectly distinguishable by local operations and classical communication with a finite number of runs. Meanwhile, two open questions were left. One is how to determine the minimal number of runs needed for the local discrimination and the other is whether a perfect local discrimination can be achieved by merely a sequential scheme. In this paper, we answer the two questions for some unitary operations U1 and U2 with "Equation missing" locally unitary equivalent to a diagonal unitary matrix in a product basis. Specifically, we give the minimal number of runs needed for the local discrimination, which is the same with that needed for the global discrimination. In this sense, the local operation works the same with the global one. Moreover, when adding the local property to U1 or U2, we present that the perfect local discrimination can be also realized by merely a sequential scheme with the minimal number of runs. Both results contribute to saving the resources used for the discrimination.

Qudit lattice states, as the generalization of qubit lattice states, are the maximally entangled states determined by qudit lattice unitaries in a ${p}^{r}\ensuremath{\bigotimes}{p}^{r}$ quantum system with $p$ being a prime and $r$ being an integer. Based on the partitions of qudit lattice unitaries into commuting sets, we present a sufficient condition for local discrimination of qudit lattice states, in which the commutativity plays an efficient role. It turns out that any set of $l$ qudit lattice states with $2\ensuremath{\le}l\ensuremath{\le}{p}^{r}$, including $k\ensuremath{\le}l$ mutually commuting qudit lattice unitaries and satisfying $l(l\ensuremath{-}1)\ensuremath{-}(k+1)(k\ensuremath{-}2)\ensuremath{\le}2{p}^{r}$, can be locally distinguished, not only extending Fan's result [H. Fan, Phys. Rev. Lett. 92, 177905 (2004)] to the prime power quantum system but also involving the local discrimination of a larger number of maximally entangled states.

In the $4\ensuremath{\bigotimes}4$ quantum system, four qubit lattice states are found to be either locally indistinguishable or distinguishable by using one-way classical communication only, presenting a curious and counterintuitive case in which two-way classical communication has no advantage. Based on these results, we explicitly construct sets of four, five, and even more maximally entangled states that can be locally distinguished only with the help of two-way classical communication, solving partially the open problem described by Nathanson [Phys. Rev. A 88, 062316 (2013)] and highlighting in more detail the difference between local operations with and without two-way classical communication in distinguishing more than three states.

In this paper, we mainly study the local indistinguishability of mutually orthogonal product basis quantum states in the high-dimensional quantum systems. In the Hilbert space of $3\ensuremath{\bigotimes}3$, Walgate and Hardy [Phys. Rev. Lett. 89, 147901 (2002)] presented a very simple proof for nonlocality of nine orthogonal product basis quantum states which are given by Bennett et al. [Phys. Rev. A 59, 1070 (1999)]. In the quantum system of $d\ensuremath{\bigotimes}d$, where $d$ is odd, we construct ${d}^{2}$ orthogonal product basis quantum states and prove these states are locally indistinguishable. Then we are able to construct some locally indistinguishable product basis quantum states in the multipartite systems. All these results reveal the phenomenon of ``nonlocality without entanglement.''

It has been known that, among pure states, $N$-qubit $W$ states cannot be uniquely determined by their arbitrary $(N\ensuremath{-}1)$ bipartite reduced density matrices. Parashar and Rana proved that among arbitrary states, $(N\ensuremath{-}1)$ bipartite reduced density matrices that the pairs of qubits constitute a star graph or a line graph can uniquely determine stochastic local operations and classical communication (SLOCC) equivalent $W$ states, and we generalize this conclusion into tree graph. In this paper, we show that all SLOCC equivalent $W$ states can be uniquely determined (among pure, mixed states) by their $(N\ensuremath{-}1)$ bipartite reduced density matrices, if the $(N\ensuremath{-}1)$ pairs of qubits constitute a tree graph on $N$ vertices, where each pair of qubits represents an edge.