Depth-2 QAC circuits cannot simulate quantum parity

05/25/2020
by   Daniel Padé, et al.
0

We show that the quantum parity gate on n > 3 qubits cannot be cleanly simulated by a quantum circuit with two layers of arbitrary C-SIGN gates of any arity and arbitrary 1-qubit unitary gates, regardless of the number of allowed ancilla qubits. This is the best known and first nontrivial separation between the parity gate and circuits of this form. The same bounds also apply to the quantum fanout gate. Our results are incomparable with those of Fang et al. [3], which apply to any constant depth but require a sublinear number of ancilla qubits on the simulating circuit.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2020

Bounds on the QAC^0 Complexity of Approximating Parity

QAC circuits are quantum circuits with one-qubit gates and Toffoli gates...
research
08/31/2023

Global Synthesis of CNOT Circuits with Holes

A common approach to quantum circuit transformation is to use the proper...
research
01/15/2019

Separation and approximate separation of multipartite quantum gates

The number of qubits of current quantum computers is one of the most dom...
research
03/02/2022

Implementing the fanout operation with simple pairwise interactions

It has been shown that, for even n, evolving n qubits according to a Ham...
research
06/29/2021

Importance of Diagonal Gates in Tensor Network Simulations

In this work we present two techniques that tremendously increase the pe...
research
09/10/2023

Parallel RAM from Cyclic Circuits

Known simulations of random access machines (RAMs) or parallel RAMs (PRA...
research
12/14/2018

Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security

This article defines encrypted gate, which is denoted by EG[U]:|α〉→((a,b...

Please sign up or login with your details

Forgot password? Click here to reset