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

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

2015
X. X. Yuan J.-J. Ma P.-Y. Hou X.-Y. Chang C. Zu L.-M. Duan

The router is a key element for a network. We describe a scheme to realize genuine quantum routing of single-photon pulses based on cascading of conditional quantum gates in a Mach-Zehnder interferometer and report a proof-of-principle experiment for its demonstration using linear optics quantum gates. The polarization of the control photon routes in a coherent way the path of the signal photon...

2005
Uzi Landman

Calculations for two electrons in an elliptic quantum dot, using symmetry breaking at the unrestricted Hartree-Fock level and subsequent restoration of the broken parity via projection techniques, show that the electrons can localize and form a molecular dimer, described by a Heitler-Londontype wave function. The calculated singlet-triplet splitting (J) as a function of the magnetic field (B) a...

Journal: :New Journal of Physics 2021

Abstract We propose VQE circuit fabrics with advantageous properties for the simulation of strongly correlated ground and excited states molecules materials under Jordan–Wigner mapping that can be implemented linearly locally preserve all relevant quantum numbers: number spin up ( ? ) down ? electrons total squared. demonstrate our entangler circuits are expressive already at low depth paramete...

Journal: :Physical review 2021

There is growing interest in the photo-induced generation of rectified current, namely photocurrent phenomenon. While response was attributed to noncentrosymmetric structures crystals, parity violation accompanied by magnetic ordering, that is, violation, recently attracting attention as a platform for generator. In this paper, we investigate current-ordered phase, realizing without spin degree...

1998
Katsunobu Imai Kenichi Morita

A reversible cellular automaton RCA is a cellular automaton CA whose global func tion is injective and every con guration has at most one predecessor Margolus showed that there is a computation universal two dimensional state RCA But his RCA has non uniform neighbor so Morita and Ueno proposed state computation universal RCA using partitioned cellular automata PCA Because PCA can be regarded as...

Journal: :IACR Cryptology ePrint Archive 2017
Yongge Wang Qutaibah M. Malluhi

Yao’s garbled circuits have been extensively used in Secure Function Evaluations (SFE). Several improvements have been proposed to improve the efficiency of garbled circuits. Kolesnikov and Schneider (2008) proposed the free-XOR technique. Naor, Pinkas, and Sumner (1999) introduced garbled row-reduction technique GRR3 to reduce each garbled gate to three ciphertexts, Pinkas et al (2009) propose...

Journal: :CoRR 2016
Dharmendra Kumar Debasis Mitra Bhargab B. Bhattacharya

Design paradigms of logic circuits with Quantum-dot Cellular Automata (QCA) have been extensively studied in the recent past. Unfortunately, due to the lack of mature fabrication support, QCA-based circuits often suffer from various types of manufacturing defects and variations, and therefore, are unreliable and error-prone. QCA-based Exclusive-OR (XOR) gates are frequently used in the construc...

2010
Siddharth Shelly Babu T Chacko B. Sunar C. K. Koc Siavash Bayat-Sarmadi Anwar Hasan

With significant advances in wired and wireless technologies and also increased shrinking in the size of VLSI circuits, many devices have become very large because they need to contain several large units. This large number of gates and in turn large number of transistors causes the devices to be more prone to faults. These faults especially in sensitive and critical applications may cause seri...

2012
Andrew M. Childs Shelby Kimmel Robin Kothari

The quantum query complexity of evaluating any read-once formula with n black-box input bits is Θ( √ n). However, the corresponding problem for read-many formulas (i.e., formulas in which the inputs have fanout) is not well understood. Although the optimal read-once formula evaluation algorithm can be applied to any formula, it can be suboptimal if the inputs have large fanout. We give an algor...

1998
Katsunobu Imai Kenichi Morita

A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every connguration has at most one predecessor. Margolus showed that there is a computation-universal two-dimensional 2-state RCA. But his RCA has non-uniform neighbor, so Morita and Ueno proposed 16-state computation-universal RCA using partitioned cellular automata (PCA). Because PCA can ...

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

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