Diagonal-unitary 2-design and their implementations by quantum circuits

DOI10.1142/S0219749913500627zbMATH Open1292.81018arXiv1206.4451MaRDI QIDQ5417138FDOQ5417138

Authors: Yoshifumi Nakata, Mio Murao 

Publication date: 16 May 2014

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Abstract: We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be achieved by quantum circuits composed of a few-qubit diagonal gates. We introduce diagonal-unitary $t$-designs and present two quantum circuits that implement diagonal-unitary $2$-designs with the computational basis in $N$-qubit systems. One is composed of single-qubit diagonal gates and controlled-phase gates with randomized phases, which achieves an exact diagonal-unitary $2$-design after applying the gates on all pairs of qubits. The number of required gates is $N(N-1)/2$. If the controlled-Z gates are used instead of the controlled-phase gates, the circuit cannot achieve an exact $2$-design, but achieves an $epsilon$-approximate $2$-design by applying gates on randomly selected pairs of qubits. Due to the random choice of pairs, the circuit obtains extra randomness and the required number of gates is at most $O(N^2(N+log1/epsilon))$. We also provide an application of the circuits, a protocol of generating an exact $2$-design of random states by combining the circuits with a simple classical procedure requiring $O(N)$ random classical bits.

Full work available at URL: https://arxiv.org/abs/1206.4451

Recommendations

• Generating a state \(t\)-design by diagonal quantum circuits
• Implementing unitary 2-designs using random diagonal-unitary matrices
• Unitary 2-designs from random \(X\)- and \(Z\)-diagonal unitaries
• Local random quantum circuits are approximate polynomial-designs
• Random quantum circuits are approximate 2-designs

zbMATH Keywords

commuting circuitsphase-random statesunitary \(t\)-design

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• Matrix Analysis
• Remote Preparation of Quantum States
• Quantum data hiding
• Title not available (Why is that?)
• Average entropy of a subsystem
• Aspects of generic entanglement
• Induced measures in the space of mixed quantum states
• Averaging sets: A generalization of mean values and spherical designs
• Spherical codes and designs
• Randomizing quantum states: constructions and applications
• Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements
• Large deviation bounds for \(k\)-designs
• Entropy of an n-system from its correlation with a k-reservoir
• Pseudo-random unitary operators for quantum information processing
• The emergence of typical entanglement in two-party random processes
• Subsystem dynamics under random Hamiltonian evolution
• Proof of Page’s conjecture on the average entropy of a subsystem
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
• Temporally unstructured quantum computation

Cited In (14)

• Asymptotically optimal circuits for arbitrary \(n\)-qubit diagonal computations
• Generating a state \(t\)-design by diagonal quantum circuits
• (Pseudo) random quantum states with binary phase
• Local random quantum circuits are approximate polynomial-designs: numerical results
• Constructing approximately diagonal quantum gates
• A graphical calculus for integration over random diagonal unitary matrices
• Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Commuting quantum circuits and complexity of Ising partition functions
• Implementing unitary 2-designs using random diagonal-unitary matrices
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Efficient quantum circuits for diagonal unitaries without ancillas
• Diagonal unitary and orthogonal symmetries in quantum theory. II: Evolution operators
• Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))
• Unitary 2-designs from random \(X\)- and \(Z\)-diagonal unitaries

This page was built for publication: Diagonal-unitary 2-design and their implementations by quantum circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417138)