Coherent attack on oblivious transfer based on single-qubit rotations

2018 ◽  
Vol 51 (15) ◽  
pp. 155301
Author(s):  
Guang Ping He
Keyword(s):  
Oblivious Transfer ◽  
Single Qubit

scholarly journals Oblivious transfer based on single-qubit rotations

2017 ◽  
Vol 50 (20) ◽  
pp. 205301 ◽  
Author(s):  
João Rodrigues ◽  
Paulo Mateus ◽  
Nikola Paunković ◽  
André Souto
Keyword(s):  
Oblivious Transfer ◽  
Single Qubit

scholarly journals DECOMPOSITION OF UNITARY MATRICES AND QUANTUM GATES

2013 ◽  
Vol 11 (01) ◽  
pp. 1350015 ◽  
Author(s):  
CHI-KWONG LI ◽  
REBECCA ROBERTS ◽  
XIAOYAN YIN
Keyword(s):  
General Scheme ◽  
Quantum Gate ◽  
Quantum Gates ◽  
Unitary Matrix ◽  
Additional Structure ◽  
Unitary Matrices ◽  
Decomposition Scheme ◽  
Single Qubit ◽  
Matlab Program

A general scheme is presented to decompose a d-by-d unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in d - 1 classes, where each class is isomorphic to the group of 2 × 2 unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on n-qubit registers can be expressed as no more than 2n-1(2n-1) fully controlled single-qubit gates chosen from 2n-1 classes, where the quantum gates in each class share the same n - 1 control qubits. Moreover, it is shown that one can easily adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.

scholarly journals Blind quantum computation where a user only performs single-qubit gates

2021 ◽  
Vol 142 ◽  
pp. 107190
Author(s):  
Qin Li ◽  
Chengdong Liu ◽  
Yu Peng ◽  
Fang Yu ◽  
Cai Zhang
Keyword(s):  
Quantum Computation ◽  
Single Qubit ◽  
Blind Quantum Computation

Arbitrary single-qubit transformations on a quantum frequency processor

2020 ◽  
Author(s):  
Hsuan-Hao Lu ◽  
Emma M. Simmerman ◽  
Pavel Lougovski ◽  
Andrew M. Weiner ◽  
Joseph M. Lukens
Keyword(s):  
Quantum Frequency ◽  
Single Qubit

scholarly journals Transforming graph states using single-qubit operations

2018 ◽  
Vol 376 (2123) ◽  
pp. 20170325 ◽  
Author(s):  
Axel Dahlberg ◽  
Stephanie Wehner
Keyword(s):  
Quantum Information ◽  
Error Correcting Codes ◽  
Graph States ◽  
Target State ◽  
Single Qubit ◽  
Minor Problem ◽  
Fixed Parameter ◽  
Source State ◽  
Quantum Error ◽  
Stabilizer States

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. What is more, we provide a recipe to obtain the sequence of LC+LPM+CC operations which prepare the desired target state from the source state, and show how these operations can be applied in parallel to reach the target state in constant time. Our algorithm has applications in quantum networks, quantum computing, and can also serve as a design tool—for example, to find transformations between quantum error correcting codes. We provide a software implementation of our algorithm that makes this tool easier to apply. A key insight leading to our algorithm is to show that the problem is equivalent to one in graph theory, which is to decide whether some graph G ′ is a vertex-minor of another graph G . The vertex-minor problem is, in general, -Complete, but can be solved efficiently on graphs which are not too complex. A measure of the complexity of a graph is the rank-width which equals the Schmidt-rank width of a subclass of stabilizer states called graph states, and thus intuitively is a measure of entanglement. Here, we show that the vertex-minor problem can be solved in time O (| G | 3 ), where | G | is the size of the graph G , whenever the rank-width of G and the size of G ′ are bounded. Our algorithm is based on techniques by Courcelle for solving fixed parameter tractable problems, where here the relevant fixed parameter is the rank width. The second half of this paper serves as an accessible but far from exhausting introduction to these concepts, that could be useful for many other problems in quantum information. This article is part of a discussion meeting issue ‘Foundations of quantum mechanics and their impact on contemporary society’.

Sign in / Sign up

Export Citation Format

Share Document