Study of quantum correlation swapping with relative entropy methods

To generate long-distance shared quantum correlations (QCs) for information processing in future quantum networks, recently we proposed the concept of QC repeater and its kernel technique named QC swapping. Besides, we extensively studied the QC swapping between two simple QC resources (i.e., a pair of Werner states) with four different methods to quantify QCs (Xie et al. in Quantum Inf Process 14:653–679, 2015). In this paper, we continue to treat the same issue by employing other three different methods associated with relative entropies, i.e., the MPSVW method (Modi et al. in Phys Rev Lett 104:080501, 2010), the Zhang method (arXiv:1011.4333 [quant-ph]) and the RS method (Rulli and Sarandy in Phys Rev A 84:042109, 2011). We first derive analytic expressions of all QCs which occur during the swapping process and then reveal their properties about monotonicity and threshold. Importantly, we find that a long-distance shared QC can be generated from two short-distance ones via QC swapping indeed. In addition, we simply compare our present results with our previous ones.     

Measurement device-independent quantum dialogue

Very recently, the experimental demonstration of quantum secure direct communication (QSDC) with state-of-the-art atomic quantum memory has been reported (Zhang et al. in Phys Rev Lett 118:220501, 2017). Quantum dialogue (QD) falls under QSDC where the secrete messages are communicated simultaneously between two legitimate parties. The successful experimental demonstration of QSDC opens up the possibilities for practical implementation of QD protocols. Thus, it is necessary to analyze the practical security issues of QD protocols for future implementation. Since the very first proposal for QD by Nguyen (Phys Lett A 328:6–10, 2004), a large number of variants and extensions have been presented till date. However, all of those leak half of the secret bits to the adversary through classical communications of the measurement results. In this direction, motivated by the idea of Lo et al. (Phys Rev Lett 108:130503, 2012), we propose a measurement device-independent quantum dialogue scheme which is resistant to such information leakage as well as side-channel attacks. In the proposed protocol, Alice and Bob, two legitimate parties, are allowed to prepare the states only. The states are measured by an untrusted third party who may himself behave as an adversary. We show that our protocol is secure under this adversarial model. The current protocol does not require any quantum memory, and thus, it is inherently robust against memory attacks. Such robustness might not be guaranteed in the QSDC protocol with quantum memory (Zhang et al. 2017).     

Superadditivity relations of the $$l_1$$ norm of coherence

Quantum coherence is an important physical resource in quantum computation and quantum information processing. Among the appropriate measures of quantum coherence, the \(l_1\) norm of coherence is a widely known coherence measure and easy to use quantifiers. In this paper, we discuss the superadditivity inequalities and strong subadditivity of the \(l_1\) norm of coherence. We show that the \(l_1\) norm of coherence is superadditive for all states, which gives a positive answer to a conjecture in Liu and Li (Int J Theor Phys 56:494, 2017).     

Violation of Bell inequalities from $$S_4$$ symmetry: the three orbits case

The recently proposed (Güney and Hillery in Phys Rev A 90:062121, 2014; Phys Rev A 91:052110, 2015) group theoretical approach to the problem of violating the Bell inequalities is applied to \(S_4\) group. The Bell inequalities based on the choice of three orbits in the representation space corresponding to standard representation of \(S_4\) are derived and their violation is described. The corresponding nonlocal games are analyzed.     

Realignment criteria for recognizing multipartite entanglement of quantum states

By multiple realignments of density matrices, we present a new separability criterion for the multipartite quantum state, which includes the computable cross-norm or realignment criterion and the multipartite partial realignment criterion as special cases. An example is used to show that the new criterion can be more efficient than the corresponding multipartite realignment criteria given in Horodecki et al. (Open Syst Inf Dyn 13:103–111, 2006) and Shen et al. (Phys Rev A 92:042332, 2015).     

Mesh generation for confined fusion plasma simulation

XGC1 and M3D-C ¹ are two fusion plasma simulation codes being developed at Princeton Plasma Physics Laboratory. XGC1 uses the particle-in-cell method to simulate gyrokinetic neoclassical physics and turbulence (Chang et al. Phys Plasmas 16(5):056108, 2009; Ku et al. Nucl Fusion 49:115021, 2009; Admas et al. J Phys 180(1):012036, 2009). M3D-\(C^1\) solves the two-fluid resistive magnetohydrodynamic equations with the \(C^1\) finite elements (Jardin J comput phys 200(1):133–152, 2004; Jardin et al. J comput Phys 226(2):2146–2174, 2007; Ferraro and Jardin J comput Phys 228(20):7742–7770, 2009; Jardin J comput Phys 231(3):832–838, 2012; Jardin et al. Comput Sci Discov 5(1):014002, 2012; Ferraro et al. Sci Discov Adv Comput, 2012; Ferraro et al. International sherwood fusion theory conference, 2014). This paper presents the software tools and libraries that were combined to form the geometry and automatic meshing procedures for these codes. Specific consideration has been given to satisfy the mesh configuration and element shape quality constraints of XGC1 and M3D-\(C^1\).     

Experimental demonstration of non-local controlled-unitary quantum gates using a five-qubit quantum computer

Local implementation of non-local quantum gates is necessary in a distributed quantum computer. Here, we demonstrate the non-local implementation of controlled-unitary quantum gates proposed by Eisert et al. (Phys Rev A 62:052317, 2000) using the five-qubit IBM quantum computer. We verify the fidelity and accuracy of the implementation through the techniques of quantum state and process tomographies.     

An approach for quantitatively analyzing the genuine tripartite nonlocality of general three-qubit states

Nonlocality is an important resource for quantum information processing. Genuine tripartite nonlocality, which is sufficiently confirmed by the violation of Svetlichny inequality, is a kind of more precious resource than the standard one. The genuine tripartite nonlocality is usually quantified by the amount of maximal violation of Svetlichny inequality. The problem of detecting and quantifying the genuine tripartite nonlocality of quantum states is of practical significance but still open for the case of general three-qubit quantum states. In this paper, we quantitatively investigate the genuine nonlocality of three-qubit states, which not only include pure states but also include mixed states. Firstly, we derive a simplified formula for the genuine nonlocality of a general three-qubit state, which is a function of the corresponding three correlation matrices. Secondly, we develop three properties of the genuine nonlocality which can help us to analyze the genuine nonlocality of complex states and understand the nature of quantum nonlocality. Further, we get analytical results of genuine nonlocality for two classes of three-qubit states which have special correlation matrices. In particular, the genuine nonlocality of generalized three-qubit GHZ states, which is derived by Ghose et al. (Phys. Rev. Lett. 102, 250404, 2009), and that of three-qubit GHZ-symmetric states, which is derived by Paul et al. (Phys. Rev. A 94, 032101, 2016), can be easily derived by applying the strategy and properties developed in this paper.     

A new coherence measure based on fidelity

Quantifying coherence is an essential endeavor for both quantum foundations and quantum technologies. In this paper, we put forward a quantitative measure of coherence by following the axiomatic definition of coherence measures introduced in Baumgratz et al. (Phys Rev Lett 113:140401, 2014). Our measure is based on fidelity and analytically computable for arbitrary states of a qubit. As one of its applications, we show that our measure can be used to examine whether a pure qubit state can be transformed into another pure or mixed qubit state only by incoherent operations.     

Nonlinear entanglement witnesses based on continuous-variable local orthogonal observables for bipartite systems

In this paper, a nonlinear entanglement witness criterion based on continuous-variable local orthogonal observables for bipartite states is established, which is strictly stronger than the the linear entanglement witnesses criterion introduced by Zhang et al. (Phys. Rev. Lett. 111:190501, 2013). This criterion is particularly applied to two-mode Gaussian states yielding a criterion in terms of the covariance matrix. Comparison with CCNR criterion is discussed.     

Direct Discontinuous Galerkin Method and Its Variations for Second Order Elliptic Equations

In this paper, we study direct discontinuous Galerkin method (Liu and Yan in SIAM J Numer Anal 47(1):475–698, 2009) and its variations (Liu and Yan in Commun Comput Phys 8(3):541–564, 2010; Vidden and Yan in J Comput Math 31(6):638–662, 2013; Yan in J Sci Comput 54(2–3):663–683, 2013) for 2nd order elliptic problems. A priori error estimate under energy norm is established for all four methods. Optimal error estimate under \(L^2\) norm is obtained for DDG method with interface correction (Liu and Yan in Commun Comput Phys 8(3):541–564, 2010) and symmetric DDG method (Vidden and Yan in J Comput Math 31(6):638–662, 2013). A series of numerical examples are carried out to illustrate the accuracy and capability of the schemes. Numerically we obtain optimal \((k+1)\)th order convergence for DDG method with interface correction and symmetric DDG method on nonuniform and unstructured triangular meshes. An interface problem with discontinuous diffusion coefficients is investigated and optimal \((k+1)\)th order accuracy is obtained. Peak solutions with sharp transitions are captured well. Highly oscillatory wave solutions of Helmholz equation are well resolved.     

Modeling and Simulation of Laser Processing of Particulate-Functionalized Materials

The objective of this paper is to focus on one of the “building blocks” of additive manufacturing technologies, namely selective laser-processing of particle-functionalized materials. Following a series of work in Zohdi (Int J Numer Methods Eng 53:1511–1532, 2002; Philos Trans R Soc Math Phys Eng Sci 361(1806):1021–1043, 2003; Comput Methods Appl Mech Eng 193(6–8):679–699, 2004; Comput Methods Appl Mech Eng 196:3927–3950, 2007; Int J Numer Methods Eng 76:1250–1279, 2008; Comput Methods Appl Mech Eng 199:79–101, 2010; Arch Comput Methods Eng 1–17. doi: 10.1007/s11831-013-9092-6, 2013; Comput Mech Eng Sci 98(3):261–277, 2014; Comput Mech 54:171–191, 2014; J Manuf Sci Eng ASME doi: 10.1115/1.4029327, 2015; CIRP J Manuf Sci Technol 10:77–83, 2015; Comput Mech 56:613–630, 2015; Introduction to computational micromechanics. Springer, Berlin, 2008; Introduction to the modeling and simulation of particulate flows. SIAM (Society for Industrial and Applied Mathematics), Philadelphia, 2007; Electromagnetic properties of multiphase dielectrics: a primer on modeling, theory and computation. Springer, Berlin, 2012), a laser-penetration model, in conjunction with a Finite Difference Time Domain Method using an immersed microstructure method, is developed. Because optical, thermal and mechanical multifield coupling is present, a recursive, staggered, temporally-adaptive scheme is developed to resolve the internal microstructural fields. The time step adaptation allows the numerical scheme to iteratively resolve the changing physical fields by refining the time-steps during phases of the process when the system is undergoing large changes on a relatively small time-scale and can also enlarge the time-steps when the processes are relatively slow. The spatial discretization grids are uniform and dense enough to capture fine-scale changes in the fields. The microstructure is embedded into the spatial discretization and the regular grid allows one to generate a matrix-free iterative formulation which is amenable to rapid computation, with minimal memory requirements, making it ideal for laptop computation. Numerical examples are provided to illustrate the modeling and simulation approach, which by design, is straightforward to computationally implement, in order to be easily utilized by researchers in the field. More advanced conduction models, based on thermal-relaxation, which are a key feature of fast-pulsing laser technologies, are also discussed.     

Notes on modified trace distance measure of coherence

We investigate the modified trace distance measure of coherence recently introduced in Yu et al. [Phys. Rev. A 94, 060302(R), 2016]. We show that for any single-qubit state, the modified trace norm of coherence is equal to the \(l_{1}\)-norm of coherence. For any d-dimensional quantum system, an analytical formula of this measure for a class of maximally coherent mixed states is provided. The trade-off relation between the coherence quantified by the new measure and the mixedness quantified by the trace norm is also discussed. Furthermore, we explore the relation between the modified trace distance measure of coherence and other measures such as the \(l_{1}\)-norm of coherence and the geometric measure of coherence.     

Two new constructions of approximately SIC-POVMs from multiplicative characters

In quantum information theory, symmetric informationally complete positive operator-valued measures (SIC-POVMs) are relevant to quantum state tomography [8], quantum cryptography [15], and foundational studies [16]. In general, it is hard to construct SIC-POVMs and only a few classes of them existed, as we know. Moreover, we do not know whether there exists an infinite class of them. Many researchers tried to construct approximately symmetric informationally complete positive operator-valued measures (ASIC-POVMs). In this paper, we propose two new constructions of ASIC-POVMs for prime power dimensions only by using multiplicative characters over finite fields.     

Distinguishing multipartite orthogonal product states by LOCC with entanglement as a resource

Recently, the method that using an entanglement as a resource to distinguish orthogonal product states by local operations and classical communication (LOCC) has brought into focus. Zhang et al. (Sci Rep 6:30493, 2016) presented protocols which use an entanglement to distinguish some classes of orthogonal product states in \(\mathbb {C}^m\otimes \mathbb {C}^n\). In this paper, we mainly study the local distinguishability of multipartite product states. For the class of locally indistinguishable multipartite product states constructed by Wang et al. (Quantum Inf Process 16:5, 2017), we present a protocol that distinguishes perfectly these quantum states by LOCC using an entangled state as a resource for implementing quantum measurements.     

Stability and Scepticism in the Modelling of Doxastic States: Probabilities and Plain Beliefs

There are two prominent ways of formally modelling human belief. One is in terms of plain beliefs (yes-or-no beliefs, beliefs simpliciter), i.e., sets of propositions. The second one is in terms of degrees of beliefs, which are commonly taken to be representable by subjective probability functions. In relating these two ways of modelling human belief, the most natural idea is a thesis frequently attributed to John Locke: a proposition is or ought to be believed (accepted) just in case its subjective probability exceeds a contextually fixed probability threshold \(t<1\). This idea is known to have two serious drawbacks: first, it denies that beliefs are closed under conjunction, and second, it may easily lead to sets of beliefs that are logically inconsistent. In this paper I present two recent accounts of aligning plain belief with subjective probability: the Stability Theory of Leitgeb (Ann Pure Appl Log 164(12):1338–1389, 2013; Philos Rev 123(2):131–171, 2014; Proc Aristot Soc Suppl Vol 89(1):143–185, 2015a; The stability of belief: an essay on rationality and coherence. Oxford University Press, Oxford, 2015b) and the Probalogical Theory (or Tracking Theory) of Lin and Kelly (Synthese 186(2):531–575, 2012a; J Philos Log 41(6):957–981, 2012b). I argue that Leitgeb’s theory may be too sceptical for the purposes of real life.     

Site recurrence of open and unitary quantum walks on the line

We study the problem of site recurrence of discrete-time nearest-neighbor open quantum random walks (OQWs) on the integer line, proving basic properties and some of its relations with the corresponding problem for unitary (coined) quantum walks (UQWs). For both kinds of walks, our discussion concerns two notions of recurrence, one given by a monitoring procedure (Grünbaum et al. in Commun Math Phys 320:543–569, 2013; Lardizabal and Souza in J Stat Phys 159:772–796, 2015), and we study their similarities and differences. In particular, by considering UQWs and OQWs induced by the same pair of matrices, we discuss the fact that recurrence of these walks is related by an additive interference term in a simple way. Based on a previous result of positive recurrence, we describe an open quantum version of Kac’s lemma for the expected return time to a site.     

WSGD-OSC Scheme for Two-Dimensional Distributed Order Fractional Reaction–Diffusion Equation

In this paper, a new numerical approximation is discussed for the two-dimensional distributed-order time fractional reaction–diffusion equation. Combining with the idea of weighted and shifted Grünwald difference (WSGD) approximation (Tian et al. in Math Comput 84:1703–1727, 2015; Wang and Vong in J Comput Phys 277:1–15, 2014) in time, we establish orthogonal spline collocation (OSC) method in space. A detailed analysis shows that the proposed scheme is unconditionally stable and convergent with the convergence order \(\mathscr {O}(\tau ^2+\Delta \alpha ^2+h^{r+1})\), where \(\tau , \Delta \alpha , h\) and r are, respectively the time step size, step size in distributed-order variable, space step size, and polynomial degree of space. Interestingly, we prove that the proposed WSGD-OSC scheme converges with the second-order in time, where OSC schemes proposed previously (Fairweather et al. in J Sci Comput 65:1217–1239, 2015; Yang et al. in J Comput Phys 256:824–837, 2014) can at most achieve temporal accuracy of order which depends on the order of fractional derivatives in the equations and is usually less than two. Some numerical results are also given to confirm our theoretical prediction.     

Allowed region and optimal measurement for information versus disturbance in quantum measurements

We present graphs of information versus disturbance for general quantum measurements of completely unknown states. Each piece of information and disturbance is quantified by two measures: (i) the Shannon entropy and estimation fidelity for the information and (ii) the operation fidelity and physical reversibility for the disturbance. These measures are calculated for a single outcome based on the general formulas derived by the present author (Terashima in Phys Rev A 93:022104, 2016) and are plotted on four types of information–disturbance planes to show their allowed regions. In addition, we discuss the graphs of these metrics averaged over all possible outcomes and the optimal measurements when saturating the upper bounds on the information for a given disturbance. The results considerably broaden the perspective of trade-offs between information and disturbances in quantum measurements.     

Superconvergent Two-Grid Methods for Elliptic Eigenvalue Problems

Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm (Xu and Zhou in Math Comput 70(233):17–25, 2001), the two-space method (Racheva and Andreev in Comput Methods Appl Math 2:171–185, 2002), the shifted inverse power method (Hu and Cheng in Math Comput 80:1287–1301, 2011; Yang and Bi in SIAM J Numer Anal 49:1602–1624, 2011), and the polynomial preserving recovery enhancing technique (Naga et al. in SIAM J Sci Comput 28:1289–1300, 2006). Our new algorithms compare favorably with some existing methods and enjoy superconvergence property.