Synthesis of Quantum Logic Circuits

We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state-space of an n-qubit register is not finite and contains exponential superpositions of classical bit strings. Our proposed circuits are asymptotically optimal for respective tasks and improve published results by at least a factor of two. The circuits for generic quantum computation constructed by our algorithms are the most efficient known today in terms of the number of expensive gates (quantum controlled-NOTs). They are based on an analogue of the Shannon decomposition of Boolean functions and a new circuit block, quantum multiplexor, that generalizes several known constructions. A theoretical lower bound implies that our circuits cannot be improved by more than a factor of two. We additionally show how to accommodate the severe architectural limitation of using only nearest-neighbor gates that is representative of current implementation technologies. This increases the number of gates by almost an order of magnitude, but preserves the asymptotic optimality of gate counts.Comment: 18 pages; v5 fixes minor bugs; v4 is a complete rewrite of v3, with 6x more content, a theory of quantum multiplexors and Quantum Shannon Decomposition. A key result on generic circuit synthesis has been improved to ~23/48*4^n CNOTs for n qubit

Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer

We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin orbitals. Each spin orbital is mapped to a qubit: the states $| 1 >$ and $| 0>$ of the qubit represent, respectively, whether the spin orbital is occupied by an electron or not. To prepare a general state in the full Hilbert space of $n$ qubits, which is of dimension $2^{n}$%, $O(2^{n})$ controlled-NOT gates are needed, i.e., the number of gates scales \emph{exponentially} with the number of qubits. We make use of the fact that the state to be prepared lies in a smaller Hilbert space, and we find an algorithm that requires at most $O(2^{m+1} n^{m}/{m!})$ gates, i.e., scales \emph{polynomially} with the number of qubits $n$, provided $n\gg m$. The algorithm is simulated numerically for the cases of the hydrogen molecule and the water molecule. The numerical simulations show that when additional symmetries of the system are considered, the number of gates to prepare the state can be drastically reduced, in the examples considered in this paper, by several orders of magnitude, from the above estimate.Comment: 11 pages, 8 figures, errors are corrected, Journal information adde

Speed limits for quantum gates in multi-qubit systems

We use analytical and numerical calculations to obtain speed limits for various unitary quantum operations in multiqubit systems under typical experimental conditions. The operations that we consider include single-, two-, and three-qubit gates, as well as quantum-state transfer in a chain of qubits. We find in particular that simple methods for implementing two-qubit gates generally provide the fastest possible implementations of these gates. We also find that the three-qubit Toffoli gate time varies greatly depending on the type of interactions and the system's geometry, taking only slightly longer than a two-qubit controlled-NOT (CNOT) gate for a triangle geometry. The speed limit for quantum-state transfer across a qubit chain is set by the maximum spin-wave speed in the chain.Comment: 7 pages (two-column), 2 figures, 2 table

Minimal Universal Two-qubit Quantum Circuits

We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, best gate counts can be achieved by a single universal circuit. To compute gate parameters in universal circuits, we only use closed-form algebraic expressions, and in particular do not rely on matrix exponentials. Our algorithm has been coded in C++.Comment: 8 pages, 2 tables and 4 figures. v3 adds a discussion of asymetry between Rx, Ry and Rz gates and describes a subtle circuit design problem arising when Ry gates are not available. v2 sharpens one of the loose bounds in v1. Proof techniques in v2 are noticeably revamped: they now rely less on circuit identities and more on directly-computed invariants of two-qubit operators. This makes proofs more constructive and easier to interpret as algorithm

Floc-Flotation of Chalcopyrite from a Low Grade Cu-Zn Ore

A low grade Cu-Zn ore sample assaying 0.2% Cuand 3.6% Zn was sent by MECL for bench scale beneficiation studies to IBM, Ajmer with an objective to evolve a suitable process flow-sheet for the production of marketable grade concen-trates. Preliminary flotation studies with the ore sample indicated that it was possible to generate bulk Cu-Zn concentrate and individual Zn concentrate of marketable grade with reasonably good recovery. However, individual Cu concentrate of marketable grad was not obtained. Hence, floc-flotation technique was adopted on the ore sample to upgrade the Cu concentrate. Several parameters including pH, kerosene addition, choice of suitable frother, parti-cle size, stirring strength have been investigated for their effect on floc flotation. The floc-flotation process yielded a Cu concentrate assaying 26.42% Cu with 67% Cu recovery with wt % yield of 0.5 and 132.35 enrichment ratio. In this process addition of kerosene induces the hydrophobic flocculation which leads to the size enlarge-ment of desired mineral fines through selective aggregat-ion and enhance the flotation of chalcopyrite fine partic-les as flocs. This study demonstrates that flocflotation is a promising means for the recovery of Cu mineral fines from low grade ore sample

The cardinality of the augmentation category of a Legendrian link

We introduce a notion of cardinality for the augmentation category associated to a Legendrian knot or link in standard contact R^3. This `homotopy cardinality' is an invariant of the category and allows for a weighted count of augmentations, which we prove to be determined by the ruling polynomial of the link. We present an application to the augmentation category of doubly Lagrangian slice knots

A COMPARATIVE STUDY OF MOCHARASA SIDDHATAIL AND MAHAMASHA TAIL NASYA IN VISHVACHI

AIM: A comparative study of Mocharasa siddhatail and Mahamasha tail Nasya in Vishvachi.Objective: To study the efficacy of Mocharasa Taila Nasya in Vishvachi, compare effect of Mocharasa Taila with Mahamasha Taila, and to Study Literary explanation of Vishvachi Vyadhi.Method: Randomized single blind comparative clinical trial on 40 patients having Vishvachi and were selected for the study randomly. 20 patients were selected and treated as study group A with Mocharasa Taila for 14 days and 20 patients were selected and treated as group B with Mahamasha taila.Mocharasa taila: Authentication of Mocharasa was done in department of botany at Pune University. Standardisation of Mocharasa taila was done in Department of Rasa shastra Bhaishajakalpana vigyan at Bharati Ayurved College. Mahamasha Taila is prepared from Shankar pharmacy (GMP certify no.GA/1153 Government of Gujarat drug control administration) according to Bhaishjya Ratnavali.Follow up: 0th, 7th, 14th, 15th day.Duration: Total duration study was 14 days. This study was carried out in Bharati Vidyapeeth Deemed University College of Ayurved & Hospital Pune in Year 2010 and 2011.Results: Comparing Mocharasa taila and Mahamasha taila Nasya and are equally effective in Vishvachi.Statistical Analysis: Statistical analysis shows that Mocharasa taila and Mahamasha taila are equally effective in symptoms such as Bahu Shoola, Bahu badhirya & Bahu chesta apaharana.Conclusion: Mocharasa taila and Mahamasha taila Nasya is equally effective in Vishavchi

Advanced Steganography for Hiding Data and Image using Audio-Video

Steganography is an art of hiding the secrete message that is being send in the other non secret text. The benefit of steganography is that the expected mystery message does not pull in thoughtfulness regarding itself as an object of investigation. Our point is to conceal mystery data and picture behind the sound and feature document individually with. Sound records are generally compacted for capacity or speedier transmission. Sound records can be sent in short remain solitary portions. 4LSB is used for video steganography and cryptographic algorithm for encryption and decryption. Parity coding is used for Audio Steganography

An observational study of the effect of escitalopram and etizolam in type 2 diabetes mellitus patients with depression

Background: Past decades have witnessed a rapid rise in the prevalence of diabetes mellitus; estimated to affect 415 million adults worldwide and 69.1 million adults in India. There has been an increased prevalence of diabetes associated depression, which can aggravate the symptoms of depression and diabetes associated complications. Use of tricyclic antidepressants (TCA) can disturb the glycemic control. Escitalopram is a selective serotonin reuptake inhibitor (SSRI) and Etizolam is a new safe antianxiety agent. The objective of this study was to study the prevalence of depression and anxiety in type 2 diabetes mellitus patients and to assess the efficacy of escitalopram and etizolam in the treatment of depression and/or anxiety in type 2 diabetes mellitus patients.Methods: Total 125 patients diagnosed with type 2 diabetes mellitus with fulfilling the inclusion and exclusion criteria were included in the study. Informed written consent was obtained from the patients willing to participate in the study. They were screened for the presence of depression with the help of PHQ-9. Their demographic features were recorded and initial laboratory investigations done. Haemogram, blood sugar level - fasting (BSL-F) and postprandial (PP), serum alanine transferase (ALT), serum creatinine and Urine routine analysis. Patients were started on Escitalopram (10 mg) + Etizolam (0.5 mg) daily for 30 days and others were not treated and acted as control; keeping the management of diabetes mellitus unchanged for all. Laboratory investigations were repeated after 30 days.Results: The prevalence of depression with/without anxiety was 35.2%. 51 patients treated with Escitalopram + Etizolam improved clinically and biochemically. There was a significant (P < 0.05) improvement in BSL-F and PP and HbA1C in patients treated with Escitalopram + Etizolam.Conclusions: Prevalence of depression among type 2 diabetes mellitus was found to be 35% in this study. Fifty one patients treated with escitalopram + etizolam improved clinically as well as biochemically. There was significant improvement in BSL-F, BSL-PP and HbA1c. Escitalopram may be considered as antidepressant of choice in such cases

Broad features of surface ozone variations over Indian region

Surface ozone concentration at three Indian stations - New Delhi (28.6 deg N), Pune (18.5 deg N) and Thiruvananthapuram (formerly Trivandrum (8.3 deg N) - has been measured since 1973 with the help of an electrochemical continuous ozone recorder. These stations show diurnal, seasonal and annual cycles in surface ozone. Daily changes show that the minimum value occurs at sunrise and maximum in the afternoon. As regards seasonal variations, Thiruvananthapuram and Pune have a minimum value during monsoon season (June to August) while at New Delhi the minimum value occurs in January. However, New Delhi also records low ozone amount during monsoon season identical to the amounts show at Thiruvananthapuram and Pune. The annual cycles at these stations have been compared with similar measurements in the northern and southern hemispheres. The Indian measurements agree well with the annual cycles at these stations. Further, the analysis of the Indian data indicates that the major contribution in surface ozone comes from the natural sources like stratospheric-tropospheric exchange, turbulence, and mixing in the boundary layer; however, a small contribution from anthropogenic sources cannot be ruled out at Pune and probably at New Delhi, especially in winter and summer seasons