The SWITCH test for discriminating quantum evolutions
DOI10.1088/1751-8121/acecc5arXiv1706.06564OpenAlexW2718964918MaRDI QIDQ6137662
Juan Carlos Garcia-Escartin, Pedro Chamorro-Posada
Publication date: 4 September 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.06564
Quantum computation (81P68) String and superstring theories; other extended objects (e.g., branes) in quantum field theory (81T30) Quantum optics (81V80) Dynamical systems with hyperbolic orbits and sets (37D05) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum gates (81P65) Regularization by noise (60H50) Quantum state tomography, quantum state discrimination (81P18) Quantum channels, fidelity (81P47)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to generate random matrices from the classical compact groups
- Random quantum circuits are approximate 2-designs
- Quantum computation with programmable connections between gates
- Pseudo-Random Unitary Operators for Quantum Information Processing
- Optimum unambiguous discrimination of two mixed quantum states
- Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations
- Evenly distributed unitaries: On the structure of unitary designs
- ANALYTIC ONE-BIT AND CNOT GATE CONSTRUCTIONS OF GENERAL n-QUBIT CONTROLLED GATES
- Comparison of unitary transforms
- Algorithms and Computation
- Causal and causally separable processes
- A polynomial quantum algorithm for approximating the Jones polynomial
- Direct dialling of Haar random unitary matrices
This page was built for publication: The SWITCH test for discriminating quantum evolutions
