High-Order Compact Difference Methods for Caputo-Type Variable Coefficient Fractional Sub-diffusion Equations in Conservative Form

A set of high-order compact finite difference methods is proposed for solving a class of Caputo-type fractional sub-diffusion equations in conservative form. The diffusion coefficient of the equation may be spatially variable, and the proposed methods have the global convergence order \(\mathcal{O}(\tau ^{r}+h^{4})\), where \(r\ge 2\) is a positive integer and \(\tau \) and h are the temporal and spatial steps. Such new high-order compact difference methods greatly improve the known methods in the literature. The local truncation error and the solvability of the methods are discussed in detail. By applying a discrete energy technique to the matrix form of the methods, a rigorous theoretical analysis of the stability and convergence of the methods is carried out for the case of \(2\le r\le 6\), and the optimal error estimates in the weighted \(H^{1}\), \(L^{2}\) and \(L^{\infty }\) norms are obtained for the general case of variable coefficient. Applications are given to two model problems, and some numerical results are presented to illustrate the various convergence orders of the methods.     

Unconditional Superconvergence Analysis for Nonlinear Parabolic Equation with $${\textit{EQ}}_1^{rot}$$ Nonconforming Finite Element

Nonlinear parabolic equation is studied with a linearized Galerkin finite element method. First of all, a time-discrete system is established to split the error into two parts which are called the temporal error and the spatial error, respectively. On one hand, a rigorous analysis for the regularity of the time-discrete system is presented based on the proof of the temporal error skillfully. On the other hand, the spatial error is derived \(\tau \)-independently with the above achievements. Then, the superclose result of order \(O(h^2+\tau ^2)\) in broken \(H^1\)-norm is deduced without any restriction of \(\tau \). The two typical characters of the \({\textit{EQ}}_1^{rot}\) nonconforming FE (see Lemma 1 below) play an important role in the procedure of proof. At last, numerical results are provided in the last section to confirm the theoretical analysis. Here, h is the subdivision parameter, and \(\tau \), the time step.     

A locking-free stabilized mixed finite element method for linear elasticity: the high order case

In this paper, we propose a locking-free stabilized mixed finite element method for the linear elasticity problem, which employs a jump penalty term for the displacement approximation. The continuous piecewise k-order polynomial space is used for the stress and the discontinuous piecewise \((k-1)\)-order polynomial space for the displacement, where we require that \(k\ge 3\) in the two dimensions and \(k\ge 4\) in the three dimensions. The method is proved to be stable and k-order convergent for the stress in \(H(\mathrm {div})\)-norm and for the displacement in \(L^2\)-norm. Further, the convergence does not deteriorate in the nearly incompressible or incompressible case. Finally, the numerical results are presented to illustrate the optimal convergence of the stabilized mixed method.     

Unconditional Superconvergence Analysis of a Crank–Nicolson Galerkin FEM for Nonlinear Schrödinger Equation

A linearized Crank–Nicolson Galerkin finite element method with bilinear element for nonlinear Schrödinger equation is studied. By splitting the error into two parts which are called the temporal error and the spatial error, the unconditional superconvergence result is deduced. On one hand, the regularity for a time-discrete system is presented based on the proof of the temporal error. On the other hand, the classical Ritz projection is applied to get the spatial error with order \(O(h^2)\) in \(L^2\)-norm, which plays an important role in getting rid of the restriction of \(\tau \). Then the superclose estimates of order \(O(h^2+\tau ^2)\) in \(H^1\)-norm is arrived at based on the relationship between the Ritz projection and the interpolated operator. At the same time, global superconvergence property is arrived at by the interpolated postprocessing technique. At last, three numerical examples are provided to confirm the theoretical analysis. Here, h is the subdivision parameter and \(\tau \) is the time step.     

A Weak Galerkin Method with an Over-Relaxed Stabilization for Low Regularity Elliptic Problems

A new weak Galerkin (WG) finite element method is developed and analyzed for solving second order elliptic problems with low regularity solutions in the Sobolev space \(W^{2,p}(\Omega )\) with \(p\in (1,2)\). A WG stabilizer was introduced by Wang and Ye (Math Comput 83:2101–2126, 2014) for a simpler variational formulation, and it has been commonly used since then in the WG literature. In this work, for the purpose of dealing with low regularity solutions, we propose to generalize the stabilizer of Wang and Ye by introducing a positive relaxation index to the mesh size h. The relaxed stabilization gives rise to a considerable flexibility in treating weak continuity along the interior element edges. When the norm index \(p\in (1,2]\), we strictly derive that the WG error in energy norm has an optimal convergence order \(O(h^{l+1-\frac{1}{p}-\frac{p}{4}})\) by taking the relaxed factor \(\beta =1+\frac{2}{p}-\frac{p}{2}\), and it also has an optimal convergence order \(O(h^{l+2-\frac{2}{p}})\) in \(L^2\) norm when the solution \(u\in W^{l+1,p}\) with \(p\in [1,1+\frac{2}{p}-\frac{p}{2}]\) and \(l\ge 1\). It is recovered for \(p=2\) that with the choice of \(\beta =1\), error estimates in the energy and \(L^2\) norms are optimal for the source term in the sobolev space \(L^2\). Weak variational forms of the WG method give rise to desirable flexibility in enforcing boundary conditions and can be easily implemented without requiring a sufficiently large penalty factor as in the usual discontinuous Galerkin methods. In addition, numerical results illustrate that the proposed WG method with an over-relaxed factor \(\beta (\ge 1)\) converges at optimal algebraic rates for several low regularity elliptic problems.     

Numerical Algorithm With High Spatial Accuracy for the Fractional Diffusion-Wave Equation With Neumann Boundary Conditions

A fourth-order compact algorithm is discussed for solving the time fractional diffusion-wave equation with Neumann boundary conditions. The \(L1\) discretization is applied for the time-fractional derivative and the compact difference approach for the spatial discretization. The unconditional stability and the global convergence of the compact difference scheme are proved rigorously, where a new inner product is introduced for the theoretical analysis. The convergence order is \(\mathcal{O }(\tau ^{3-\alpha }+h^4)\) in the maximum norm, where \(\tau \) is the temporal grid size and \(h\) is the spatial grid size, respectively. In addition, a Crank–Nicolson scheme is presented and the corresponding error estimates are also established. Meanwhile, a compact ADI difference scheme for solving two-dimensional case is derived and the global convergence order of \(\mathcal{O }(\tau ^{3-\alpha }+h_1^4+h_2^4)\) is given. Then extension to the case with Robin boundary conditions is also discussed. Finally, several numerical experiments are included to support the theoretical results, and some comparisons with the Crank–Nicolson scheme are presented to show the effectiveness of the compact scheme.     

Local Discontinuous Galerkin Method for Incompressible Miscible Displacement Problem in Porous Media

In this paper, we develop local discontinuous Galerkin method for the two-dimensional coupled system of incompressible miscible displacement problem. Optimal error estimates in \(L^{\infty }(0, T; L^{2})\) for concentration c, \(L^{2}(0, T; L^{2})\) for \(\nabla c\) and \(L^{\infty }(0, T; L^{2})\) for velocity \(\mathbf{u}\) are derived. The main techniques in the analysis include the treatment of the inter-element jump terms which arise from the discontinuous nature of the numerical method, the nonlinearity, and the coupling of the models. The main difficulty is how to treat the inter-element discontinuities of two independent solution variables (one from the flow equation and the other from the transport equation) at cell interfaces. Numerical experiments are shown to demonstrate the theoretical results.     

Unconditionally Optimal Error Analysis of Crank–Nicolson Galerkin FEMs for a Strongly Nonlinear Parabolic System

In this paper, we present unconditionally optimal error estimates of linearized Crank–Nicolson Galerkin finite element methods for a strongly nonlinear parabolic system in \(\mathbb {R}^d\ (d=2,3)\). However, all previous works required certain time-step conditions that were dependent on the spatial mesh size. In order to overcome several entitative difficulties caused by the strong nonlinearity of the system, the proof takes two steps. First, by using a temporal-spatial error splitting argument and a new technique, optimal \(L^2\) error estimates of the numerical schemes can be obtained under the condition \(\tau \ge h\), where \(\tau \) denotes the time-step size and h is the spatial mesh size. Second, we obtain the boundedness of numerical solutions by mathematical induction and inverse inequality when \(\tau \le h\). Then, optimal \(L^2\) and \(H^1\) error estimates are proved in a different way for such case. Numerical results are given to illustrate our theoretical analyses.     

Connecting unextendible maximally entangled base with partial Hadamard matrices

We study the unextendible maximally entangled bases (UMEB) in \(\mathbb {C}^{d}\bigotimes \mathbb {C}^{d}\) and connect the problem to the partial Hadamard matrices. We show that for a given special UMEB in \(\mathbb {C}^{d}\bigotimes \mathbb {C}^{d}\), there is a partial Hadamard matrix which cannot be extended to a Hadamard matrix in \(\mathbb {C}^{d}\). As a corollary, any \((d-1)\times d\) partial Hadamard matrix can be extended to a Hadamard matrix, which answers a conjecture about \(d=5\). We obtain that for any d there is a UMEB except for \(d=p\ \text {or}\ 2p\), where \(p\equiv 3\mod 4\) and p is a prime. The existence of different kinds of constructions of UMEBs in \(\mathbb {C}^{nd}\bigotimes \mathbb {C}^{nd}\) for any \(n\in \mathbb {N}\) and \(d=3\times 5 \times 7\) is also discussed.     

An Advection-Robust Hybrid High-Order Method for the Oseen Problem

In this work, we study advection-robust Hybrid High-Order discretizations of the Oseen equations. For a given integer \(k\geqslant 0\), the discrete velocity unknowns are vector-valued polynomials of total degree \(\leqslant \, k\) on mesh elements and faces, while the pressure unknowns are discontinuous polynomials of total degree \(\leqslant \,k\) on the mesh. From the discrete unknowns, three relevant quantities are reconstructed inside each element: a velocity of total degree \(\leqslant \,(k+1)\), a discrete advective derivative, and a discrete divergence. These reconstructions are used to formulate the discretizations of the viscous, advective, and velocity–pressure coupling terms, respectively. Well-posedness is ensured through appropriate high-order stabilization terms. We prove energy error estimates that are advection-robust for the velocity, and show that each mesh element T of diameter \(h_T\) contributes to the discretization error with an \(\mathcal {O}(h_{T}^{k+1})\)-term in the diffusion-dominated regime, an \(\mathcal {O}(h_{T}^{k+\frac{1}{2}})\)-term in the advection-dominated regime, and scales with intermediate powers of \(h_T\) in between. Numerical results complete the exposition.     

Master Lovas–Andai and equivalent formulas verifying the $$\frac{8}{33}$$ two-qubit Hilbert–Schmidt separability probability and companion rational-valued conjectures

We begin by investigating relationships between two forms of Hilbert–Schmidt two-rebit and two-qubit “separability functions”—those recently advanced by Lovas and Andai (J Phys A Math Theor 50(29):295303, 2017), and those earlier presented by Slater (J Phys A 40(47):14279, 2007). In the Lovas–Andai framework, the independent variable \(\varepsilon \in [0,1]\) is the ratio \(\sigma (V)\) of the singular values of the \(2 \times 2\) matrix \(V=D_2^{1/2} D_1^{-1/2}\) formed from the two \(2 \times 2\) diagonal blocks (\(D_1, D_2\)) of a \(4 \times 4\) density matrix \(D= \left||\rho _{ij}\right||\). In the Slater setting, the independent variable \(\mu \) is the diagonal-entry ratio \(\sqrt{\frac{\rho _{11} \rho _ {44}}{\rho _ {22} \rho _ {33}}}\)—with, of central importance, \(\mu =\varepsilon \) or \(\mu =\frac{1}{\varepsilon }\) when both \(D_1\) and \(D_2\) are themselves diagonal. Lovas and Andai established that their two-rebit “separability function” \(\tilde{\chi }_1 (\varepsilon )\) (\(\approx \varepsilon \)) yields the previously conjectured Hilbert–Schmidt separability probability of \(\frac{29}{64}\). We are able, in the Slater framework (using cylindrical algebraic decompositions [CAD] to enforce positivity constraints), to reproduce this result. Further, we newly find its two-qubit, two-quater[nionic]-bit and “two-octo[nionic]-bit” counterparts, \(\tilde{\chi _2}(\varepsilon ) =\frac{1}{3} \varepsilon ^2 \left( 4-\varepsilon ^2\right) \), \(\tilde{\chi _4}(\varepsilon ) =\frac{1}{35} \varepsilon ^4 \left( 15 \varepsilon ^4-64 \varepsilon ^2+84\right) \) and \(\tilde{\chi _8} (\varepsilon )= \frac{1}{1287}\varepsilon ^8 \left( 1155 \varepsilon ^8-7680 \varepsilon ^6+20160 \varepsilon ^4-25088 \varepsilon ^2+12740\right) \). These immediately lead to predictions of Hilbert–Schmidt separability/PPT-probabilities of \(\frac{8}{33}\), \(\frac{26}{323}\) and \(\frac{44482}{4091349}\), in full agreement with those of the “concise formula” (Slater in J Phys A 46:445302, 2013), and, additionally, of a “specialized induced measure” formula. Then, we find a Lovas–Andai “master formula,” \(\tilde{\chi _d}(\varepsilon )= \frac{\varepsilon ^d \Gamma (d+1)^3 \, _3\tilde{F}_2\left( -\frac{d}{2},\frac{d}{2},d;\frac{d}{2}+1,\frac{3 d}{2}+1;\varepsilon ^2\right) }{\Gamma \left( \frac{d}{2}+1\right) ^2}\), encompassing both even and odd values of d. Remarkably, we are able to obtain the \(\tilde{\chi _d}(\varepsilon )\) formulas, \(d=1,2,4\), applicable to full (9-, 15-, 27-) dimensional sets of density matrices, by analyzing (6-, 9, 15-) dimensional sets, with not only diagonal \(D_1\) and \(D_2\), but also an additional pair of nullified entries. Nullification of a further pair still leads to X-matrices, for which a distinctly different, simple Dyson-index phenomenon is noted. C. Koutschan, then, using his HolonomicFunctions program, develops an order-4 recurrence satisfied by the predictions of the several formulas, establishing their equivalence. A two-qubit separability probability of \(1-\frac{256}{27 \pi ^2}\) is obtained based on the operator monotone function \(\sqrt{x}\), with the use of \(\tilde{\chi _2}(\varepsilon )\).     

Indistinguishability of pure orthogonal product states by LOCC

We construct two sets of incomplete and extendible quantum pure orthogonal product states (POPS) in general bipartite high-dimensional quantum systems, which are all indistinguishable by local operations and classical communication. The first set of POPS is composed of two parts which are \(\mathcal {C}^m\otimes \mathcal {C}^{n_1}\) with \(5\le m\le n_1\) and \(\mathcal {C}^m\otimes \mathcal {C}^{n_2}\) with \(5\le m \le n_2\), where \(n_1\) is odd and \(n_2\) is even. The second one is in \(\mathcal {C}^m\otimes \mathcal {C}^n\) \((m, n\ge 4)\). Some subsets of these two sets can be extended into complete sets that local indistinguishability can be decided by noncommutativity which quantifies the quantumness of a quantum ensemble. Our study shows quantum nonlocality without entanglement.     

A Mixed Discontinuous Galerkin Method Without Interior Penalty for Time-Dependent Fourth Order Problems

A novel discontinuous Galerkin (DG) method is developed to solve time-dependent bi-harmonic type equations involving fourth derivatives in one and multiple space dimensions. We present the spatial DG discretization based on a mixed formulation and central interface numerical fluxes so that the resulting semi-discrete schemes are \(L^2\) stable even without interior penalty. For time discretization, we use Crank–Nicolson so that the resulting scheme is unconditionally stable and second order in time. We present the optimal \(L^2\) error estimate of \(O(h^{k+1})\) for polynomials of degree k for semi-discrete DG schemes, and the \(L^2\) error of \(O(h^{k+1} +(\Delta t)^2)\) for fully discrete DG schemes. Extensions to more general fourth order partial differential equations and cases with non-homogeneous boundary conditions are provided. Numerical results are presented to verify the stability and accuracy of the schemes. Finally, an application to the one-dimensional Swift–Hohenberg equation endowed with a decay free energy is presented.     

Convergence to Suitable Weak Solutions for a Finite Element Approximation of the Navier–Stokes Equations with Numerical Subgrid Scale Modeling

In this article, a Galerkin finite element approximation for a class of time–space fractional differential equation is studied, under the assumption that \(u_{tt}, u_{ttt}, u_{2\alpha ,tt}\) are continuous for \(\varOmega \times (0,T]\), but discontinuous at time \(t=0\). In spatial direction, the Galerkin finite element method is presented. And in time direction, a Crank–Nicolson time-stepping is used to approximate the fractional differential term, and the product trapezoidal method is employed to treat the temporal fractional integral term. By using the properties of the fractional Ritz projection and the fractional Ritz–Volterra projection, the convergence analyses of semi-discretization scheme and full discretization scheme are derived separately. Due to the lack of smoothness of the exact solution, the numerical accuracy does not achieve second order convergence in time, which is \(O(k^{3-\beta }+k^{3}t_{n+1}^{-\beta }+k^{3}t_{n+1}^{-\beta -1})\), \(n=0,1,\ldots ,N-1\). But the convergence order in time is shown to be greater than one. Numerical examples are also included to demonstrate the effectiveness of the proposed method.     

Numerical Methods and Comparison for the Dirac Equation in the Nonrelativistic Limit Regime

We analyze rigorously error estimates and compare numerically spatial/temporal resolution of various numerical methods for the discretization of the Dirac equation in the nonrelativistic limit regime, involving a small dimensionless parameter \(0<\varepsilon \ll 1\) which is inversely proportional to the speed of light. In this limit regime, the solution is highly oscillatory in time, i.e. there are propagating waves with wavelength \(O(\varepsilon ^2)\) and O(1) in time and space, respectively. We begin with several frequently used finite difference time domain (FDTD) methods and obtain rigorously their error estimates in the nonrelativistic limit regime by paying particular attention to how error bounds depend explicitly on mesh size h and time step \(\tau \) as well as the small parameter \(\varepsilon \). Based on the error bounds, in order to obtain ‘correct’ numerical solutions in the nonrelativistic limit regime, i.e. \(0<\varepsilon \ll 1\), the FDTD methods share the same \(\varepsilon \)-scalability on time step and mesh size as: \(\tau =O(\varepsilon ^3)\) and \(h=O(\sqrt{\varepsilon })\). Then we propose and analyze two numerical methods for the discretization of the Dirac equation by using the Fourier spectral discretization for spatial derivatives combined with the symmetric exponential wave integrator and time-splitting technique for temporal derivatives, respectively. Rigorous error bounds for the two numerical methods show that their \(\varepsilon \)-scalability is improved to \(\tau =O(\varepsilon ^2)\) and \(h=O(1)\) when \(0<\varepsilon \ll 1\). Extensive numerical results are reported to support our error estimates.     

Mutually unbiased maximally entangled bases in $$\mathbb {C}^d\otimes \mathbb {C}^d$$

We study mutually unbiased maximally entangled bases (MUMEB’s) in bipartite system \(\mathbb {C}^d\otimes \mathbb {C}^d (d \ge 3)\). We generalize the method to construct MUMEB’s given in Tao et al. (Quantum Inf Process 14:2291–2300, 2015), by using any commutative ring R with d elements and generic character of \((R,+)\) instead of \(\mathbb {Z}_d=\mathbb {Z}/d\mathbb {Z}\). Particularly, if \(d=p_1^{a_1}p_2^{a_2}\ldots p_s^{a_s}\) where \(p_1, \ldots , p_s\) are distinct primes and \(3\le p_1^{a_1}\le \cdots \le p_s^{a_s}\), we present \(p_1^{a_1}-1\) MUMEB’s in \(\mathbb {C}^d\otimes \mathbb {C}^d\) by taking \(R=\mathbb {F}_{p_1^{a_1}}\oplus \cdots \oplus \mathbb {F}_{p_s^{a_s}}\), direct sum of finite fields (Theorem 3.3).     

Hybridized Discontinuous Galerkin Method for Elliptic Interface Problems: Error Estimates Under Low Regularity Assumptions of Solutions

New hybridized discontinuous Galerkin (HDG) methods for the interface problem for elliptic equations are proposed. Unknown functions of our schemes are \(u_h\) in elements and \(\hat{u}_h\) on inter-element edges. That is, we formulate our schemes without introducing the flux variable. We assume that subdomains \(\Omega _1\) and \(\Omega _2\) are polyhedral domains and that the interface \(\Gamma =\partial \Omega _1\cap \partial \Omega _2\) is polyhedral surface or polygon. Moreover, \(\Gamma \) is assumed to be expressed as the union of edges of some elements. We deal with the case where the interface is transversely connected with the boundary of the whole domain \(\overline{\Omega }=\overline{\Omega _1\cap \Omega _2}\). Consequently, the solution u of the interface problem may not have a sufficient regularity, say \(u\in H^2(\Omega )\) or \(u|_{\Omega _1}\in H^2(\Omega _1)\), \(u|_{\Omega _2}\in H^2(\Omega _2)\). We succeed in deriving optimal order error estimates in an HDG norm and the \(L^2\) norm under low regularity assumptions of solutions, say \(u|_{\Omega _1}\in H^{1+s}(\Omega _1)\) and \(u|_{\Omega _2}\in H^{1+s}(\Omega _2)\) for some \(s\in (1/2,1]\), where \(H^{1+s}\) denotes the fractional order Sobolev space. Numerical examples to validate our results are also presented.     

Cost-efficient design of a quantum multiplier–accumulator unit

This paper proposes a cost-efficient quantum multiplier–accumulator unit. The paper also presents a fast multiplication algorithm and designs a novel quantum multiplier device based on the proposed algorithm with the optimum time complexity as multiplier is the major device of a multiplier–accumulator unit. We show that the proposed multiplication technique has time complexity \(O((3 {\hbox {log}}_{2}n)+1)\), whereas the best known existing technique has \(O(n{\hbox {log}}_{2} n)\), where n is the number of qubits. In addition, our design proposes three new quantum circuits: a circuit representing a quantum full-adder, a circuit known as quantum ANDing circuit, which performs the ANDing operation and a circuit presenting quantum accumulator. Moreover, the proposed quantum multiplier–accumulator unit is the first ever quantum multiplier–accumulator circuit in the literature till now, which has reduced garbage outputs and ancillary inputs to a great extent. The comparative study shows that the proposed quantum multiplier performs better than the existing multipliers in terms of depth, quantum gates, delays, area and power with the increasing number of qubits. Moreover, we design the proposed quantum multiplier–accumulator unit, which performs better than the existing ones in terms of hardware and delay complexities, e.g., the proposed (\(n\times n\))—qubit quantum multiplier–accumulator unit requires \(O(n^{2})\) hardware and \(O({\hbox {log}}_{2}n)\) delay complexities, whereas the best known existing quantum multiplier–accumulator unit requires \(O(n^{3})\) hardware and \(O((n-1)^{2} +1+n)\) delay complexities. In addition, the proposed design achieves an improvement of 13.04, 60.08 and 27.2% for \(4\times 4\), 7.87, 51.8 and 27.1% for \(8\times 8\), 4.24, 52.14 and 27% for \(16\times 16\), 2.19, 52.15 and 27.26% for \(32 \times 32\) and 0.78, 52.18 and 27.28% for \(128 \times 128\)-qubit multiplications over the best known existing approach in terms of number of quantum gates, ancillary inputs and garbage outputs, respectively. Moreover, on average, the proposed design gains an improvement of 5.62% in terms of area and power consumptions over the best known existing approach.     

New asymmetric quantum codes over $$F_{q}$$

Two families of new asymmetric quantum codes are constructed in this paper. The first family is the asymmetric quantum codes with length \(n=q^{m}-1\) over \(F_{q}\), where \(q\ge 5\) is a prime power. The second one is the asymmetric quantum codes with length \(n=3^{m}-1\). These asymmetric quantum codes are derived from the CSS construction and pairs of nested BCH codes. Moreover, let the defining set \(T_{1}=T_{2}^{-q}\), then the real Z-distance of our asymmetric quantum codes are much larger than \(\delta _\mathrm{max}+1\), where \(\delta _\mathrm{max}\) is the maximal designed distance of dual-containing narrow-sense BCH code, and the parameters presented here have better than the ones available in the literature.