Related papers: Ancilla-assisted sequential approximation of nonlo…
We suggest a nanoelectromechanical setup that generates properly entangled ancillary ("ancilla") qubits for error correction algorithms in quantum computing, demonstrated as an encoder for the three-qubit bit flip code. The setup is based…
Standard quantum process tomography on a $d$-dimensional input is performed by preparing several states of an input probe that then evolve under the action of the quantum channel corresponding to the progress. The final states of the probe…
A central theme in current work in quantum information and quantum foundations is to see quantum mechanics as occupying one point in a space of possible theories, and to use this perspective to understand the special features and properties…
Computational complexity characterizes the usage of spatial and temporal resources by computational processes. In the classical theory of computation, e.g. in the Turing Machine model, computational processes employ only local space and…
Quantum nonlocality is associated with the local indistinguishability of orthogonal states. Unextendible product basis (UPB), a widely used tool in quantum information, exhibits nonlocality which is the powerful resource for quantum…
Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and…
Global existence for the nonisentropic compressible Euler equations with vacuum boundary for all adiabatic constants $\gamma > 1$ is shown through perturbations around a rich class of background nonisentropic affine motions. The notable…
We present an algorithmic construction scheme for matrix-product-operator (MPO) representations of arbitrary $U(1)$-invariant operators whenever there is an expression of the local structure in terms of a finite-states machine (FSM). Given…
As first shown by Popescu [S. Popescu, Phys. Rev. Lett. 74, 2619 (1995)], some quantum states only reveal their nonlocality when subjected to a sequence of measurements while giving rise to local correlations in standard Bell tests.…
Instantaneous measurements of non-local observables between space-like separated regions can be performed without violating causality. This feat relies on the use of entanglement. Here we propose novel protocols for this task and the…
We construct an asymptotic expansion in powers of the coupling constant directly of the cross-section for pair production and decay of fundamental unstable particles. The resonant and kinematic singularities arising in the expansion we…
This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The…
We examine the feasibility of generating continuous-variable multipartite entanglement in an intra-cavity quadruply concurrent downconversion scheme that has been proposed for the generation of cluster states by Menicucci \textit{et al.}…
We introduce a matrix product operator (MPO) encoding of the Magnus expansion and the Dyson series for one-dimensional quantum lattice models with time-dependent Hamiltonians. The MPO construction can be made accurate up to arbitrary order…
The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for classical computers. In parameterized quantum approaches, the…
We establish the entangling power of a unitary operator on a general finite-dimensional bipartite quantum system with and without ancillas, and give relations between the entangling power based on the von Neumann entropy and the entangling…
We developed a new quantum annealing (QA) algorithm for Dirichlet process mixture (DPM) models based on the Chinese restaurant process (CRP). QA is a parallelized extension of simulated annealing (SA), i.e., it is a parallel stochastic…
We investigate the task of local marking for locally implementable unitary operations. In this setting, multipartite quantum unitary channels, chosen randomly from a known set, are distributed among spatially separated parties without…
In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and…
We establish an operator algebra generalization of Watrous' theorem \cite{watrous2009} on mixing unital quantum channels (completely positive trace-preserving maps) with the completely depolarizing channel, wherein the more general objects…