Abstract
While the circuit model of quantum computation defines its logical depth or "computational time" in terms of temporal gate sequences, the measurement-based model could allow totally different temporal ordering and parallelization of logical gates. By developing techniques to analyze Pauli measurements on multi-qubit hypergraph states generated by the Controlled-Controlled-Z (CCZ) gates, we introduce a deterministic scheme of universal measurement-based computation. In contrast to the cluster-state scheme, where the Clifford gates are parallelizable, our scheme enjoys massive parallelization of CCZ and SWAP gates, so that the computational depth grows with the number of global applications of Hadamard gates, or, in other words, with the number of changing computational bases. A logarithmic-depth implementation of an N-times Controlled-Z gate illustrates a novel trade-off between space and time complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
