• Corpus ID: 207780663

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

@article{Dong2019ControlledQO,
  title={Controlled quantum operations and combs, and their applications to universal controllization of divisible unitary operations},
  author={Qingxiuxiong Dong and Shojun Nakayama and Akihito Soeda and Mio Murao},
  journal={arXiv: Quantum Physics},
  year={2019}
}
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. This paper proposes a mathematically consistent definition of a controlled form of general deterministic quantum operations… 
Universal control of quantum processes using sector-preserving channels
TLDR
The standard notion of control is extended to more general notions, including control of multiple channels with possibly different input and output systems, and a theoretical framework, called supermaps on routed channels, which provides a compact representation of coherent control as an operation performed on the extended channels.
Topological obstructions to implementing quantum if-clause
TLDR
The method regards a quantum circuit as a continuous function and uses topological arguments, and compared to the polynomial method [3], it excludes quantum circuits of any query complexity.
Routed quantum circuits
TLDR
It is proved that this new framework allows for a consistent and intuitive diagrammatic representation in terms of circuit diagrams, applicable to both pure and mixed quantum theory, and exemplify its use in several situations, including the superposition of quantum channels and the causal decompositions of unitaries.
Quantum algorithmic measurement
There has been recent promising experimental and theoretical evidence that quantum computational tools might enhance the precision and efficiency of physical experiments. However, a systematic
Composable constraints
TLDR
It is shown that every composable constraint encoding can be used to construct an equivalent notion of a constrained category in which morphisms are supplemented with the constraints they satisfy, and that any time-symmetric theory of relational constraints admits a faithful notion of intersection.
A categorical framework for the expression of composable constraints
Motivated by recent developments in the foundations and applications of quantum theory in which particular constraints on the behaviours of gates within a circuitbased protocol are guaranteed to be
Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation.
TLDR
A universal construction of success-or-draw structure that works for any probabilistic higher-order transformation on unitary operations is provided and a semidefinite programming approach is presented to obtain optimal success- or-draw protocols and the problem of inverting a general unitary operation is analyzed.
Quantum operations with indefinite time direction
The fundamental dynamics of quantum particles is neutral with respect to the arrow of time. And yet, our experiments are not: we observe quantum systems evolving from the past to the future, but not
Topological obstructions to implementing controlled unknown unitaries
Is a quantum algorithm capable of implementing an if-clause? Given a black-box subroutine, a $d$-dimensional unitary $U\in U(d)$, a quantum if-clause would correspond to applying it to an input qudit
Coherent Quantum Channel Discrimination
  • M. Wilde
  • Computer Science
    2020 IEEE International Symposium on Information Theory (ISIT)
  • 2020
TLDR
It is proved that this success probability of distilling a Bell state does not increase under the action of a quantum super-channel, thus establishing this measure as a fundamental measure of channel distinguishability.
...
...

References

SHOWING 1-10 OF 42 REFERENCES
Communication through coherent control of quantum channels
TLDR
This work shows that, when quantum channels are controlled coherently, information about their specific implementation is accessible in the output state of the joint control-target system and allows two different implementations of what is usually considered to be the same channel to therefore be differentiated.
Quantum algorithm for universal implementation of the projective measurement of energy.
TLDR
This Letter presents a PME protocol without quantum tomography for Hamiltonians whose dimension and energy scale are given but which are otherwise unknown, and shows that computational quantum algorithms, with suitable modifications, have applications beyond their original context.
Transforming quantum operations: Quantum supermaps
We introduce the concept of quantum supermap, describing the most general transformation that maps an input quantum operation into an output quantum operation. Since quantum operations include as
Quantum circuit architecture.
TLDR
Unexplored quantum processing tasks, such as cloning and storing or retrieving of gates, can be optimized, along with setups for tomography and discrimination or estimation of quantum circuits.
Topological obstructions to implementing controlled unknown unitaries
Is a quantum algorithm capable of implementing an if-clause? Given a black-box subroutine, a $d$-dimensional unitary $U\in U(d)$, a quantum if-clause would correspond to applying it to an input qudit
Single-particle communication through correlated noise
When a noisy communication channel is used multiple times, the errors occurring at different times generally exhibit correlations. Here we show that, contrary to classical intuition, a single quantum
Resource theories of communication
TLDR
The resource-theoretic analysis reveals that the aforementioned criticisms on the superposition of causal orders were based on an uneven comparison between different types of quantum superpositions, exhibiting different operational features.
Completely positive linear maps on complex matrices
...
...