Numerical simulations of mixed states quantum computation

Highly-mixed measurement-based quantum computing and the one clean qubit model

We show that a highly-mixed state in terms of a large min-entropy is useless as a resource state for measurement-based quantum computation in the sense that if a classically efficiently verifiable problem is efficiently solved with such a highly-mixed measurement-based quantum computation then such a problem can also be classically efficiently solved. We derive a similar result also for the DQC1$_k$ model, which is a generalized version of the DQC1 model where $k$ output qubits are measured. We also show that the measurement-based quantum computing on a highly-mixed resource state in terms of …

Parameter Estimation with Mixed-State Quantum Computation

We present a quantum algorithm to estimate parameters at the quantum metrology limit using deterministic quantum computation with one bit. When the interactions occurring in a quantum system are described by a Hamiltonian $H= θH_0$, we estimate $θ$ by zooming in on previous estimations and by implementing an adaptive Bayesian procedure. The final result of the algorithm is an updated estimation of $θ$ whose variance has been decreased in proportion to the time of evolution under H. For the problem of estimating several parameters, we implement dynamical-decoupling techniques and use the result…

Computing with highly mixed states

We consider quantum computing in the k-qubit model where the starting state of a quantum computer consists of k qubits in a pure state and n-k qubits in a maximally mixed state. We ask the following question: is there a general method for simulating an arbitrary m-qubit pure state quantum computation by a quantum computation in the k-qubit model? We show that, under certain constraints, this is impossible, unless m=O(k+ log n).

Quantum Circuits with Mixed States

We define the model of quantum circuits with density matrices, where non-unitary gates are allowed. Measurements in the middle of the computation, noise and decoherence are implemented in a natural way in this model, which is shown to be equivalent in computational power to standard quantum circuits. The main result in this paper is a solution for the subroutine problem: The general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations. We give a natural definition of using genera…

On the hardness of distinguishing mixed-state quantum computations

This paper considers the following problem. Two mixed-state quantum circuits Q and R are given, and the goal is to determine which of two possibilities holds: (i) Q and R act nearly identically on all possible quantum state inputs, or (ii) there exists some input state that Q and R transform into almost perfectly distinguishable outputs. This problem may be viewed as an abstraction of the following problem: given two physical processes described by sequences of local interactions, are the processes effectively the same or are they different? We prove that this problem is a complete promise pro…

Signatures of non-classicality in mixed-state quantum computation

We investigate signatures of non-classicality in quantum states, in particular, those involved in the DQC1 model of mixed-state quantum computation [Phys. Rev. Lett. 81, 5672 (1998)]. To do so, we consider two known non-classicality criteria. The first quantifies disturbance of a quantum state under locally noneffective unitary operations (LNU), which are local unitaries acting invariantly on a subsystem. The second quantifies measurement induced disturbance (MID) in the eigenbasis of the reduced density matrices. We study the role of both figures of non-classicality in the exponential speedup…

Numerical and analytical results for geometric measure of coherence and geometric measure of entanglement

Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric measure of entanglement. On the one hand, we first provide a semidefinite algorithm to numerically calculate geometric measure of coherence for arbitrary finite-dimensional mixed states. Based on this semidefinite algorithm, we test randomly generated single-qubit states, single-qutrit states, and a special kind of $d$-dimensional mixed states. Moreover, we …

An efficient numerical method for calculating the entanglement of formation of arbitrary mixed quantum states of any dimension

We present a conjugate gradient method for calculating the entanglement of formation of arbitrary mixed quantum states of any dimension and with any bipartite division of the Hilbert space. The development of the gradient used by the algorithm, its implications for the number of states required in the optimal decomposition, and the way that conjugate gradient minimization has been adapted for this particular problem are outlined. We have found that the algorithm exhibits linear convergence for general mixed states, and that it correctly reproduces the known results for pairs of qubits and for …

规模化局部纯化最大混合态：纠缠剪枝与对称性

Locally Purified Maximally Mixed States At Scale: Entanglement Pruning and Symmetries

针对局部纯化密度算子（LPDO）表示混合态时复杂度次优的问题，通过保真度截断、等距规范变换及解析解纠缠器，在最大混合态极限下优化表示效率，并展示去极化过程中截断阈值的平滑插值。

稀疏-稠密混合编码过程中马约拉纳客体的无耗散拓扑量子计算

Dissipationless topological quantum computation for Majorana objects in sparse-dense mixed encoding process

针对基于马约拉纳客体的拓扑量子计算中费米子宇称导致的操作概率性与信息损失问题，提出可非耗散校正宇称的拓扑操作，以受控非门稀疏-稠密混合编码为例验证其不影响计算量子比特信息，适用于两类马约拉纳模拓扑量子计算。

Computational Distinguishability of Quantum Channels

The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be surprisingly hard: it is complete for the class QIP of problems that have quantum interactive proof systems, which implies that it is hard for the class PSPACE of problems solvable by a classical computation in polynomial space. Several restrictions of distinguishability are also shown to be hard. It is no easier when restricted to quantum computations of logarithmic d…