Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Quantum computation and quantum information
Quantum computation and quantum information
Parallel Quantum Computation and Quantum Codes
SIAM Journal on Computing
On the Complexity of Quantum ACC
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Fast parallel circuits for the quantum Fourier transform
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Transformation rules for CNOT-based quantum circuits and their applications
New Generation Computing - Quantum computing
Journal of the ACM (JACM)
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Computational model underlying the one-way quantum computer
Quantum Information & Computation
Quantum Circuit Simplification and Level Compaction
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Quadratic Form Expansions for Unitaries
Theory of Quantum Computation, Communication, and Cryptography
Measurement-based and universal blind quantum computation
SFM'10 Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems
Programmable Hamiltonian for One-way Patterns
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational depth complexity of measurement-based quantum computation
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
The search for structure in quantum computation
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
An extremal result for geometries in the one-way measurement model
Quantum Information & Computation
Ancilla-driven quantum computation with twisted graph states
Theoretical Computer Science
Quantum speed-up for unsupervised learning
Machine Learning
A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth
Quantum Information & Computation
| Hi-index | 5.23 |
We present a novel automated technique for parallelizing quantum circuits via the forward and backward translation to measurement-based quantum computing patterns, and analyze the trade off in terms of depth and space complexity. As a result we distinguish a class of polynomial depth circuits that can be parallelized to logarithmic depth while adding only a polynomial number of auxiliary qubits. In particular, we provide for the first time a full characterization of patterns with flow of arbitrary depth, based on the notion of influencing walks and a simple rewriting system on the angles of the measurement. Our method provides new insight for constructing parallel circuits and as applications, we demonstrate several classes of circuits that can be parallelized to constant or logarithmic depth. Furthermore, we prove a logarithmic separation in terms of quantum depth between the quantum circuit model and the measurement-based model.