Searcharxiv⌕ Search

arXiv subjects

Mio Murao

Publications and source records attributed to Mio Murao.

At least 55 records · Page 3Linked to original sources

The quantum switch is uniquely defined by its action on unitary operations

The quantum switch is a quantum process that creates a coherent control between different unitary operations, which is often described as a quantum process which transforms a pair of unitary operations $(U_1, U_2)$ into a controlled unitary operation that coherently applies them in different orders as ${\vert {0} \rangle\!\langle {0} \vert} \otimes U_1 U_2 + {\vert {1} \rangle\!\langle {1} \vert} \otimes U_2 U_1$. This description, however, does not directly define its action on non-unitary operations. The action of the quantum switch on non-unitary operations is then chosen to be a ``natural'' extension of its action on unitary operations. In general, the action of a process on non-unitary operations is not uniquely determined by its action on unitary operations. It may be that there could be a set of inequivalent extensions of the quantum switch for non-unitary operations. We prove, however, that the natural extension is the only possibility for the quantum switch for the 2-slot case. In other words, contrary to the general case, the action of the quantum switch on non-unitary operations (as a linear and completely CP preserving supermap) is completely determined by its action on unitary operations. We also discuss the general problem of when the complete description of a quantum process is uniquely determined by its action on unitary operations and identify a set of single-slot processes which are completely defined by their action on unitary operations.

quant-ph↗

Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly

We report a deterministic and exact protocol to reverse any unknown qubit-unitary operation, which simulates the time inversion of a closed qubit system. To avoid known no-go results on universal deterministic exact unitary inversion, we consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model, where the input unitary operation is called multiple times in sequence and fixed quantum circuits are inserted between the calls. In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation, and the output state in an auxiliary system can be reused as a catalyst state in another run of the unitary inversion. We also present the simplification of the semidefinite programming for searching the optimal deterministic unitary inversion protocol for an arbitrary dimension presented by M. T. Quintino and D. Ebler [Quantum $\textbf{6}$, 679 (2022)]. We show a method to reduce the large search space representing all possible protocols, which provides a useful tool for analyzing higher-order quantum transformations for unitary operations.

quant-ph↗

Distributing circuits over heterogeneous, modular quantum computing network architectures

We consider a heterogeneous network of quantum computing modules, sparsely connected via Bell states. Operations across these connections constitute a computational bottleneck and they are likely to add more noise to the computation than operations performed within a module. We introduce several techniques for transforming a given quantum circuit into one implementable on a network of the aforementioned type, minimising the number of Bell states required to do so. We extend previous works on circuit distribution over fully connected networks to the case of heterogeneous networks. On the one hand, we extend the hypergraph approach of [Andres-Martinez & Heunen. 2019] to arbitrary network topologies. We additionally make use of Steiner trees to find efficient realisations of the entanglement sharing within the network, reusing already established connections as often as possible. On the other hand, we extend the embedding techniques of [Wu, et al. 2022] to networks with more than two modules. Furthermore, we discuss how these two seemingly incompatible approaches can be made to cooperate. Our proposal is implemented and benchmarked; the results confirming that, when orchestrated, the two approaches complement each other's weaknesses.

quant-ph↗

Universal construction of decoders from encoding black boxes

Isometry operations encode the quantum information of the input system to a larger output system, while the corresponding decoding operation would be an inverse operation of the encoding isometry operation. Given an encoding operation as a black box from a $d$-dimensional system to a $D$-dimensional system, we propose a universal protocol for isometry inversion that constructs a decoder from multiple calls of the encoding operation. This is a probabilistic but exact protocol whose success probability is independent of $D$. For a qubit ($d=2$) encoded in $n$ qubits, our protocol achieves an exponential improvement over any tomography-based or unitary-embedding method, which cannot avoid $D$-dependence. We present a quantum operation that converts multiple parallel calls of any given isometry operation to random parallelized unitary operations, each of dimension $d$. Applied to our setup, it universally compresses the encoded quantum information to a $D$-independent space, while keeping the initial quantum information intact. This compressing operation is combined with a unitary inversion protocol to complete the isometry inversion. We also discover a fundamental difference between our isometry inversion protocol and the known unitary inversion protocols by analyzing isometry complex conjugation and isometry transposition. General protocols including indefinite causal order are searched using semidefinite programming for any improvement in the success probability over the parallel protocols. We find a sequential "success-or-draw" protocol of universal isometry inversion for $d = 2$ and $D = 3$, thus whose success probability exponentially improves over parallel protocols in the number of calls of the input isometry operation for the said case.

quant-ph↗

Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies

For minimum-error channel discrimination tasks that involve only unitary channels, we show that sequential strategies may outperform the parallel ones. Additionally, we show that general strategies that involve indefinite causal order are also advantageous for this task. However, for the task of discriminating a uniformly distributed set of unitary channels that forms a group, we show that parallel strategies are, indeed, optimal, even when compared to general strategies. We also show that strategies based on the quantum switch cannot outperform sequential strategies in the discrimination of unitary channels. Finally, we derive an absolute upper bound for the maximal probability of successfully discriminating any set of unitary channels with any number of copies for the most general strategies that are suitable for channel discrimination. Our bound is tight since it is saturated by sets of unitary channels forming a group k-design.

quant-ph↗

Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination

We present an instance of a task of minimum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We then establish two new classes of strategies for channel discrimination that involve indefinite causal order and show that there exists a strict hierarchy among the performance of all four strategies. Our proof technique employs a general method of computer-assisted proofs. We also provide a systematic method for finding pairs of channels that showcase this phenomenon, demonstrating that the hierarchy between the strategies is not exclusive to our main example.

quant-ph↗

Transferring quantum information between a quantum system with limited control and a quantum computer

We consider a hybrid quantum system consisting of a qubit system continuously evolving according to its fixed own Hamiltonian and a quantum computer. The qubit system couples to a quantum computer through a fixed interaction Hamiltonian, which can only be switched on and off. We present quantum algorithms to approximately transfer quantum information between the qubit system with limited control and the quantum computer under this setting. Our algorithms are programmed by the gate sequences in a closed formula for a given interface interaction Hamiltonian.

quant-ph↗

Optimal quantum discrimination of single-qubit unitary gates between two candidates

We analyze a discrimination problem of a single-qubit unitary gate with two candidates, where the candidates are not provided with their classical description, but their quantum sample is. More precisely, there are three unitary quantum gates -- one target and one sample for each of the two candidates -- whose classical description is unknown except for their dimension. The target gate is chosen equally among the candidates. We obtain the optimal protocol that maximizes the expected success probability, assuming the Haar distribution for the candidates. This problem is originally introduced in Hillery et al. (J. Mod. Opt. 2010), which provides a protocol achieving 7/8 in the expected success probability based on the ``unitary comparison" protocol of Andersson et al. (J. Phys. A 2003). The optimality of the protocol has been an open question since then. We prove the optimality of the comparison protocol, implying that only one of the two samples (one for each candidate) is needed to achieve an optimal discrimination. The optimization includes protocols outside the scope of quantum testers due to the dynamic ordering of the sample and target gates within a given protocol.

quant-ph↗

Controlled quantum operations and combs, and their applications to universal controllization of divisible unitary operations

Unitary operations are a fundamental component of quantum algorithms, but they seem to be far more useful if given with a "quantum control" as a controlled unitary operation. However, quantum operations are not limited to unitary operations. Nevertheless, it is not a priori clear if a controlled form of these general deterministic quantum operations can be well-defined. To provide a novel tool in the toolbox for quantum programming, we propose a mathematically consistent definition of a controlled form of deterministic but non-unitary quantum operations and, more generally, of quantum combs. We propose a "neutralization" comb, which transforms a set of input quantum operations to the identity operation, and study its controlled form based on our definition. We propose two new quantum algorithms for universal controllization of divisible unitary operations utilizing the most coherently controlled neutralization combs.

quant-ph↗

Consequences of preserving reversibility in quantum superchannels

Similarly to quantum states, quantum operations can also be transformed by means of quantum superchannels, also known as process matrices. Quantum superchannels with multiple slots are deterministic transformations whichtake independent quantum operations as inputs. While they are enforced to respect the laws of quantum mechanics, the use of input operations may lack a definite causal order, and characterizations of general superchannels in terms of quantum objects with a physical implementation have been missing. In this paper, we provide a mathematical characterization for pure superchannels with two slots (also known as bipartite pure processes), which are superchannels preserving the reversibility of quantum operations. We show that the reversibility preserving condition restricts all pure superchannels with two slots to be either a quantum circuit only consisting of unitary operations or a coherent superposition of two unitary quantum circuits where the two input operations are differently ordered. The latter may be seen as a generalization of the quantum switch, allowing a physical interpretation for pure two-slot superchannels. An immediate corollary is that purifiable bipartite processes cannot violate device-independent causal inequalities.

quant-ph↗

Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation

Repeat-until-success strategy is a standard method to obtain success with a probability which grows exponentially in the number of iterations. However, since quantum systems are disturbed after a quantum measurement, it is not straightforward how to perform repeat-until-success strategies in certain quantum algorithms. In this paper, we propose a new structure for probabilistic higher-order transformation named success-or-draw, which allows a repeat-until-success implementation. For that we provide a universal construction of success-or-draw structure which works for any probabilistic higher-order transformation on unitary operations. We then present a semidefinite programming approach to obtain optimal success-or-draw protocols and analyze in detail the problem of inverting a general unitary operation.

quant-ph↗

Complementary properties of multiphoton quantum states in linear optics networks

We have developed a theory for accessing quantum coherences in mutually unbiased bases associated with generalized Pauli operators in multiphoton multimode linear optics networks (LONs). We show a way to construct complementary Pauli measurements in multiphoton LONs and establish a theory for evaluation of their photonic measurement statistics without dealing with the computational complexity of Boson samplings. This theory extends characterization of complementary properties in single-photon LONs to multiphoton LONs employing convex-roof extension. It allows us to detect quantum properties such as entanglement using complementary Pauli measurements, which reveals the physical significance of entanglement between modes in bipartite multiphoton LONs.

quant-ph↗

Generic Entanglement Entropy for Quantum States with Symmetry

When a quantum pure state is drawn uniformly at random from a Hilbert space, the state is typically highly entangled. This property of a random state is known as generic entanglement of quantum states and has been long investigated from many perspectives, ranging from the black hole science to quantum information science. In this paper, we address the question of how symmetry of quantum states changes the properties of generic entanglement. More specifically, we study bipartite entanglement entropy of a quantum state that is drawn uniformly at random from an invariant subspace of a given symmetry. We first extend the well-known concentration formula to the one applicable to any subspace and then show that 1. quantum states in the subspaces associated with an axial symmetry are still highly entangled, though it is less than that of the quantum states without symmetry, 2. quantum states associated with the permutation symmetry are significantly less entangled, and 3. quantum states with translation symmetry are as entangled as the generic one. We also numerically investigate the phase-transition behavior of the distribution of generic entanglement, which indicates that the phase transition seems to still exist even when random states have symmetry.

quant-ph↗

Probabilistic exact universal quantum circuits for transforming unitary operations

This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are considered, parallel circuits, where the input-operations can be simultaneously, adaptive circuits, where sequential uses of the input-operations are allowed, and general protocols, where the use of the input-operations may be performed without a definite causal order. For these three classes, we develop a systematic semidefinite programming approach that finds a circuit which obtains the desired transformation with the maximal success probability. We then analyse in detail three particular transformations; unitary transposition, unitary complex conjugation, and unitary inversion. For unitary transposition and unitary inverse, we prove that for any fixed dimension $d$, adaptive circuits have an exponential improvement in terms of uses $k$ when compared to parallel ones. For unitary complex conjugation and unitary inversion we prove that if the number of uses $k$ is strictly smaller than $d-1$, the probability of success is necessarily zero. We also discuss the advantage of indefinite causal order protocols over causal ones and introduce the concept of delayed input-state quantum circuits.

quant-ph↗

Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations

Given a quantum gate implementing a $d$-dimensional unitary operation $U_d$, without any specific description but $d$, and permitted to use $k$ times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse $U_d^{-1}$, whose failure probability decays, exponentially in $k$. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires $k\geq d-1$, proven necessary for exact implementation of $U_d^{-1}$ with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, $k\geq d-1$ uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given $k$ and $d$. The optimal values are computed using semidefinite programming solvers for $k\leq 3$ when $d=2$ and $k\leq 2$ for $d=3$. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.

quant-ph↗

Complex conjugation supermap of unitary quantum maps and its universal implementation protocol

A complex conjugation of unitary quantum map is a second-order map (supermap) that maps a unitary operator $U$ to its complex conjugate $U^*$. First, we present a deterministic quantum protocol that universally implements the complex conjugation supermap when we are given a blackbox quantum circuit, guaranteed to implement some unitary operation, whose only known description is its dimension. We then discuss the complex conjugation supermap in the context of entanglement theory and derive a conjugation-based expression of the $G$-concurrence. Finally, we present a physical process involving identical fermions from which the complex conjugation protocol is derived as a simulation of the process using qudits.

quant-ph↗

Robust controllability of two-qubit Hamiltonian dynamics

Quantum gates (unitary gates) on physical systems are usually implemented by controlling the Hamiltonian dynamics. When full descriptions of the Hamiltonians parameters is available, the set of implementable quantum gates is easily characterised by quantum control theory. In many real systems, however, the Hamiltonians may include unknown parameters due to the difficulty of precise measurements or instability of the system. In this paper, we consider the situation that some parameters of the Hamiltonian are unknown, but we still want to perform a robust control of a quantum gate irrespectively to the unknown parameters. The existence of such control was previously shown in single-qubit systems, and a constructive method was developed for two-qubit systems provided full single-qubit controls are available. We analytically investigate the robust controllability of two-qubit systems, and apply Lie algebraic approaches to handle the cases where only controlling one of the two qubits is allowed. We also use numerical approaches for these problems since our analytical approaches does not work in some systems.

quant-ph↗

Quantum State Merging for Arbitrarily Small-Dimensional Systems

Recent advances in quantum technology facilitate the realization of information processing using quantum computers at least on the small and intermediate scales of up to several dozens of qubits. We investigate entanglement cost required for one-shot quantum state merging, aiming at quantum state transformation on these scales. In contrast to existing coding algorithms achieving nearly optimal approximate quantum state merging on a large scale, we construct algorithms for exact quantum state merging so that the algorithms are applicable to any given state of an arbitrarily small-dimensional system. In the algorithms, entanglement cost can be reduced depending on a structure of the given state derived from the Koashi-Imoto decomposition. We also provide improved converse bounds for exact quantum state merging achievable for qubits but not necessarily achievable in general. As for approximate quantum state merging, we obtain algorithms and improved converse bounds by applying smoothing to those for exact state merging. Our results are applicable to distributed quantum information processing and multipartite entanglement transformation on small and intermediate scales.

quant-ph↗