نتایج جستجو برای: parity preserving gates

تعداد نتایج: 90744  

2013
Naoko Kozuki Anne CC Lee Mariangela F Silveira Ayesha Sania Joshua P Vogel Linda Adair Fernando Barros Laura E Caulfield Parul Christian Wafaie Fawzi Jean Humphrey Lieven Huybregts Aroonsri Mongkolchati Robert Ntozini David Osrin Dominique Roberfroid James Tielsch Anjana Vaidya Robert E Black Joanne Katz

BACKGROUND Previous studies have reported on adverse neonatal outcomes associated with parity and maternal age. Many of these studies have relied on cross-sectional data, from which drawing causal inference is complex. We explore the associations between parity/maternal age and adverse neonatal outcomes using data from cohort studies conducted in low- and middle-income countries (LMIC). METHO...

Journal: :Physical review research 2022

For the efficient implementation of quantum algorithms, practical ways to generate many-body entanglement are a basic requirement. Specifically, coupling multiple qubit pairs at once can be advantageous and may provide multiqubit operations useful in construction hardware-tailored algorithms. Here we extend theory fractional state transfer harness simultaneous qubits on chain engineer set nonlo...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2012
Rocco A. Servedio Emanuele Viola

We highlight the special case of Valiant’s rigidity problem in which the low-rank matrices are truth-tables of sparse polynomials. We show that progress on this special case entails that Inner Product is not computable by small AC circuits with one layer of parity gates close to the inputs. We then prove that the sign of any −1/1 polynomial with ≤ s monomials in 2n variables disagrees with Inne...

Journal: :Physical review letters 2013
Anthony R Wright Menno Veldhorst

We introduce the concept of spinful many-particle Majorana modes with local odd operator products, thereby preserving their local statistics. We consider a superconductor-double-quantum-dot system where these modes can arise with negligible Zeeman splitting when Coulomb interactions are present. We find a reverse Mott-insulator transition, where the even- and odd-parity bands become degenerate....

Journal: :CoRR 2010
Md. Saiful Islam Muhammad Mahbubur Rahman Zerina Begum Mohd. Zulfiquar Hafiz

or Classical logic circuits dissipate heat for every bit of information that is lost. Information is lost when the input vector cannot be recovered from its corresponding output vector. Reversible logic circuit implements only the functions having one-to-one mapping between its input and output vectors and therefore naturally takes care of heating. Reversible logic design becomes one of the pro...

Journal: :Physical review 2022

In some quantum computing architectures, entanglement of an arbitrary number qubits can be generated in a single operation. This property has many potential applications, and may specifically useful for error correction (QEC). Stabilizer measurements then implemented using multiqubit gate instead several two-qubit gates, thus reducing circuit depth. this study, the toric code is used as benchma...

Journal: :Lecture Notes in Computer Science 2021

A weak pseudorandom function (WPRF) is a keyed \(f_k:\{0,1\}^n\rightarrow \{0,1\}\) such that, for random key k, collection of samples \((x, f_k(x))\), uniformly inputs x, cannot be efficiently distinguished from totally input-output pairs (x, y). We study WPRFs in \(\mathtt {AC}0[\mathtt {MOD}2] \), the class functions computable by {AC}0 \) circuits with parity gates, making following contrib...

2004
Luca Trevisan

Before we talk about bounds on the size of a circuit, let us first clarify what we mean by circuit depth and circuit size. The depth of a circuit is defined as the length of the longest path from the input to output. The size of a circuit is the number of AND and OR gates in the circuit. Note that, for our purpose, we assume all the gates have unlimited fan-in and fan-out. We define AC0 to be t...

Journal: :Quantum Information & Computation 2002
Frederic Green Steven Homer Cristopher Moore Chris Pollett

We propose definitions of QAC, the quantum analog of the classical class AC of constant-depth circuits with AND and OR gates of arbitrary fan-in, and QACC[q], the analog of the class ACC[q] where Modq gates are also allowed. We prove that parity or fanout allows us to construct quantum MODq gates in constant depth for any q, so QACC[2] = QACC. More generally, we show that for any q, p > 1, MODq...

2014
Santanu Santra Utpal Roy

Quantum-dot Cellular Automata (QCA) is one of the most substitute emerging nanotechnologies for electronic circuits, because of lower power consumption, higher speed and smaller size in comparison with CMOS technology. The basic devices, a Quantum-dot cell can be used to implement logic gates and wires. As it is the fundamental building block on nanotechnology circuits. By applying XOR gate the...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید