Searcharxiv⌕ Search

arXiv subjects

Diane Christine Pelejo

Publications and source records attributed to Diane Christine Pelejo.

7 recordsLinked to original sources

Quantum Error Correction Scheme for Fully Correlated Noise

This paper investigates quantum error correction schemes for fully-correlated noise channels on an $n$-qubit system, where error operators take the form $W^{\otimes n}$, with $W$ being an arbitrary $2\times 2$ unitary operator. In previous literature, a recursive quantum error correction scheme can be used to protect $k$ qubits using $(k+1)$-qubit ancilla. We implement this scheme on 3-qubit and 5-qubit channels using the IBM quantum computers, where we uncover an error in the previous paper related to the decomposition of the encoding/decoding operator into elementary quantum gates. Here, we present a modified encoding/decoding operator that can be efficiently decomposed into (a) standard gates available in the \texttt{qiskit} library and (b) basic gates comprised of single-qubit gates and CNOT gates. Since IBM quantum computers perform relatively better with fewer basic gates, a more efficient decomposition gives more accurate results. Our experiments highlight the importance of an efficient decomposition for the encoding/decoding operators and demonstrate the effectiveness of our proposed schemes in correcting quantum errors. Furthermore, we explore a special type of channel with error operators of the form $σ_x^{\otimes n}, σ_y^{\otimes n}$ and $σ_z^{\otimes n}$, where $σ_x, σ_y, σ_z$ are the Pauli matrices. For these channels, we implement a hybrid quantum error correction scheme that protects both quantum and classical information using IBM's quantum computers. We conduct experiments for $n = 3, 4, 5$ and show significant improvements compared to recent work.

quant-ph↗

Construction of quantum states with special properties by projection methods

We use projection methods to construct (global) quantum states with prescribed reduced (marginal) states, and possibly with some special properties such as having specific eigenvalues, having specific rank and extreme von Neumann or Renyi entropy. Using convex analysis, optimization techniques on matrix manifolds, we obtain algorithms to solve the problem. Matlab programs are written based on these algorithms and numerical examples are illustrated. The numerical results reveal new patterns leading to new insights and research problems on the topic.

quant-ph↗

On Sign Pattern Matrices that Allow or Require Algebraic Positivity

A square matrix $M$ with real entries is said to be algebraically positive (AP) if there exists a real polynomial $p$ such that all entries of the matrix $p(M)>0$. A square sign pattern matrix $S$ is said to allow algebraic positivity if there is an algebraically positive matrix $M$ whose sign pattern class is $S$. On the other hand, $S$ is said to require algebraic positivity if any matrix $M$, having sign pattern class $S$, is algebraically positive. Motivated by open problems raised in the work of Kirkland, Qiao and Zhan (2016) on AP matrices, we list down all nonequivalent irreducible $3\times 3$ sign pattern matrices and classify each of them into three groups (i) those that require AP, (ii) those that allow but not require AP, or (iii) those that do not allow AP. We also give a necessary condition for an irreducible $n\times n$ sign pattern to allow algebraic positivity.

math.CO↗

Minimum number of non-zero-entries in a $7\times 7$ stable matrix

We prove that if a $7\times 7$ matrix is potentially stable, then it has at least 11 non-zero entries. The results for $n\times n$ matrix with $n$ up to 6 are known previously. We prove the result by making a list of possible associated digraphs with at most 10 edges, and then use algebraic conditions to show all of these digraphs or matrices cannot be potentially stable. In relation to this, we also determine the minimum number of edges in a strongly connected digraph depending on its circumference.

math.CO↗

Optimal Bounds on Functions of Quantum States under Quantum Channels

Let $ρ_1, ρ_2$ be quantum states and $(ρ_1,ρ_2) \mapsto D(ρ_1, ρ_2)$ be a scalar function such as the trace norm, the fidelity, and the relative entropy, etc. We determine optimal bounds for $D(ρ_1, Φ(ρ_2))$ for $Φ\in \mathcal{S}$ for different class of functions $D(\cdot, \cdot)$, where $\mathcal{S}$ is the set of unitary quantum channels, the set of mixed unitary channels, the set of unital quantum channels, and the set of all quantum channels.

quant-ph↗

Product of two positive contractions

Several characterizations are given for a square matrix that can be written as the product of two positive (semidefinite) projections. Based on one of these characterizations, and the theory of alternating projections, a Matlab program is written to check the condition and construct the two positive projections whose product equal to the given matrix, if they exist.

math.RA↗

Minkowski product of convex sets and product numerical range

Let $K_1, K_2$ be two compact convex sets in $\mathit{C}$. Their Minkowski product is the set $K_1K_2 = \{ab: a \in K_1, b\in K_2\}$. We show that the set $K_1K_2$ is star-shaped if $K_1$ is a line segment or a circular disk. Examples for $K_1$ and $K_2$ are given so that $K_1$ and $K_2$ are triangles (including interior) and $K_1K_2$ is not star-shaped. This gives a negative answer to a conjecture by Puchala et. al concerning the product numerical range in the study of quantum information science. Additional results and open problems are presented.

math.MG↗