Statistics attack on `quantum private comparison with a malicious third party' and its improvement

NASA Astrophysics Data System (ADS)

Gu, Jun; Ho, Chih-Yung; Hwang, Tzonelih

2018-02-01

Recently, Sun et al. (Quantum Inf Process:14:2125-2133, 2015) proposed a quantum private comparison protocol allowing two participants to compare the equality of their secrets via a malicious third party (TP). They designed an interesting trap comparison method to prevent the TP from knowing the final comparison result. However, this study shows that the malicious TP can use the statistics attack to reveal the comparison result. A simple modification is hence proposed to solve this problem.

Comment on "Quantum Kaniadakis entropy under projective measurement".

PubMed

Bosyk, G M; Zozor, S; Holik, F; Portesi, M; Lamberti, P W

2016-08-01

We comment on the main result given by Ourabah et al. [Phys. Rev. E 92, 032114 (2015)PLEEE81539-375510.1103/PhysRevE.92.032114], noting that it can be derived as a special case of the more general study that we have provided in [Quantum Inf Process 15, 3393 (2016)10.1007/s11128-016-1329-5]. Our proof of the nondecreasing character under projective measurements of so-called generalized (h,ϕ) entropies (that comprise the Kaniadakis family as a particular case) has been based on majorization and Schur-concavity arguments. As a consequence, we have obtained that this property is obviously satisfied by Kaniadakis entropy but at the same time is fulfilled by all entropies preserving majorization. In addition, we have seen that our result holds for any bistochastic map, being a projective measurement a particular case. We argue here that looking at these facts from the point of view given in [Quantum Inf Process 15, 3393 (2016)10.1007/s11128-016-1329-5] not only simplifies the demonstrations but allows for a deeper understanding of the entropic properties involved.

Experiments with d-wave Superconductors

NASA Astrophysics Data System (ADS)

Mannhart, J.; Hilgenkamp, H.; Hammerl, G.; Schneider, C. W.

2003-10-01

The predominant dx2-y2-wave pairing-symmetry of most high-Tc, superconductors provides the opportunity to fabricate Josephson junction circuits in which part of the junctions are biased by a phase difference of the superconducting order parameter of π. To explore the road to such π-electronics, we have fabricated and studied all-high-Tc dc superconducting quantum interference devices (dc SQUIDs) realized with thin film technology, of which the Josephson junctions consist of one standard junction and one junction with a π-phase shift. These π-SQUIDs provide clear evidence of the dx2-y2-wave symmetry of the order parameter, the amount of complex admixtures of other symmetry components being undetectably small. This seems to contradict other experiments, the results of which have been presented as evidence for an s-wave order parameter or for complex admixtures. Possible solutions to resolve this apparent contradiction are presented. In particular it is pointed out that even in the bulk of a superconductor the order parameter symmetry (the admixture of various symmetry components) may be spatially dependent.

Imaging Breathing Rate in the CO2Absorption Band.

PubMed

Fei, Jin; Zhu, Zhen; Pavlidis, Ioannis

2005-01-01

Following up on our previous work, we have developed one more non-contact method to measure human breathing rate. We have retrofitted our Mid-Wave Infra-Red (MWIR) imaging system with a narrow band-pass filter in the CO2absorption band (4.3 µm). This improves the contrast between the foreground (i.e., expired air) and background (e.g., wall). Based on the radiation information within the breath flow region, we get the mean dynamic thermal signal. This signal is quasi-periodic due to the interleaving of high and low intensities corresponding to expirations and inspirations respectively. We sample the signal at a constant rate and then determine the breathing frequency through Fourier analysis. We have performed experiments on 9 subjects at distances ranging from 6-8 ft. We compared the breathing rate computed by our novel method with ground-truth measurements obtained via a traditional contact device (PowerLab/4SP from ADInstruments with an abdominal transducer). The results show high correlation between the two modalities. For the first time, we report a Fourier based breathing rate computation method on a MWIR signal in the CO2absorption band. The method opens the way for desktop, unobtrusive monitoring of an important vital sign, that is, breathing rate. It may find widespread applications in preventive medicine as well as sustained physiological monitoring of subjects suffering from chronic ailments.

Chest computed tomography scores are predictive of survival in patients with cystic fibrosis awaiting lung transplantation.

PubMed

Loeve, Martine; Hop, Wim C J; de Bruijne, Marleen; van Hal, Peter T W; Robinson, Phil; Aitken, Moira L; Dodd, Jonathan D; Tiddens, Harm A W M

2012-05-15

Up to one-third of patients with cystic fibrosis (CF) awaiting lung transplantation (LTX) die while waiting. Inclusion of computed tomography (CT) scores may improve survival prediction models such as the lung allocation score (LAS). This study investigated the association between CT and survival in patients with CF screened for LTX. Clinical data and chest CTs of 411 patients with CF screened for LTX between 1990 and 2005 were collected from 17 centers. CTs were scored with the Severe Advanced Lung Disease (SALD) four-category scoring system, including the components infection/inflammation (INF), air trapping/hypoperfusion (AT), normal/hyperperfusion (NOR), and bulla/cysts (BUL). The volume of each component was computed using semiautomated software. Survival analysis included Kaplan-Meier curves and Cox regression models. Three hundred and sixty-six (186 males) of 411 patients entered the waiting list (median age, 23 yr; range, 5-58 yr). Subsequently, 67 of 366 (18%) died while waiting, 263 of 366 (72%) underwent LTX, and 36 of 366 (10%) were awaiting LTX at the census date. INF and LAS were significantly associated with waiting list mortality in univariate analyses. The multivariate Cox model including INF and LAS grouped in tertiles, and comparing tertiles 2 and 3 with tertile 1, showed waiting list mortality hazard ratios of 1.62 (95% confidence interval [95% CI], 0.78-3.36; P = 0.19) and 2.65 (95% CI, 1.35-5.20; P = 0.005) for INF, and 1.42 (95% CI, 0.63-3.24; P = 0.40), and 2.32 (95% CI, 1.17-4.60; P = 0.016) for LAS, respectively. These results indicated that INF and LAS had significant, independent predictive value for survival. CT score INF correlates with survival, and adds to the predictive value of LAS.

Efficient modeling of laser-plasma accelerator staging experiments using INF&RNO

NASA Astrophysics Data System (ADS)

Benedetti, C.; Schroeder, C. B.; Geddes, C. G. R.; Esarey, E.; Leemans, W. P.

2017-03-01

The computational framework INF&RNO (INtegrated Fluid & paRticle simulatioN cOde) allows for fast and accurate modeling, in 2D cylindrical geometry, of several aspects of laser-plasma accelerator physics. In this paper, we present some of the new features of the code, including the quasistatic Particle-In-Cell (PIC)/fluid modality, and describe using different computational grids and time steps for the laser envelope and the plasma wake. These and other features allow for a speedup of several orders of magnitude compared to standard full 3D PIC simulations while still retaining physical fidelity. INF&RNO is used to support the experimental activity at the BELLA Center, and we will present an example of the application of the code to the laser-plasma accelerator staging experiment.

QSAR models based on quantum topological molecular similarity.

PubMed

Popelier, P L A; Smith, P J

2006-07-01

A new method called quantum topological molecular similarity (QTMS) was fairly recently proposed [J. Chem. Inf. Comp. Sc., 41, 2001, 764] to construct a variety of medicinal, ecological and physical organic QSAR/QSPRs. QTMS method uses quantum chemical topology (QCT) to define electronic descriptors drawn from modern ab initio wave functions of geometry-optimised molecules. It was shown that the current abundance of computing power can be utilised to inject realistic descriptors into QSAR/QSPRs. In this article we study seven datasets of medicinal interest : the dissociation constants (pK(a)) for a set of substituted imidazolines , the pK(a) of imidazoles , the ability of a set of indole derivatives to displace [(3)H] flunitrazepam from binding to bovine cortical membranes , the influenza inhibition constants for a set of benzimidazoles , the interaction constants for a set of amides and the enzyme liver alcohol dehydrogenase , the natriuretic activity of sulphonamide carbonic anhydrase inhibitors and the toxicity of a series of benzyl alcohols. A partial least square analysis in conjunction with a genetic algorithm delivered excellent models. They are also able to highlight the active site, of the ligand or the molecule whose structure determines the activity. The advantages and limitations of QTMS are discussed.

Second law of thermodynamics and quantum feedback control: Maxwell's demon with weak measurements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jacobs, Kurt

2009-07-15

Recently Sagawa and Ueda [Phys. Rev. Lett. 100, 080403 (2008)] derived a bound on the work that can be extracted from a quantum system with the use of feedback control. For many quantum measurements their bound was not tight. We show that a tight version of this bound follows straightforwardly from recent work on Maxwell's demon by Alicki et al. [Open Syst. Inf. Dyn. 11, 205 (2004)], for both discrete and continuous feedback control. Our analysis also shows that bare, efficient measurements always do non-negative work on a system in equilibrium, but do not add heat.

Analysis and Improvement of Large Payload Bidirectional Quantum Secure Direct Communication Without Information Leakage

NASA Astrophysics Data System (ADS)

Liu, Zhi-Hao; Chen, Han-Wu

2018-02-01

As we know, the information leakage problem should be avoided in a secure quantum communication protocol. Unfortunately, it is found that this problem does exist in the large payload bidirectional quantum secure direct communication (BQSDC) protocol (Ye Int. J. Quantum. Inf. 11(5), 1350051 2013) which is based on entanglement swapping between any two Greenberger-Horne-Zeilinger (GHZ) states. To be specific, one half of the information interchanged in this protocol is leaked out unconsciously without any active attack from an eavesdropper. Afterward, this BQSDC protocol is revised to the one without information leakage. It is shown that the improved BQSDC protocol is secure against the general individual attack and has some obvious features compared with the original one.

Elliptic integral evaluations of Bessel moments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bailey, David H.; Borwein, Jonathan M.; Broadhurst, David

2008-01-06

We record what is known about the closed forms for variousBessel function moments arising in quantum field theory, condensed mattertheory and other parts of mathematical physics. More generally, wedevelop formulae for integrals of products of six or fewer Besselfunctions. In consequence, we are able to discover and prove closed formsfor c(n,k) := Int_0 inf tk K_0 n(t) dt, with integers n = 1, 2, 3, 4 andk greater than or equal to 0, obtaining new results for the even momentsc3,2k and c4,2k . We also derive new closed forms for the odd momentss(n,2k+1) := Int_0 inf t(2k+1) I_0(t) K_0n(t) dt,withmore » n = 3, 4 and fort(n,2k+1) := Int_0 inf t(2k+1) I_02(t) K_0(n-2) dt, with n = 5, relatingthe latter to Green functions on hexagonal, diamond and cubic lattices.We conjecture the values of s(5,2k+1), make substantial progress on theevaluation of c(5,2k+1), s(6,2k+1) and t(6,2k+1) and report more limitedprogress regarding c(5,2k), c(6,2k+1) and c(6,2k). In the process, weobtain 8 conjectural evaluations, each of which has been checked to 1200decimal places. One of these lies deep in 4-dimensional quantum fieldtheory and two are probably provable by delicate combinatorics. Thereremains a hard core of five conjectures whose proofs would be mostinstructive, to mathematicians and physicists alike.« less

Improvement of "Novel Multiparty Quantum Key Agreement Protocol with GHZ States"

NASA Astrophysics Data System (ADS)

Gu, Jun; Hwang, Tzonelih

2017-10-01

Quantum key agreement (QKA) protocol is a method for negotiating a fair and secure key among mutually untrusted participants. Recently, Xu et al. (Quantum Inf. Process. 13:2587-2594, 2014) proposed a multi-party QKA protocol based on Greenberger-Horne-Zeilinger (GHZ) states. However, this study points out that Xu et al.'s protocol cannot provide the fairness property. That is, the last involved participant in the protocol can manipulate the final shared secret key without being detected by the other participants. Moreover, according to Yu et al.'s research (2015), Xu et al.'s protocol cannot avoid the public discussion attack too. To avoid these weaknesses, an improved QKA protocol is proposed.

New quantum codes constructed from quaternary BCH codes

NASA Astrophysics Data System (ADS)

Xu, Gen; Li, Ruihu; Guo, Luobin; Ma, Yuena

2016-10-01

In this paper, we firstly study construction of new quantum error-correcting codes (QECCs) from three classes of quaternary imprimitive BCH codes. As a result, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing quaternary BCH codes are determined to be much larger than the result given according to Aly et al. (IEEE Trans Inf Theory 53:1183-1188, 2007) for each different code length. Thus, families of new QECCs are newly obtained, and the constructed QECCs have larger distance than those in the previous literature. Secondly, we apply a combinatorial construction to the imprimitive BCH codes with their corresponding primitive counterpart and construct many new linear quantum codes with good parameters, some of which have parameters exceeding the finite Gilbert-Varshamov bound for linear quantum codes.

Darwin v. 2.0: an interpreted computer language for the biosciences.

PubMed

Gonnet, G H; Hallett, M T; Korostensky, C; Bernardin, L

2000-02-01

We announce the availability of the second release of Darwin v. 2.0, an interpreted computer language especially tailored to researchers in the biosciences. The system is a general tool applicable to a wide range of problems. This second release improves Darwin version 1.6 in several ways: it now contains (1) a larger set of libraries touching most of the classical problems from computational biology (pairwise alignment, all versus all alignments, tree construction, multiple sequence alignment), (2) an expanded set of general purpose algorithms (search algorithms for discrete problems, matrix decomposition routines, complex/long integer arithmetic operations), (3) an improved language with a cleaner syntax, (4) better on-line help, and (5) a number of fixes to user-reported bugs. Darwin is made available for most operating systems free of char ge from the Computational Biochemistry Research Group (CBRG), reachable at http://chrg.inf.ethz.ch. darwin@inf.ethz.ch

Quartetting in Nuclear Matter and α Particle Condensation in Nuclear Systems

NASA Astrophysics Data System (ADS)

Röpke, G.; Schuck, P.; Horiuchi, H.; Tohsaki, A.; Funaki, Y.; Yamada, T.

2008-02-01

Alternatively to pairing, four-particle correlations may become of importance for the formation of quantum condensates in nuclear matter. With increasing density, four-particle correlations are suppressed because of Pauli blocking. Signatures of α-like clusters are expected to occur in low-density nuclear systems. The famous Hoyle state (02+ at 7.654 MeV in 12C) is identified as being an almost ideal condensate of three α-particles, hold together only by the Coulomb barrier. It, therefore, has a 8Be-α structure of low density. Transition probability and inelastic form factor together with position and other physical quantities are correctly reproduced without any adjustable parameter from our two parameter wave function of α-particle condensate type. The possibility of the existence of α-particle condensed states in heavier nα nuclei is also discussed.

Probabilistic Broadcast-Based Multiparty Remote State Preparation scheme via Four-Qubit Cluster State

NASA Astrophysics Data System (ADS)

Zhou, Yun-Jing; Tao, Yuan-Hong

2018-02-01

In this letter,we propose a broadcast-based multiparty remote state preparation scheme which realizes the process among three participants. It allows two distant receivers to obtain the arbitrary single-qubit states separately and simultaneously, and the success probability is {d2}/{1+d2}, thus generalize the results in Yu et al. (Quantum. Inf. Process 16(2), 41, 2017).

Reply to "Comment on 'Quantum Kaniadakis entropy under projective measurement' ".

PubMed

Ourabah, Kamel; Tribeche, Mouloud

2016-08-01

We rely on our proof of the nondecreasing character of quantum Kaniadakis entropy under projective measurement [Phys. Rev. E 92, 032114 (2015)PLEEE81539-375510.1103/PhysRevE.92.032114], and we put it into perspective with the results of Bosyk et al. [Quantum Inf Process 15, 3393 (2016)10.1007/s11128-016-1329-5]. Our method, adopted for the proof that Kaniadakis entropy does not decrease under a projective measurement, is based on Jensen's inequalities, while the method proposed by the authors of the Comment represents another alternative and clearly correct method to prove the same thing. Furthermore, we clarify that our interest in Kaniadakis entropy is due to the fact that this entropy has a transparent physical significance, emerging within the special relativity.

Theoretical status of the lifetime predictions:. (ΔΓ/Γ)Bs, τB+/τBd and τΛb/τBd

NASA Astrophysics Data System (ADS)

Lenz, Alexander

2002-04-01

We give a review of the theoretical status of the lifetime predictions in the standard model. In case of (ΔΓ/Γ)Bs we are already in a rather advanced stage. We obtain (Δ Γ /Γ )Bs = (9.3+3.4-4.6)%. It seems to be difficult to improve these errors substantially. In addition now some experimental results are available. For τB+/τBd and τΛb/τBd the theoretical status is much less advanced and the discrepancy between experiment and theory still remains. We conclude with a what-to-do-list for theorists.

Entanglement measures for intermediate separability of quantum states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ichikawa, Tsubasa; Sasaki, Toshihiko; Tsutsui, Izumi

We present a family of entanglement measures R{sub m} which act as indicators of separability of n-qubit quantum states into m subsystems for arbitrary 2{<=}m{<=}n. The measure R{sub m} vanishes if the state is separable into m subsystems, and for m=n it gives the Meyer-Wallach measure, while for m=2 it reduces, in effect, to the one introduced recently by Love et al. [Quantum Inf. Process. 6, 187 (2007)]. The measures R{sub m} are evaluated explicitly for the Greenberger-Horne-Zeilinger state and the W state (and its modifications, the W{sub k} or Dicke states) to show that these globally entangled states exhibitmore » rather distinct behaviors under the measures, indicating the utility of the measures R{sub m} for characterizing globally entangled states as well.« less

Local randomness: Examples and application

NASA Astrophysics Data System (ADS)

Fu, Honghao; Miller, Carl A.

2018-03-01

When two players achieve a superclassical score at a nonlocal game, their outputs must contain intrinsic randomness. This fact has many useful implications for quantum cryptography. Recently it has been observed [C. Miller and Y. Shi, Quantum Inf. Computat. 17, 0595 (2017)] that such scores also imply the existence of local randomness—that is, randomness known to one player but not to the other. This has potential implications for cryptographic tasks between two cooperating but mistrustful players. In the current paper we bring this notion toward practical realization, by offering near-optimal bounds on local randomness for the CHSH game, and also proving the security of a cryptographic application of local randomness (single-bit certified deletion).

QEPAS nitric oxide sensor based on a mid-infrared fiber-coupled quantum cascade laser

NASA Astrophysics Data System (ADS)

Ren, Wei; Shi, Chao; Wang, Zhen; Yao, Chenyu

2017-04-01

We report a quartz-enhanced photoacoustic sensor (QEPAS) for nitric oxide (NO) detection using a mid-infrared fibercoupled quantum cascade laser (QCL) near 5.2 μm. The QCL radiation was coupled into an InF3 fiber (100 μm core diameter) for light delivery to the quartz tuning fork, a tiny piezoelectric element converting the acoustic wave induced mechanical vibration to the gas-absorption associated electrical signal. This mid-infrared fiber can achieve nearly single-mode light delivery for the target wavelength. The off-beam configuration was adopted for the fiber-coupled detection considering its simpler installation, optical alignment and comparative sensitivity to the traditional on-beam setup.

Topical imiquimod before intradermal trivalent influenza vaccine for protection against heterologous non-vaccine and antigenically drifted viruses: a single-centre, double-blind, randomised, controlled phase 2b/3 trial.

PubMed

Hung, Ivan Fan-Ngai; Zhang, Anna Jinxia; To, Kelvin Kai-Wang; Chan, Jasper Fuk-Woo; Li, Patrick; Wong, Tin-Lun; Zhang, Ricky; Chan, Tuen-Ching; Chan, Brian Chun-Yuan; Wai, Harrison Ho; Chan, Lok-Wun; Fong, Hugo Pak-Yiu; Hui, Raymond Kar-Ching; Kong, Ka-Lun; Leung, Arthur Chun-Fung; Ngan, Abe Ho-Ting; Tsang, Louise Wing-Ki; Yeung, Alex Pat-Chung; Yiu, Geo Chi-Ngo; Yung, Wing; Lau, Johnson Y-N; Chen, Honglin; Chan, Kwok-Hung; Yuen, Kwok-Yung

2016-02-01

Pretreatment with topical imiquimod, a synthetic agonist of toll-like receptor 7, significantly improved the immunogenicity of influenza vaccination in elderly people. We aimed to clarify its effect in a younger age group. In this double-blind, randomised controlled trial, we enrolled healthy volunteers aged 18-30 years in early 2014 to receive the 2013-14 northern-hemisphere winter trivalent influenza vaccine at the Queen Mary Hospital, (Hong Kong, China). Eligible participants were randomly assigned (1:1:1:1) to one of the four vaccination groups: the study group, topical imiquimod-cream followed by intradermal trivalent influenza vaccine (INF-Q-ID), or one of three control groups, topical aqueous-cream control followed by intradermal trivalent influenza vaccine (INF-C-ID), topical aqueous-cream control followed by intramuscular trivalent influenza vaccine (INF-C-IM), and topical imiquimod-cream followed by intradermal normal-saline injection (SAL-Q-ID). Randomisation was by computer-generated lists in blocks of four. The type of topical treatment was masked from volunteers and investigators, although not from the study nurse. Serum haemagglutination-inhibition and microneutralisation-antibody titres were assayed. The primary outcome was seroconversion at day 7 after treatment for three vaccine strains of influenza (A/California/07/2009 H1N1-like virus [A/California/H1N1], A/Victoria/361/2011 H3N2-like virus [A/Victoria/H3N2], and B/Massachusetts/2/2012-like virus [B/Yamagata lineage]) and four non-vaccine strains (A/HK/485197/14 [H3N2 Switzerland-like lineage], prototype A/WSN/1933 [H1N1], A/HK/408027/09 [prepandemic seasonal H1N1], and B/HK/418078/11 [Victoria lineage]). Analysis was done on an intention-to-treat basis. This trial is registered with ClinicalTrials.gov, number NCT02103023. We enrolled 160 healthy volunteers between March 1 and May 31, 2014, and 40 participants were randomly assigned to each study group. For the A/California/H1N1 strain, seroconversion at day 7 occurred in 39 participants (98%) in the INF-Q-ID group, 25 (63%) in the INF-C-ID group, 18 (45%) in the INF-C-IM group, and none in the SAL-Q-ID group; for the A/Victoria/H3N2, this was 30 (75%) in the INF-Q-ID group, four (10%) in the INF-C-ID group, four (10%) in the INF-C-IM group, and none in the SAL-Q-ID group; and for the B/Massachusetts (Yamagata lineage) strain, this was 36 (90%) in the INF-Q-ID group, 27 (68%) in the INF-C-ID group, 17 (43%) in the INF-C-IM group, and one (3%) in the SAL-Q-ID group (p<0·0001 for all three vaccine strains). Adverse reactions were infrequent and self-limited and did not differ between the four groups. Furthermore, the seroconversion rate against the four non-vaccine strains was better in the INF-Q-ID group than in the control groups on days 7 and 21 (p<0·0001). The most common adverse events were grade 1 redness (five participants in the INF-Q-ID group, three in INF-C-ID, one in INF-C-IM, and one in SAL-Q-ID) and grade 1 swelling (seven participants in INF-Q-ID group, five in INF-C-ID, three in INF-C-IM, and two in SAL-Q-ID. Topical application of imiquimod before intradermal trivalent influenza vaccine significantly improved immunogenicity against the vaccine influenza strains in young healthy individuals and increased immunogenicity against the non-vaccine strains, especially the antigenically drifted H3N2 strain of 2015, which was not included in the 2013-14 recommended vaccine. Further studies should be done to establish the efficacy and safety of this approach for other injectable vaccines to augment the onset and range of protection. The Shaw Foundation Hong Kong, Health and Medical Research Fund (Hong Kong, China), The Consultancy Service for Enhancing Laboratory Surveillance of Emerging Infectious Disease for the HKSAR (Department of Health, Hong Kong, China), The Providence Foundation, Respiratory Viral Research Foundation. Copyright © 2016 Elsevier Ltd. All rights reserved.

The Biological Effect of the NanoTiO2and Its Toxicity.

PubMed

Xiao-Feng, Pang; Lewei, Liu; Zhi Hong, Liu; Qiang, Zhao

2005-01-01

The proliferation behavior of the person's liver cell under actions of the nanoTiO2has been looked into by 3-(4,5-dimethylthiazol 2-yl)-2,5 diphenyltetrazolium bromide (MTT) colorimetric method of Mosmann. In this case we first give some elementary properties of the nanoTiO2and do further the liver cell cultures, and add the nano TiO2into the cells. In accordance with biological rules we measure the proliferation state of the liver cell in normal condition. The result obtained show that the influence of the nanoTiO2on the proliferation of the person's liver cell is very small, when compared with that of the control group. We found further out the size of the toxicity of the nanoTiO2to the chick embryo fibroblast (CEF) cells by the MTT colorimetric method. Thus we determine the toxicity for the TiO2s of 100nm and of 1000nm by the toxicology which are all first score (or degree).

Lifshits Tails for Randomly Twisted Quantum Waveguides

NASA Astrophysics Data System (ADS)

Kirsch, Werner; Krejčiřík, David; Raikov, Georgi

2018-03-01

We consider the Dirichlet Laplacian H_γ on a 3D twisted waveguide with random Anderson-type twisting γ . We introduce the integrated density of states N_γ for the operator H_γ , and investigate the Lifshits tails of N_γ , i.e. the asymptotic behavior of N_γ (E) as E \\downarrow \\inf supp dN_γ . In particular, we study the dependence of the Lifshits exponent on the decay rate of the single-site twisting at infinity.

Using Pt Dopant and Sol Gel Technology for Sensitivity Enhancement of TiO2/SnO2Humidity Sensors.

PubMed

Chang, Wen-Yang; Ke, Wen-Wang; Hsieh, Yu-Sheng; Kuo, Nai-Hao; Lin, Yu-Cheng

2005-01-01

The sensitivity of the humidity sensor based on hybrid thin films of nanostructure TiO2/SnO2with Pt dopant was successfully increased. The humidity-sensitive materials, TiO2/SnO3, were prepared by sol gel technology. The microstructure of the sensing film after calcination was investigated by the Field Emission gun Scanning Electron Microscopy (FESEM) and revealed that the metal oxide hybrid had about 10 nm grain size. For studying the effect of Pt dopant on the humidity-sensitive responses, 1 ml to 10 ml of Pt standard solution was added into the colloidal solution. To compare the humidity sensor of Pt dopant with that of no Pt dopant, operational frequencies and electrode spacing were set under the relative humidity from 30 % to 95 % at the ambient temperature of 22 °C. We demonstrated that adding Pt dopant remarkably enhanced the sensitivity of TiO2/SnO2humidity sensor, and further decreased the TiO2/SnO2 resistance, which was 3.3 times lower than that without Pt dopant at the high humidity.

Assessing the Effectiveness of Increased FIO2for Enhancing Driver's Activation State Using Simulated Monotonous Driving.

PubMed

Yamakoshi, T; Yamakoshi, K; Nogawa, M; Sawada, Y; Rolfe, P; Kusakabe, M

2005-01-01

Lowering of what we term a driver's Activation State (AS) during monotonous driving conditions may increase the risk of an accident. To develop an in-car environment that allows active driving - "Biofee dforward System" - we have investigated the effects of applying a stimulus of increased inspired oxygen fraction (FIO2) supply on a driver's AS, using simulated monotonous driving. We used our previously substantiated index of As derived from beat-by-beat blood pressure (BP) response following an electrical stimulus. We have made physiological measurements including BP and found that the increased FIO2stimulus is effective in enhancing the AS. This finding was also confirmed in terms of the autonomic activity balance as well as the lengthening in time for active, safer, driving.

Ordering states with various coherence measures

NASA Astrophysics Data System (ADS)

Yang, Long-Mei; Chen, Bin; Fei, Shao-Ming; Wang, Zhi-Xi

2018-04-01

Quantum coherence is one of the most significant theories in quantum physics. Ordering states with various coherence measures is an intriguing task in quantification theory of coherence. In this paper, we study this problem by use of four important coherence measures—the l_1 norm of coherence, the relative entropy of coherence, the geometric measure of coherence and the modified trace distance measure of coherence. We show that each pair of these measures give a different ordering of qudit states when d≥3. However, for single-qubit states, the l_1 norm of coherence and the geometric coherence provide the same ordering. We also show that the relative entropy of coherence and the geometric coherence give a different ordering for single-qubit states. Then we partially answer the open question proposed in Liu et al. (Quantum Inf Process 15:4189, 2016) whether all the coherence measures give a different ordering of states.

Agroinfection-based high-throughput screening reveals specific recognition of INF elicitins in Solanum.

PubMed

Vleeshouwers, Vivianne G A A; Driesprong, Jan-David; Kamphuis, Lars G; Torto-Alalibo, Trudy; Van't Slot, Klaas A E; Govers, Francine; Visser, Richard G F; Jacobsen, Evert; Kamoun, Sophien

2006-11-01

SUMMARY We adapted and optimized the use of the Agrobacterium tumefaciens binary PVX expression system (PVX agroinfection) to screen Solanum plants for response to pathogen elicitors and applied the assay to identify a total of 11 clones of Solanum huancabambense and Solanum microdontum, out of 31 species tested, that respond to the elicitins INF1, INF2A and INF2B of Phytophthora infestans. Prior to this study, response to INF elicitins was only known in Nicotiana spp. within the Solanaceae. The identified S. huancabambense and S. microdontum clones also exhibited hypersensitivity-like cell death following infiltration with purified recombinant INF1, INF2A and INF2B, thereby validating the screening protocol. Comparison of INF elicitin activity revealed that Nicotiana plants responded to significantly lower concentrations than Solanum, suggesting variable levels of sensitivity to INF elicitins. We exploited natural variation in response to INF elicitins in the identified Solanum accessions to evaluate the relationship between INF recognition and late blight resistance. Interestingly, several INF-responsive Solanum plants were susceptible to P. infestans. Also, an S. microdontum xSolanum tuberosum (potato) population that segregates for INF response was generated but failed to identify a measurable contribution of INF response to resistance. These results suggest that in Solanum, INF elicitins are recognized as general elicitors and do not have a measurable contribution to disease resistance.

Modulation of nano-selenium on tetrodotoxin-sensitive voltage-gated sodium currents in rat dorsal root ganglion neurons.

PubMed

Yuan, Huijun; Lan, Tonghan; Lin, Jiarui

2005-01-01

Nano-Selenium, a novel Nano technology production, was demonstrated to be useful in medical and scientific researches. Here, we investigated the effects of Nano-Selenium on tetrodotoxin-sensitive (TTX-S) voltage-dependent Na⁺channels in isolated rat dorsal root ganglion neurons, using whole-cell patch-clamp method. Nano-Selenium irreversibly decreased TTX-S Na⁺current (INa) in a concentration-dependent manner and shifted the maximum of the current/voltage relationship from -67mV to -52mV, without modifying the threshold potential of the current. Nano-Selenium shifted the steady-state activation and inactivation curves to the left. In the contrast of Na2SeO3, the inhibition effect of 1nM Nano-Se was much stronger. The cell treated with 1nM Na2SeO3firstly, still respond to futher addition of 1nM Nano-Selenium. These results prove Nano-Selenium to be a novel antiagonist, acted within the channel pore, not on or near the exterior surface of the channel protein where it would experience the membrane electric field, which possesses a distinct binding site from Na2SeO3.

Safety, immunogenicity and efficacy after switching from reference infliximab to biosimilar SB2 compared with continuing reference infliximab and SB2 in patients with rheumatoid arthritis: results of a randomised, double-blind, phase III transition study

PubMed Central

Choe, Jung-Yoon; Prodanovic, Nenad; Niebrzydowski, Jaroslaw; Staykov, Ivan; Dokoupilova, Eva; Baranauskaite, Asta; Yatsyshyn, Roman; Mekic, Mevludin; Porawska, Wieslawa; Ciferska, Hana; Jedrychowicz-Rosiak, Krystyna; Zielinska, Agnieszka; Lee, Younju; Rho, Young Hee

2018-01-01

Objectives Efficacy, safety and immunogenicity results from the phase III study of SB2, a biosimilar of reference infliximab (INF), were previously reported through 54 weeks. This transition period compared results in patients with rheumatoid arthritis (RA) who switched from INF to SB2 with those in patients who maintained treatment with INF or SB2. Methods Patients with moderate to severe RA despite methotrexate treatment were randomised (1:1) to receive SB2 or INF at weeks 0, 2 and 6 and every 8 weeks thereafter until week 46. At week 54, patients previously receiving INF were rerandomised (1:1) to switch to SB2 (INF/SB2 (n=94)) or to continue on INF (INF/INF (n=101)) up to week 70. Patients previously receiving SB2 continued on SB2 (SB2/SB2 (n=201)) up to week 70. Efficacy, safety and immunogenicity were assessed up to week 78. Results Efficacy was sustained and comparable across treatment groups. American College of Rheumatology (ACR) 20 responses between weeks 54 and 78 ranged from 63.5% to 72.3% with INF/SB2, 66.3%%–69.4% with INF/INF and 65.6%–68.3% with SB2/SB2. Treatment-emergent adverse events during this time occurred in 36.2%, 35.6% and 40.3%, respectively, and infusion-related reactions in 3.2%, 2.0% and 3.5%. Among patients who were negative for antidrug antibodies (ADA) up to week 54, newly developed ADAs were reported in 14.6%, 14.9% and 14.1% of the INF/SB2, INF/INF and SB2/SB2 groups, respectively. Conclusions The efficacy, safety and immunogenicity profiles remained comparable among the INF/SB2, INF/INF and SB2/SB2 groups up to week 78, with no treatment-emergent issues or clinically relevant immunogenicity after switching from INF to SB2. Trial registration number NCT01936181; EudraCT number: 2012-005733-37. PMID:29042358

AUU-to-AUG mutation in the initiator codon of the translation initiation factor IF3 abolishes translational autocontrol of its own gene (infC) in vivo.

PubMed Central

Butler, J S; Springer, M; Grunberg-Manago, M

1987-01-01

We previously showed that Escherichia coli translation initiation factor IF3 regulates the expression of its own gene infC at the translational level in vivo. Here we create two alterations in the infC gene and test their effects on translational autocontrol of infC expression in vivo by measuring beta-galactosidase activity expressed from infC-lacZ gene fusions under conditions of up to 4-fold derepression or 3-fold repression of infC expression. Replacement of the infC promoter with the trp promoter deletes 120 nucleotides of the infC mRNA 5' to the translation initiation site without affecting autogenous translational control. Mutation of the unusual AUU initiator codon of infC to the more common AUG initiator codon abolishes translation initiation factor IF3-dependent repression and derepression of infC expression in vivo. These results establish the AUU initiator codon of infC as an essential cis-acting element in autogenous translational control of translation initiation factor IF3 expression in vivo. PMID:2954162

AUU-to-AUG mutation in the initiator codon of the translation initiation factor IF3 abolishes translational autocontrol of its own gene (infC) in vivo.

PubMed

Butler, J S; Springer, M; Grunberg-Manago, M

1987-06-01

We previously showed that Escherichia coli translation initiation factor IF3 regulates the expression of its own gene infC at the translational level in vivo. Here we create two alterations in the infC gene and test their effects on translational autocontrol of infC expression in vivo by measuring beta-galactosidase activity expressed from infC-lacZ gene fusions under conditions of up to 4-fold derepression or 3-fold repression of infC expression. Replacement of the infC promoter with the trp promoter deletes 120 nucleotides of the infC mRNA 5' to the translation initiation site without affecting autogenous translational control. Mutation of the unusual AUU initiator codon of infC to the more common AUG initiator codon abolishes translation initiation factor IF3-dependent repression and derepression of infC expression in vivo. These results establish the AUU initiator codon of infC as an essential cis-acting element in autogenous translational control of translation initiation factor IF3 expression in vivo.

New nonbinary quantum codes with larger distance constructed from BCH codes over 𝔽q2

NASA Astrophysics Data System (ADS)

Xu, Gen; Li, Ruihu; Fu, Qiang; Ma, Yuena; Guo, Luobin

2017-03-01

This paper concentrates on construction of new nonbinary quantum error-correcting codes (QECCs) from three classes of narrow-sense imprimitive BCH codes over finite field 𝔽q2 (q ≥ 3 is an odd prime power). By a careful analysis on properties of cyclotomic cosets in defining set T of these BCH codes, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing BCH codes is determined to be much larger than the result given according to Aly et al. [S. A. Aly, A. Klappenecker and P. K. Sarvepalli, IEEE Trans. Inf. Theory 53, 1183 (2007)] for each different code length. Thus families of new nonbinary QECCs are constructed, and the newly obtained QECCs have larger distance than those in previous literature.

Safety, immunogenicity and efficacy after switching from reference infliximab to biosimilar SB2 compared with continuing reference infliximab and SB2 in patients with rheumatoid arthritis: results of a randomised, double-blind, phase III transition study.

PubMed

Smolen, Josef S; Choe, Jung-Yoon; Prodanovic, Nenad; Niebrzydowski, Jaroslaw; Staykov, Ivan; Dokoupilova, Eva; Baranauskaite, Asta; Yatsyshyn, Roman; Mekic, Mevludin; Porawska, Wieslawa; Ciferska, Hana; Jedrychowicz-Rosiak, Krystyna; Zielinska, Agnieszka; Lee, Younju; Rho, Young Hee

2018-02-01

Efficacy, safety and immunogenicity results from the phase III study of SB2, a biosimilar of reference infliximab (INF), were previously reported through 54 weeks. This transition period compared results in patients with rheumatoid arthritis (RA) who switched from INF to SB2 with those in patients who maintained treatment with INF or SB2. Patients with moderate to severe RA despite methotrexate treatment were randomised (1:1) to receive SB2 or INF at weeks 0, 2 and 6 and every 8 weeks thereafter until week 46. At week 54, patients previously receiving INF were rerandomised (1:1) to switch to SB2 (INF/SB2 (n=94)) or to continue on INF (INF/INF (n=101)) up to week 70. Patients previously receiving SB2 continued on SB2 (SB2/SB2 (n=201)) up to week 70. Efficacy, safety and immunogenicity were assessed up to week 78. Efficacy was sustained and comparable across treatment groups. American College of Rheumatology (ACR) 20 responses between weeks 54 and 78 ranged from 63.5% to 72.3% with INF/SB2, 66.3%%-69.4% with INF/INF and 65.6%-68.3% with SB2/SB2. Treatment-emergent adverse events during this time occurred in 36.2%, 35.6% and 40.3%, respectively, and infusion-related reactions in 3.2%, 2.0% and 3.5%. Among patients who were negative for antidrug antibodies (ADA) up to week 54, newly developed ADAs were reported in 14.6%, 14.9% and 14.1% of the INF/SB2, INF/INF and SB2/SB2 groups, respectively. The efficacy, safety and immunogenicity profiles remained comparable among the INF/SB2, INF/INF and SB2/SB2 groups up to week 78, with no treatment-emergent issues or clinically relevant immunogenicity after switching from INF to SB2. NCT01936181; EudraCT number: 2012-005733-37. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

Study of quantum correlation swapping with relative entropy methods

NASA Astrophysics Data System (ADS)

Xie, Chuanmei; Liu, Yimin; Chen, Jianlan; Zhang, Zhanjun

2016-02-01

To generate long-distance shared quantum correlations (QCs) for information processing in future quantum networks, recently we proposed the concept of QC repeater and its kernel technique named QC swapping. Besides, we extensively studied the QC swapping between two simple QC resources (i.e., a pair of Werner states) with four different methods to quantify QCs (Xie et al. in Quantum Inf Process 14:653-679, 2015). In this paper, we continue to treat the same issue by employing other three different methods associated with relative entropies, i.e., the MPSVW method (Modi et al. in Phys Rev Lett 104:080501, 2010), the Zhang method (arXiv:1011.4333 [quant-ph]) and the RS method (Rulli and Sarandy in Phys Rev A 84:042109, 2011). We first derive analytic expressions of all QCs which occur during the swapping process and then reveal their properties about monotonicity and threshold. Importantly, we find that a long-distance shared QC can be generated from two short-distance ones via QC swapping indeed. In addition, we simply compare our present results with our previous ones.

Passive states as optimal inputs for single-jump lossy quantum channels

NASA Astrophysics Data System (ADS)

De Palma, Giacomo; Mari, Andrea; Lloyd, Seth; Giovannetti, Vittorio

2016-06-01

The passive states of a quantum system minimize the average energy among all the states with a given spectrum. We prove that passive states are the optimal inputs of single-jump lossy quantum channels. These channels arise from a weak interaction of the quantum system of interest with a large Markovian bath in its ground state, such that the interaction Hamiltonian couples only consecutive energy eigenstates of the system. We prove that the output generated by any input state ρ majorizes the output generated by the passive input state ρ0 with the same spectrum of ρ . Then, the output generated by ρ can be obtained applying a random unitary operation to the output generated by ρ0. This is an extension of De Palma et al. [IEEE Trans. Inf. Theory 62, 2895 (2016)], 10.1109/TIT.2016.2547426, where the same result is proved for one-mode bosonic Gaussian channels. We also prove that for finite temperature this optimality property can fail already in a two-level system, where the best input is a coherent superposition of the two energy eigenstates.

Left and right ventricle late remodeling following myocardial infarction in rats.

PubMed

Stefanon, Ivanita; Valero-Muñoz, María; Fernandes, Aurélia Araújo; Ribeiro, Rogério Faustino; Rodríguez, Cristina; Miana, Maria; Martínez-González, José; Spalenza, Jessica S; Lahera, Vicente; Vassallo, Paula F; Cachofeiro, Victoria

2013-01-01

The mechanisms involved in cardiac remodeling in left (LV) and right ventricles (RV) after myocardial infarction (MI) are still unclear. We assayed factors involved in collagen turnover in both ventricles following MI in rats either presenting signs of heart failure (pulmonary congestion and increased LVEDP) or not (INF-HF or INF, respectively). MI was induced in male rats by ligation of the left coronary artery. Four weeks after MI gene expression of collagen I, connective tissue growth factor (CTGF), transforming growth factor β (TGF-β) and lysyl oxidase (LOX), metalloproteinase-2 (MMP2) and tissue inhibitor metalloproteinase-2 (TIMP2) as well as cardiac hemodynamic in both ventricles were evaluated. Ventricular dilatation, hypertrophy and an increase in interstitial fibrosis and myocyte size were observed in the RV and LV from INF-HF animals, whereas only LV dilatation and fibrosis in RV was present in INF. The LV fibrosis in INF-HF was associated with higher mRNA of collagen I, CTGF, TGF-β and LOX expressions than in INF and SHAM animals, while MMP2/TIMP2 mRNA ratio did not change. RV fibrosis in INF and INF-HF groups was associated with an increase in LOX mRNA and a reduction in MMP2/TIMP2 ratio. CTGF mRNA was increased only in the INF-HF group. INF and INF-HF animals presented different patterns of remodeling in both ventricles. In the INF-HF group, fibrosis seems to be consequence of collagen production in LV, and by reductions in collagen degradation in RV of both INF and INF-HF animals.

Effects of Arsenic Trioxide on INF-gamma Gene Expression in MRL/lpr Mice and Human Lupus.

PubMed

Hu, Hongye; Chen, Enjiu; Li, Yongji; Zhu, Xiaochun; Zhang, Ting; Zhu, Xiaofang

2017-11-20

Arsenic trioxide (As2O3; ATO), a traditional Chinese medicine, is used to treat patients with acute promye-locytic leukemia, while its application for treatment of systemic lupus erythematosus (SLE) is still under evaluation. The high expression of INF-gamma (INF-γ) is a primary pathogenic factor in SLE. It is found that ATO can reduce INF-γ expression levels in lupus-prone mice, whereas it is not clear whether ATO has the same effect on SLE patients. Therefore, this study was to investigate the underlying mechanism of the effects of ATO on the expression of INF-γ in splenocytes of MRL/lpr mice and PBMCs of human lupus. The mRNA and protein expression levels of INF-γ were assessed by real-time RT-PCR and ELISA, respectively. The histone acetylation status of the INF-γ promoter and the binding of RNA polymerase II (RNA Pol II) to the INF-γ promoter were detected using a chromatin immunoprecipitation (ChIP) technique. The mRNA and protein expression levels of INF-γ decreased in both splenocytes of MRL/lpr mice and PBMCs of SLE patients with ATO treatment, which were accompanied by reduced histone H4 and H3 acetylation in INF-γ promoter and decreased combination of RNA Pol II to the INF-γ promoter. Therefore, ATO may reduce the expression level of the INF-γ by altering the levels of INF-γ promoter acetylation and the combination of RNA Pol II to the INF-γ promoter in splenocytes of MRL/lpr mice and PBMCs of SLE patients.

Metz: Offensive, Deliberate Attack, MOUT (Military Operations on Urbanized Terrain)

DTIC Science & Technology

1984-05-23

OPPOSING FORCES: US: 3d Army 377th Inf XX Corps 378th Inf 5th Inf Div 379th Inf 90th Inf Div 320th Eng Cbt Bn 95th Inf Div 10th Inf 10th Armored Div 11th...Panzer Bde SYNOPSIS: US XX Corps encircled and reduced Metz as a preliminary for continued attack east by 3d US Army. Excellent example of a Corps...crossings in the north. The 3d Cavalry Regiment also played a major role in combat and in the Corps& deception schemes prior to the battle. The XII

Left and Right Ventricle Late Remodeling Following Myocardial Infarction in Rats

PubMed Central

Stefanon, Ivanita; Valero-Muñoz, María; Fernandes, Aurélia Araújo; Ribeiro, Rogério Faustino; Rodríguez, Cristina; Miana, Maria; Martínez-González, José; Spalenza, Jessica S.; Lahera, Vicente; Vassallo, Paula F.; Cachofeiro, Victoria

2013-01-01

Background The mechanisms involved in cardiac remodeling in left (LV) and right ventricles (RV) after myocardial infarction (MI) are still unclear. We assayed factors involved in collagen turnover in both ventricles following MI in rats either presenting signs of heart failure (pulmonary congestion and increased LVEDP) or not (INF-HF or INF, respectively). Methods MI was induced in male rats by ligation of the left coronary artery. Four weeks after MI gene expression of collagen I, connective tissue growth factor (CTGF), transforming growth factor β (TGF-β) and lysyl oxidase (LOX), metalloproteinase-2 (MMP2) and tissue inhibitor metalloproteinase-2 (TIMP2) as well as cardiac hemodynamic in both ventricles were evaluated. Results Ventricular dilatation, hypertrophy and an increase in interstitial fibrosis and myocyte size were observed in the RV and LV from INF-HF animals, whereas only LV dilatation and fibrosis in RV was present in INF. The LV fibrosis in INF-HF was associated with higher mRNA of collagen I, CTGF, TGF-β and LOX expressions than in INF and SHAM animals, while MMP2/TIMP2 mRNA ratio did not change. RV fibrosis in INF and INF-HF groups was associated with an increase in LOX mRNA and a reduction in MMP2/TIMP2 ratio. CTGF mRNA was increased only in the INF-HF group. Conclusions INF and INF-HF animals presented different patterns of remodeling in both ventricles. In the INF-HF group, fibrosis seems to be consequence of collagen production in LV, and by reductions in collagen degradation in RV of both INF and INF-HF animals. PMID:23741440

49 CFR 176.720 - Requirements for carriage of INF cargo in international transportation.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 49 Transportation 2 2014-10-01 2014-10-01 false Requirements for carriage of INF cargo in... Requirements for carriage of INF cargo in international transportation. In addition to all other applicable requirements of this subchapter, a vessel carrying INF cargo (see § 176.2, under INF cargo definition) in...

49 CFR 176.720 - Requirements for carriage of INF cargo in international transportation.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 49 Transportation 2 2012-10-01 2012-10-01 false Requirements for carriage of INF cargo in... Requirements for carriage of INF cargo in international transportation. In addition to all other applicable requirements of this subchapter, a vessel carrying INF cargo (see § 176.2, under INF cargo definition) in...

49 CFR 176.720 - Requirements for carriage of INF cargo in international transportation.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 49 Transportation 2 2013-10-01 2013-10-01 false Requirements for carriage of INF cargo in... Requirements for carriage of INF cargo in international transportation. In addition to all other applicable requirements of this subchapter, a vessel carrying INF cargo (see § 176.2, under INF cargo definition) in...

49 CFR 176.720 - Requirements for carriage of INF cargo in international transportation.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 49 Transportation 2 2010-10-01 2010-10-01 false Requirements for carriage of INF cargo in... Requirements for carriage of INF cargo in international transportation. In addition to all other applicable requirements of this subchapter, a vessel carrying INF cargo (see § 176.2, under INF cargo definition) in...

49 CFR 176.720 - Requirements for carriage of INF cargo in international transportation.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 49 Transportation 2 2011-10-01 2011-10-01 false Requirements for carriage of INF cargo in... Requirements for carriage of INF cargo in international transportation. In addition to all other applicable requirements of this subchapter, a vessel carrying INF cargo (see § 176.2, under INF cargo definition) in...

Isocurvature constraints and anharmonic effects on QCD axion dark matter

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kobayashi, Takeshi; Kurematsu, Ryosuke; Takahashi, Fuminobu, E-mail: takeshi@cita.utoronto.ca, E-mail: rkurematsu@tuhep.phys.tohoku.ac.jp, E-mail: fumi@tuhep.phys.tohoku.ac.jp

2013-09-01

We revisit the isocurvature density perturbations induced by quantum fluctuations of the axion field by extending a recently developed analytic method and approximations to a time-dependent scalar potential, which enables us to follow the evolution of the axion until it starts to oscillate. We find that, as the initial misalignment angle approaches the hilltop of the potential, the isocurvature perturbations become significantly enhanced, while the non-Gaussianity parameter increases slowly but surely. As a result, the isocurvature constraint on the inflation scale is tightened as H{sub inf}∼

Non-Gaussianity from isocurvature perturbations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kawasaki, Masahiro; Nakayama, Kazunori; Sekiguchi, Toyokazu

2008-11-15

We develop a formalism for studying non-Gaussianity in both curvature and isocurvature perturbations. It is shown that non-Gaussianity in the isocurvature perturbation between dark matter and photons leaves distinct signatures in the cosmic microwave background temperature fluctuations, which may be confirmed in future experiments, or possibly even in the currently available observational data. As an explicit example, we consider the quantum chromodynamics axion and show that it can actually induce sizable non-Gaussianity for the inflationary scale, H{sub inf} = O(10{sup 9}-10{sup 11}) GeV.

Analysis and improvement of the quantum image matching

NASA Astrophysics Data System (ADS)

Dang, Yijie; Jiang, Nan; Hu, Hao; Zhang, Wenyin

2017-11-01

We investigate the quantum image matching algorithm proposed by Jiang et al. (Quantum Inf Process 15(9):3543-3572, 2016). Although the complexity of this algorithm is much better than the classical exhaustive algorithm, there may be an error in it: After matching the area between two images, only the pixel at the upper left corner of the matched area played part in following steps. That is to say, the paper only matched one pixel, instead of an area. If more than one pixels in the big image are the same as the one at the upper left corner of the small image, the algorithm will randomly measure one of them, which causes the error. In this paper, an improved version is presented which takes full advantage of the whole matched area to locate a small image in a big image. The theoretical analysis indicates that the network complexity is higher than the previous algorithm, but it is still far lower than the classical algorithm. Hence, this algorithm is still efficient.

Nitrous Oxide 70% for Procedural Analgosedation in a Pediatric Emergency Department With or Without Intranasal Fentanyl?: Analgesic Efficacy and Adverse Events if Combined With Intranasal Fentanyl.

PubMed

Seiler, Michelle; Landolt, Markus A; Staubli, Georg

2017-07-03

Nitrous oxide 70% (N20 70%) is an excellent medication for procedural analgosedation in a pediatric emergency department. However, its analgesic efficacy remains uncertain for painful procedures; therefore, a combination with intranasal fentanyl (INF), an opioid, was suggested. This study aimed at observing and assessing the analgesic efficacy and rate of adverse events using N20 70% with and without INF. Children who received N20 70% in a tertiary children's hospital emergency department from January 1, 2014 to June 30, 2015 were included in this observational study with prospective data collection. Physicians decided individually whether INF was administered. Medical staff documented the child's behavior during the procedure, adverse events, and satisfaction rate. A total of 442 children were included; 206 (46.6%) received INF. Group differences regarding patient behavior were not statistically significant; however, N20 70% application time was longer in the INF group (P = .02). Nausea was the most frequent adverse event with 13.1% in the INF group versus 8.1% without INF. Inadequate procedural analgosedation was documented only in the INF group, affecting 1.8% of all patients (P = .002). In contrast, anxiety was exclusively observed in the group without INF, which was presumably misjudged pain (P = .03); the satisfaction rate in the INF group was 95.6% compared with 98.7% without INF. Because of the study design and limitations, no conclusions about adding INF to N20 70% can be made. Additional research is needed to investigate the effect of combining N20 70% with INF.

Endobiliary Stent Position Changes during External-beam Radiotherapy

PubMed Central

Chu, Kwun-Ye; Eccles, Cynthia L.; Brunner, Thomas B.

2015-01-01

Purpose Endobiliary stents can be used as surrogates for pancreatic localization when using cone-beam computed tomography (CBCT) during external-beam radiotherapy (EBRT). This work reports on interfraction stent position changes during EBRT for locally advanced pancreatic cancer (LAPC). Materials and Methods Six patients with endobiliary stents who underwent EBRT for LAPC were assessed. Measurements from the most superior aspect of the stent (sup stent) and the most inferior aspect of the stent (inf stent) to the most inferior, posterior aspect of the L1 vertebra central spinous process were determined from daily treatment CBCTs and compared with those determined from the planning computed tomography (CT) scan. Changes in stent-L1 measurements were interpreted as changes in relative stent position. Results Three patients showed mean interfraction stent position changes of ≥1 cm when treatment measurements were compared with planning measurements. The sup stent for patient A moved to the right (2.66 ± 2.77 cm) and inferiorly (3.0 ± 3.12 cm), and the inf stent moved to the right (1.92 ± 2.02 cm) inferiorly (3.23 ± 3.34 cm) and posteriorly (1.41 ± 1.43 cm). The inf stent for patient B moved superiorly (2.23 ± 0.49 cm) and posteriorly (1.72 ± 0.59 cm). The sup and inf stent for patient F moved inferiorly (0.98 ± 0.35 cm and 1.21 ± 0.38 cm, respectively). The remaining three patients C, D, and E showed interfraction position changes of <1 cm. Conclusion Endobiliary stent migration and deformation were observed in a small subset of patients. Further investigation is required before confirming their use as surrogates for LAPC target localization during image-guided EBRT. PMID:26090069

May2005 Heavy Quark Phenomenology -- B → ϕK(*) Cpv/polarization, and Collider Implications

NASA Astrophysics Data System (ADS)

Hou, George Wei-Shu

2005-04-01

The hint for BSM CP violation in B → ϕKS is now more confused, but the ϕK* polarization anomaly seems real. We present a picture based on a flavor-mixed, right-handed "strange-beauty" squark ˜ {sb}1R, driven light by the large ˜ {s}R-˜ {b}_R squark flavor mixing, which carries a unique new CP phase. The ˜ {sb}1R could impact on SϕKS (or alternatively Sη'KS), Bs, mixing, sin 2ΦBs, SKSπ0γ and other b → s transitions, and can be searched for directly at the Tevatron. Whether SM or BSM, a heuristic model is given where transverse ϕK* polarization descends from the gluon helicity of on-shell b → sg.

Resonance Production at Star

NASA Astrophysics Data System (ADS)

Yamamoto, Eugene T.

2002-03-01

We present the first measurement of mid-rapidity ϕ vector meson production in Au + Au collisions at RHIC (√ {sNN}= 130\\ GeV) from the STAR detector. For the 11% most central collisions, the slope parameter from an exponential fit to the transverse mass distribution is T= 379 ± 51(stat) ± 45(syst) MeV, the yield dN/dy = 5.73 ± 0.37(stat) ± 0.57(syst) per event and the ratio Nϕ/Nh- is found to be 0.021 ± 0.001(stat) ± 0.004(syst). We currently place the value of the Nϕ/NK- ratio between 0.10 and 0.16. The measured ratios Nϕ/Nh- and Nϕ/NK-, as well as T for the ϕ meson at mid-rapidity do not change for the selected centrality bins.

Mice with mutant Inf2 show impaired podocyte and slit diaphragm integrity in response to protamine-induced kidney injury.

PubMed

Subramanian, Balajikarthick; Sun, Hua; Yan, Paul; Charoonratana, Victoria T; Higgs, Henry N; Wang, Fang; Lai, Ka-Man V; Valenzuela, David M; Brown, Elizabeth J; Schlöndorff, Johannes S; Pollak, Martin R

2016-08-01

Mutations in the INF2 (inverted formin 2) gene, encoding a diaphanous formin family protein that regulates actin cytoskeleton dynamics, cause human focal segmental glomerulosclerosis (FSGS). INF2 interacts directly with certain other mammalian diaphanous formin proteins (mDia) that function as RhoA effector molecules. FSGS-causing INF2 mutations impair these interactions and disrupt the ability of INF2 to regulate Rho/Dia-mediated actin dynamics in vitro. However, the precise mechanisms by which INF2 regulates and INF2 mutations impair glomerular structure and function remain unknown. Here, we characterize an Inf2 R218Q point-mutant (knockin) mouse to help answer these questions. Knockin mice have no significant renal pathology or proteinuria at baseline despite diminished INF2 protein levels. INF2 mutant podocytes do show impaired reversal of protamine sulfate-induced foot process effacement by heparin sulfate perfusion. This is associated with persistent podocyte cytoplasmic aggregation, nephrin phosphorylation, and nephrin and podocin mislocalization, as well as impaired recovery of mDia membrane localization. These changes were partially mimicked in podocyte outgrowth cultures, in which podocytes from knockin mice show altered cellular protrusions compared to those from wild-type mice. Thus, in mice, normal INF2 function is not required for glomerular development but normal INF2 is required for regulation of the actin-based behaviors necessary for response to and/or recovery from injury. Copyright © 2016 International Society of Nephrology. Published by Elsevier Inc. All rights reserved.

Interactions of the interferon system with cellular metabolism

NASA Technical Reports Server (NTRS)

Sonnenfeld, Gerald

1986-01-01

The results of studies concerning the interaction of the interferon (Inf) system with the activities of carcinogens, tumor promoters, and cytochrome P-450 are presented. The results show that the addition of a tumor promoter (TPA or 4-O-methyl-TPA) to a tissue culture enhances virus-induced Inf-gamma production, suggesting a potential value of tumor promoters in the biosynthesis of commercial Inf. On the other hand, the carcinogens were reported to inhibit the induction of Inf-alpha/beta in cultured cells and in intact animals (with no effect on the administered or preformed Inf). The demonstration of a correlation between the carcinogenic potential of a compound and its inhibitive effect on Inf production suggests a possible use of the Inf production assay in the evaluation of the carcinogenicity of chemicals. In addition, it was shown that the induction of Inf-alpha/beta as well as the administration of this Inf depresses the levels of rat liver cytochrome P-450 which is responsible for binding lipophilic drugs, steroids, and carcinogens, thus increasing the toxicity of the respective chemical.

ΔF=2 Processes in the Mssm in Large tan β Limit

NASA Astrophysics Data System (ADS)

Rosiek, Janusz

2002-03-01

We discuss corrections to ΔMBd, ΔMBs and to the CP violation parameter ɛ in two examples of (generalized) minimal flavour violation models: 2HDM and MSSM in the large tan β limit. We show that for H+ not too heavy, ΔMBs in the MSSM with heavy sparticles can be substantially smaller than in the SM due the charged Higgs box contributions and in particular due to the growing like tan4 β contribution of the double penguin diagrams involving neutral Higgs boson exchanges.

The Battle of Aschaffenburg: An Example of Late World War 2 Urban Combat in Europe

DTIC Science & Technology

1989-06-02

Division (LTC Abams) German Units - ARMY: Seventh ( Gen . der Inf. Felber) ( Gen . der Inf. Obstfelder, 26 March) CORPS: L)XOII ( Gen . dir Inf. Hahn...4 Armored Division (LTC Abrams) Ist Bn, 104 Infantry (attached to 4 AD) German Units - ARMY: Seventh ( Gen . dir Inf. Obstfelder) CORPS: DOCOII ( Gen ...Haislip) DIVISION: 44 Infantry Division (MG Dean) 45 Infantry Division (MG Fredericks) German Units - ARMY: Seventh ( Gen . dir Inf. Obstfelder) CORPS

Joint symbolic dynamic analysis of cardiorespiratory interactions in patients on weaning trials.

PubMed

Caminal, P; Giraldo, B; Zabaleta, H; Vallverdu, M; Benito, S; Ballesteros, D; Lopez-Rodriguez, L; Esteban, A; Baumert, M; Voss, A

2005-01-01

Assessing autonomic control provides information about patho-physiological imbalances. Measures of variability of the cardiac interbeat duration RR(n) and the variability of the breath duration TTot(n) are sensitive to those changes. The interactions between RR(n) and TTot(n) are complex and strongly non-linear. A study of joint symbolic dynamics is presented as a new short-term non-linear analysis method to investigate these interactions in patients on weaning trials. 78 patients from mechanical ventilation are studied: Group A (patients that failed to maintain spontaneous breathing and were reconnected) and Group B (patients with successful trials). Using the concept of joint symbolic dynamics, cardiac and respiratory changes were transformed into a word series, and the probability of occurrence of each word type was calculated and compared between both groups. Significant differences were found in 13 words, and the most significant pn(Wc010, r010): 0.0041 ± 0.0036 (group A) against 0.0012 ± 0.0024 (group B), p-value = 0.00001. The number of seldom occurring word types (forbidden words) also presents significant differences fwcr: 6.9 ± 6.6 against 13.5 ± 5.3, p-value = 0.00004. Joint symbolic dynamics provides an efficient non-linear representation of cardiorespiratory interactions that offers simple physiological interpretations.

Microorganism gram-type differentiation based on pyrolysis-mass spectrometry of bacterial Fatty Acid methyl ester extracts.

PubMed

Basile, F; Voorhees, K J; Hadfield, T L

1995-04-01

Curie-point pyrolysis (Py)-mass spectrometry has been used to differentiate 19 microorganisms by Gram type on the basis of the methyl esters of their fatty acid distribution. The mass spectra of gram-negative microorganisms were characterized by the presence of palmitoleic acid (C(inf16:1)) and oleic acid (C(inf18:1)), as well as a higher abundance of palmitic acid (C(inf16:0)) than pentadecanoic acid (C(inf15:0)). For gram-positive microorganisms, a signal of branched C(inf15:0) (isoC(inf15:0) and/or anteisoC(inf15:0)) more intense than that of palmitic acid was observed in the mass spectra. Principal components analysis of these mass spectral data segregated the microorganisms investigated in this study into three discrete clusters that correlated to their gram reactions and pathogenicities. Further tandem mass spectrometric analysis demonstrated that the nature of the C(inf15:0) fatty acid isomer (branched or normal) present in the mass spectrum of each microorganism was important for achieving the classification into three clusters.

Resent Results from Super-Kamiokande

NASA Astrophysics Data System (ADS)

Moriyama, S.

2001-04-01

Results on atmospheric and solar neutrino analyses at Super-Kamiokande are presented. The whole data set of atmospheric neutrino is consistently explained with an assumption of pure νμ-ντ oscillations. The allowed range of parameters is 1.4 × 10-3 < Δm2 < 5 × 10-3 eV2 and sin2 2θ > 0.88 at 90% C.L. On the other hand, we found pure νμ-νsterile oscillations are disfavored with 99% C.L. From solar neutrino data, we obtained 8B neutrino flux ratio to the prediction of the standard solar model to be 0.465±0.005±0.0150.013. The flux difference of daytime and nighttime is 1.3σ. The energy spectrum is consistent with expectations. By examining daytime and nighttime spectra, we found the small mixing angle solutions and vacuum oscillation solutions which satisfy the observed fluxes of solar neutrino experiments are disfavored with 95% C.L. for νe-νactive oscillations. Similarly, νe-νsterile oscillations are also disfavored.

"excess Heat" during Electrolysis in Platinium /K2CO3/ Nickel Light Water System

NASA Astrophysics Data System (ADS)

Tian, J.; Jin, L. H.; Weng, Z. K.; Song, B.; Zhao, X. L.; Xiao, Z. J.; Chen, G.; Du, B. Q.

2006-02-01

The characteristic variation of heating coefficients (k = ΔT/ΔP°C/W) of Pt(H)-Ni electrolytic system with K2CO3 and Na2CO3 solutions was studied in both situations of electric and electrolytic heating, respectively. The results in equilibrium revealed that there was an obvious difference of k in electrolytic-heating (Δk ≈ 30°C/W, kK2CO3 > kNa2CO3) between these two systems, whereas there was a little difference of k in electric heating (Δk ≈ 2°C/W, kK2CO3 < kNa2CO3 between them. "Excess heat" of about 2.5 × 104 J was produced during electrolysis of K2CO3 solution over 1 day of electrolysis. The differences of K2CO3 solution after electrolysis in the potential of hydrogen value (ΔpH = 0.15) and in absorbency (ΔA = 0.108) implied that some new Ca2+ might have formed in the electrolytic system.

Assembly and Turnover of Short Actin Filaments by the Formin INF2 and Profilin*

PubMed Central

Gurel, Pinar S.; A, Mu; Guo, Bingqian; Shu, Rui; Mierke, Dale F.; Higgs, Henry N.

2015-01-01

INF2 (inverted formin 2) is a formin protein with unique biochemical effects on actin. In addition to the common formin ability to accelerate actin nucleation and elongation, INF2 can also sever filaments and accelerate their depolymerization. Although we understand key attributes of INF2-mediated severing, we do not understand the mechanism by which INF2 accelerates depolymerization subsequent to severing. Here, we show that INF2 can create short filaments (<60 nm) that continuously turn over actin subunits through a combination of barbed end elongation, severing, and WH2 motif-mediated depolymerization. This pseudo-steady state condition occurs whether starting from actin filaments or monomers. The rate-limiting step of the cycle is nucleotide exchange of ADP for ATP on actin monomers after release from the INF2/actin complex. Profilin addition has two effects: 1) to accelerate filament turnover 6-fold by accelerating nucleotide exchange and 2) to shift the equilibrium toward polymerization, resulting in longer filaments. In sum, our findings show that the combination of multiple interactions of INF2 with actin can work in concert to increase the ATP turnover rate of actin. Depending on the ratio of INF2:actin, this increased flux can result in rapid filament depolymerization or maintenance of short filaments. We also show that high concentrations of cytochalasin D accelerate ATP turnover by actin but through a different mechanism from that of INF2. PMID:26124273

Impact of surgical care improvement project inf-9 on postoperative urinary tract infections: do exemptions interfere with quality patient care?

PubMed

Owen, Rachel M; Perez, Sebastian D; Bornstein, William A; Sweeney, John F

2012-10-01

The Surgical Care Improvement Project (SCIP) Inf-9 guideline promotes removal of indwelling urinary catheters (IUCs) within 48 hours of surgery. To determine whether a correlation exists between SCIP Inf-9 compliance and postoperative urinary tract infection (UTI) rates and whether an association exists between UTI rates and SCIP Inf-9 exemption status. DESIGN Retrospective case control study. Southeastern academic medical center. American College of Surgeons National Surgical Quality Improvement Program (NSQIP) and SCIP Inf-9 compliance data were collected prospectively on randomly selected general and vascular surgery inpatients. Monthly UTI rates and SCIP Inf-9 compliance scores were tested for correlation. Complete NSQIP data for all the inpatients with postoperative UTIs were compared with a group of 100 random controls to determine whether an association exists between UTI rates and SCIP Inf-9 exemption status. Postoperative UTI. In 2459 patients reviewed, SCIP Inf-9 compliance increased over time, but this was not correlated with improved monthly UTI rates. Sixty-one of the 69 UTIs (88.4%) were compliant with SCIP Inf-9; however, 49 (71.0%) of these were considered exempt from the guideline and, therefore, the IUC was not removed within 48 hours of surgery. Retrospective review of 100 random controls showed a similar compliance rate (84.0%, P = .43) but a lower rate of exemption (23.5%, P < .001). The odds of developing a postoperative UTI were 8 times higher in patients deemed exempt from SCIP Inf-9 (odds ratio [OR], 7.99; 95% CI, 3.85-16.61). After controlling for differences between the 2 groups, the adjusted ORs slightly increased (OR, 8.34; 95% CI, 3.70-18.76). Most UTIs occurred in patients deemed exempt from SCIP Inf-9. Although compliance rates remain high, practices are not actually improving. Surgical Care Improvement Project Inf-9 guidelines should be modified with fewer exemptions to facilitate earlier removal of IUCs.

Antibody loaded collapsible hyaluronic acid hydrogels for intraocular delivery.

PubMed

Egbu, Raphael; Brocchini, Steve; Khaw, Peng T; Awwad, Sahar

2018-03-01

Injectable gels have the potential to encapsulate drugs for sustained release of protein therapeutics for use in the eye. Hyaluronic acid (HA) is a biodegradable clinically used material and poly N-isopropylacrylamide (pNIPAAM) is a stimuli responsive polymer that can display a lower critical solution temperature (LCST) at physiological conditions. Two gel systems incorporating HA were prepared in the presence of the antibody infliximab (INF): i) 1% and 5% tyramine-substituted HA (HA-Tyr) was enzymatically crosslinked in the presence of INF to form HA-Tyr-INF and ii) NIPAAM was chemically crosslinked in the presence of HA and INF with 1 and 3% poly(ethylene glycol) diacrylate (PEGDA) to form PEGDA-pNIPAAM-HA-INF. The PEGDA-pNIPAAM-HA-INF hydrogels displayed LCSTs at temperatures ranging from 31.4 ± 0.2 to 35.7 ± 0.3 °C. Although all the gels prepared were injectable, INF-loaded gels with lower crosslinking density (1% PEGDA-pNIPAAM-HA and 1% HA-Tyr) showed lower elastic (G') and viscous (G″) moduli compared to higher crosslinked gels (3% PEGDA-pNIPAAM-HA-INF and 5% HA-Tyr-INF) resulting in differences in swelling ratio (SR). Moduli may be correlated with overall stiffness of the gel. All hydrogels demonstrated sustained release of INF in a two-compartment in vitro outflow model of the human eye called the PK-Eye. The 1% PEGDA-pNIPAAM-HA-INF hydrogel displayed the slowest release (24.9 ± 0.4% INF release by day 9) in phosphate buffered saline (PBS, pH 7.4), which is a better release profile than the free drug alone (tested under the same conditions). These results suggest that PEGDA-pNIPAAM-HA has potential for the continued development of formulations to prolong the intraocular release of proteins. Copyright © 2017 Elsevier B.V. All rights reserved.

Interferon-gamma exerts its negative regulatory effect primarily on the earliest stages of murine erythroid progenitor cell development.

PubMed

Wang, C Q; Udupa, K B; Lipschitz, D A

1995-01-01

Interferon-gamma (INF-gamma) has been shown to suppress erythropoiesis and perhaps to contribute to the anemia of chronic disease. In this study we demonstrated that the concentration of INF gamma required to suppress murine burst forming unit-erythroid (BFU-E) growth was significantly less than that required to suppress colony forming unit-erythroid (CFU-E) growth. INF gamma acted at the most primitive step in erythroid progenitor cell differentiation and proliferation, as inhibition was maximal when added at the time of BFU-E culture initiation. Inhibition was progressively less if INF gamma addition was delayed after culture initiation. The effects of INF gamma on BFU-E did not require the presence of interleukin-1 alpha (IL-1 alpha), tumor necrosis factor-alpha (TNF alpha), or granulocyte macrophage colony stimulating factor (GM-CSF), as its effects were not neutralized by monoclonal antibodies against IL-1 alpha, TNF alpha, or GM-CSF. This applied whether INF gamma was added to culture with individual antibodies or with a combination of all three antibodies. INF gamma was not required for IL-1 alpha- or TNF alpha-induced suppression of BFU-E, as their effects were not neutralized by a monoclonal anti-INF gamma antibody. In contrast, GM-CSF-induced suppression of BFU-E was negated by the simultaneous addition of anti-INF gamma. We have previously shown that the addition of TNF alpha does not suppress BFU-E growth in cultures from marrow depleted of macrophages. Suppression did occur, however, if a small concentration of INF gamma that does not inhibit and increasing concentration of TNF alpha were added to culture, suggesting a synergistic effect between INF-gamma and TNF alpha. These observations suggest that INF gamma is a potent direct inhibitor of erythroid colony growth in vitro. It exerts its negative regulatory effect primarily on the earliest stages of erythroid progenitor cell differentiation and proliferation, as much higher doses are required to suppress late erythroid cell development. INF gamma is also involved in GM-CSF-induced inhibition of BFU-E colony growth.

Multicast Delayed Authentication For Streaming Synchrophasor Data in the Smart Grid

PubMed Central

Câmara, Sérgio; Anand, Dhananjay; Pillitteri, Victoria; Carmo, Luiz

2017-01-01

Multicast authentication of synchrophasor data is challenging due to the design requirements of Smart Grid monitoring systems such as low security overhead, tolerance of lossy networks, time-criticality and high data rates. In this work, we propose inf -TESLA, Infinite Timed Efficient Stream Loss-tolerant Authentication, a multicast delayed authentication protocol for communication links used to stream synchrophasor data for wide area control of electric power networks. Our approach is based on the authentication protocol TESLA but is augmented to accommodate high frequency transmissions of unbounded length. inf TESLA protocol utilizes the Dual Offset Key Chains mechanism to reduce authentication delay and computational cost associated with key chain commitment. We provide a description of the mechanism using two different modes for disclosing keys and demonstrate its security against a man-in-the-middle attack attempt. We compare our approach against the TESLA protocol in a 2-day simulation scenario, showing a reduction of 15.82% and 47.29% in computational cost, sender and receiver respectively, and a cumulative reduction in the communication overhead. PMID:28736582

Multicast Delayed Authentication For Streaming Synchrophasor Data in the Smart Grid.

PubMed

Câmara, Sérgio; Anand, Dhananjay; Pillitteri, Victoria; Carmo, Luiz

2016-01-01

Multicast authentication of synchrophasor data is challenging due to the design requirements of Smart Grid monitoring systems such as low security overhead, tolerance of lossy networks, time-criticality and high data rates. In this work, we propose inf -TESLA, Infinite Timed Efficient Stream Loss-tolerant Authentication, a multicast delayed authentication protocol for communication links used to stream synchrophasor data for wide area control of electric power networks. Our approach is based on the authentication protocol TESLA but is augmented to accommodate high frequency transmissions of unbounded length. inf TESLA protocol utilizes the Dual Offset Key Chains mechanism to reduce authentication delay and computational cost associated with key chain commitment. We provide a description of the mechanism using two different modes for disclosing keys and demonstrate its security against a man-in-the-middle attack attempt. We compare our approach against the TESLA protocol in a 2-day simulation scenario, showing a reduction of 15.82% and 47.29% in computational cost, sender and receiver respectively, and a cumulative reduction in the communication overhead.

Interfacing External Quantum Devices to a Universal Quantum Computer

PubMed Central

Lagana, Antonio A.; Lohe, Max A.; von Smekal, Lorenz

2011-01-01

We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer. PMID:22216276

Interfacing external quantum devices to a universal quantum computer.

PubMed

Lagana, Antonio A; Lohe, Max A; von Smekal, Lorenz

2011-01-01

We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer. © 2011 Lagana et al.

Universal blind quantum computation for hybrid system

NASA Astrophysics Data System (ADS)

Huang, He-Liang; Bao, Wan-Su; Li, Tan; Li, Feng-Guang; Fu, Xiang-Qun; Zhang, Shuo; Zhang, Hai-Long; Wang, Xiang

2017-08-01

As progress on the development of building quantum computer continues to advance, first-generation practical quantum computers will be available for ordinary users in the cloud style similar to IBM's Quantum Experience nowadays. Clients can remotely access the quantum servers using some simple devices. In such a situation, it is of prime importance to keep the security of the client's information. Blind quantum computation protocols enable a client with limited quantum technology to delegate her quantum computation to a quantum server without leaking any privacy. To date, blind quantum computation has been considered only for an individual quantum system. However, practical universal quantum computer is likely to be a hybrid system. Here, we take the first step to construct a framework of blind quantum computation for the hybrid system, which provides a more feasible way for scalable blind quantum computation.

Evaluating the Implementation Barriers of an Intranasal Fentanyl Pain Pathway for Pediatric Long-Bone Fractures.

PubMed

Arnautovic, Tamara; Sommese, Kathryn; Mullan, Paul C; Frazier, Steven Barron; Vazifedan, Turaj; Ramirez, Dana Erikson

2017-12-01

This study aimed to assess physician comfort, knowledge, and implementation barriers regarding the use of intranasal fentanyl (INF) for pain management in patients with long-bone fractures in a pediatric emergency department (ED) with an INF pain pathway. A retrospective chart review was conducted of patients, 3 to 21 years old, in our ED with an International Classification of Diseases-9th Revision code for a long-bone fracture from September 1, 2013, to August 31, 2015. Patients were divided into 4 groups: (1) received INF on the pathway appropriately; (2) "missed opportunities" to receive INF, defined as either INF was ordered and then subsequently canceled (for pain ratings, ≥6/10), or INF was ordered, cancelled, and intravenous (IV) morphine given, or INF was not ordered and a peripheral IV line was placed to give IV morphine as first-line medication; (3) peripheral IV established upon ED arrival; (4) no pain medication required. Additionally, a survey regarding practice habits for pain management was completed to evaluate physician barriers to utilization of the pathway. A total of 1374 patients met the inclusion criteria. Missed opportunities were identified 41% of the time. Neither younger patient age nor more years of physician experience in the ED were associated with increased rates of missed opportunities. The survey (95% response rate) revealed greater comfort with and preference for IV morphine over INF. The high rate of missed opportunities, despite the implementation of an INF pain pathway, indicates the need for further exploration of the barriers to utilization of the INF pain pathway.

Effect of Thermal and Shear Stressors on the Physical Properties, Structural Integrity and Biological Activity of the Anti-TNF-alpha Monoclonal Antibody, Infliximab.

PubMed

Alsaddique, Jihad A; Pabari, Ritesh M; Ramtoola, Zebunnissa

The influence of thermal and shear stressors on the stability of the anti-TNF-α monoclonal antibody (mAb), Infliximab® (INF) was investigated. INF at concentrations of 1, 4 and 10 mg/ml was subjected to thermal stress at temperatures of 25-65°C and to shear force by sonication for 1 and 3 minutes. The stressed samples were analysed for physical properties by particle size, zeta potential, for structural integrity by gel electrophoresis (SDS-PAGE) and circular dichroism, INF content by UV spectroscopy and for biological activity by ELISA. Results show no change in physical properties or structural integrity of INF at any concentration tested, when subjected to a temperature of up to 50°C. At 65°C, aggregation and precipitation of INF was observed. When subjected to shear stress, higher concentrations of INF at 4 and 10mg/ml maintained their physical properties and structural integrity. However, the biological activity of INF was found to decrease with increasing temperature and sonication time, and was concentration dependent (ANOVA; p<0.05). Interestingly, lyophilisation of INF at 1mg/ml did not affect its physical properties, structural integrity or its biological activity. These findings have important implications with respect to pharmaceutical processing of INF and mAbs including formulation as polymeric micro and nanoparticle systems for sustained or targeted delivery. These findings also have important implications with respect to the handling and storage of INF and mAbs for clinical use.

Effect of Plant Species and Environmental Conditions on Ice Nucleation Activity of Pseudomonas syringae on Leaves.

PubMed

O'brien, R D; Lindow, S E

1988-09-01

Selected plant species and environmental conditions were investigated for their influences on expression of ice nucleation activity by 15 Pseudomonas syringae strains grown on plants in constant-temperature growth chamber studies. Ice nucleation frequencies (INFs), the fraction of cells that expressed ice nucleation at -5 or -9 degrees C, of individual strains varied greatly, both on plants and in culture. This suggests that the probability of frost injury, which is proportional to the number of ice nuclei on leaf surfaces, is strongly determined by the particular bacterial strains that are present on a leaf surface. The INFs of strains were generally higher when they were grown on plants than when they were grown in culture. In addition, INFs in culture did not correlate closely with INFs on plants, suggesting that frost injury prediction should be based on INF measurements of cells grown on plants rather than in culture. The relative INFs of individual strains varied with plant host and environment. However, none of seven plant species tested optimized the INFs of all 15 strains. Similarly, incubation for 48 h at near 100% relative humidity with short photoperiods did not always decrease the INF when compared with a 72 h, 40% relative humidity, long-photoperiod incubation. Pathogenic strains on susceptible hosts were not associated with higher or lower INFs relative to their INFs on nonsusceptible plant species. The ice nucleation activity of individual bacterial strains on plants therefore appears to be controlled by complex and interacting factors such as strain genotype, environment, and host plant species.

Blind Quantum Signature with Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Li, Wei; Shi, Ronghua; Guo, Ying

2017-04-01

Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client's privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.

Measurement-only verifiable blind quantum computing with quantum input verification

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki

2016-10-01

Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected (blindness), and the correctness of the computation is verifiable by the client despite her limited quantum technology (verifiability). There are mainly two types of protocols for verifiable blind quantum computing: the protocol where the client has only to generate single-qubit states and the protocol where the client needs only the ability of single-qubit measurements. The latter is called the measurement-only verifiable blind quantum computing. If the input of the client's quantum computing is a quantum state, whose classical efficient description is not known to the client, there was no way for the measurement-only client to verify the correctness of the input. Here we introduce a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.

Retention Patterns for Army National Guard Units Attending the National Training Center

DTIC Science & Technology

1988-04-01

which are more difficult, Table 2.1 NTC ROUNDOUT BATTALION SCHEDULE ARNG UNIT STATE DATES 1-108 AR GA 9-22 September 󈨗 2-136 INF (M) MN 19 April-8 May...1984 1-121 INF (M) GA 3-22 October 󈨘 2-121 INF (M) GA 18 March-6 April 󈨙 2-152 AR AL 1-20 June 󈨙 2-120 INF (M) NC 26 June-15 July 󈨙 3-156 INF...roundout unit to the 24th Infantry Division headquartered at Fort Stewart, Georgia. Elements of the unit are located in Tifton , Valdosta, Fitzgerald and

Programmable Quantum Photonic Processor Using Silicon Photonics

DTIC Science & Technology

2017-04-01

quantum information processing and quantum sensing, ranging from linear optics quantum computing and quantum simulation to quantum ...transformers have driven experimental and theoretical advances in quantum simulation, cluster-state quantum computing , all-optical quantum repeaters...neuromorphic computing , and other applications. In addition, we developed new schemes for ballistic quantum computation , new methods for

A shielded measurement system for irradiated nuclear fuel measurements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mosby, W.R.; Aumeier, S.E.; Klann, R.T.

1999-07-01

The US Department of Energy (DOE) is driving a transition toward dry storage of irradiated nuclear fuel (INF), toward characterization of INF for final disposition, and toward resumption of measurement-based material control and accountability (MC and A) efforts for INF. For these reasons, the ability to efficiently acquire radiological measurements of INF in a dry environment is important. The DOE has recently developed a guidance document proposing MC and A requirements for INF. The intent of this document is to encourage the direct measurement of INF on inventory within DOE. The guidance document reinforces and clarifies existing material safeguards requirementsmore » as they pertain to INF. Validation of nuclear material contents of non-self-protecting INF must be accomplished by direct measurement, application of validated burnup codes using qualified initial fissile content, burnup data, and age or by other valid means. The fuel units must remain intact with readable identification numbers. INF may be subject to periodic inventories with visual item accountability checks. Quantitative measurements may provide greater assurance of the integrity of INF inventories at a lower cost and with less personnel exposure than visual item accountability checks. Currently, several different approaches are used to measure the radiological attributes of INF. Although these systems are useful for a wide variety of applications, there is currently no relatively inexpensive measurement system that is readily deployable for INF measurements for materials located in dry storage. The authors present the conceptual design of a shielded measurement system (SMS) that could be used for this purpose. The SMS consists of a shielded enclosure designed to house a collection of measurement systems to allow measurements on spent fuel outside of a hot cell. The phase 1 SMS will contain {sup 3}He detectors and ionization chambers to allow for gross neutron and gamma-ray measurements. The phase 2 SMS will be developed by adding additional measurement capabilities to the phase 1 SMS. Planned additions include medium-resolution gamma-ray detectors (CdZnTe or high-pressure Xe), additional {sup 3}He tubes to allow coincidence measurements, and a {sup 252}Cf neutron source and motion control system to allow active neutron interrogation measurements. The phase 2 SMS will be capable of performing more direct measurements of INF properties such as burnup, cooling time, spontaneous fission isotope contents, and total fissile contents.« less

Recombinant interferon alpha 2b for ocular surface squamous neoplasia: An efficient and cost-effective treatment modality in Asian Indian patients

PubMed Central

Kaliki, Swathi; Singh, Swati; Iram, Sadiya; Tripuraneni, Dharani

2016-01-01

Purpose: The purpose was to study the efficacy of interferon alpha 2b (INF α2b) in the treatment of ocular surface squamous neoplasia (OSSN) and analyze its cost-effectiveness in India. Study Design: This was a retrospective study of thirty patients with OSSN treated with topical INF α2b (1 MIU/cc) ± perilesional INF α2b (5 MIU/cc). Results: The tumor involved cornea (n = 9, 30%), conjunctivo-limbal-corneal surface (n = 19, 63%), or bulbar conjunctiva (n = 2, 7%). The mean basal dimension of the tumor was 16 mm. The tumors belonged to Tis (n = 6, 20%) or T3 (n = 24, 80%) based on the American Joint Committee Classification, 7th edition. In the six patients with Tis, three cycles of topical INF α2b were used for immunoprevention. In the remaining 24 patients, INF α2b was advised for immunoreduction, but served as immunotherapy with 100% tumor regression in 22 (92%) cases, and resulted in 95% immunoreduction in 2 (6%) cases. Complete tumor regression by immunotherapy (n = 22) was achieved with a mean number of three topical INF α2b cycles and two perilesional injections. All these 22 patients received three additional topical INF α2b cycles after complete tumor regression. For immunoreduction (n = 2), both patients received six cycles of topical INF α2b which was three perilesional INF α2b injections. The mean total treatment cost per patient with INF α2b was INR 9164 ($US 137). Based on maximum basal diameter of tumor at presentation, the mean total treatment cost per patient with INF α2b was INR 4866 ($US 73) for eyes with microscopic evidence of tumor residue (n = 6), INR 9607 ($US 143) for tumors ≤10 mm (n = 13), and INR 10,985 ($US 164) for tumors >10 mm (n = 11), with two patients needing additional surgical excision for complete tumor control. Conclusion: INF α2b can be used for immunoreduction, immunotherapy, or immunoprevention of OSSN. INF α2b is a cost-effective treatment modality for OSSN at an average total treatment cost of INR 9164 ($US 137) per patient. PMID:27905329

Recombinant interferon alpha 2b for ocular surface squamous neoplasia: An efficient and cost-effective treatment modality in Asian Indian patients.

PubMed

Kaliki, Swathi; Singh, Swati; Iram, Sadiya; Tripuraneni, Dharani

2016-10-01

The purpose was to study the efficacy of interferon alpha 2b (INF α2b) in the treatment of ocular surface squamous neoplasia (OSSN) and analyze its cost-effectiveness in India. This was a retrospective study of thirty patients with OSSN treated with topical INF α2b (1 MIU/cc) ± perilesional INF α2b (5 MIU/cc). The tumor involved cornea (n = 9, 30%), conjunctivo-limbal-corneal surface (n = 19, 63%), or bulbar conjunctiva (n = 2, 7%). The mean basal dimension of the tumor was 16 mm. The tumors belonged to Tis (n = 6, 20%) or T3 (n = 24, 80%) based on the American Joint Committee Classification, 7th edition. In the six patients with Tis, three cycles of topical INF α2b were used for immunoprevention. In the remaining 24 patients, INF α2b was advised for immunoreduction, but served as immunotherapy with 100% tumor regression in 22 (92%) cases, and resulted in 95% immunoreduction in 2 (6%) cases. Complete tumor regression by immunotherapy (n = 22) was achieved with a mean number of three topical INF α2b cycles and two perilesional injections. All these 22 patients received three additional topical INF α2b cycles after complete tumor regression. For immunoreduction (n = 2), both patients received six cycles of topical INF α2b which was three perilesional INF α2b injections. The mean total treatment cost per patient with INF α2b was INR 9164 ($US 137). Based on maximum basal diameter of tumor at presentation, the mean total treatment cost per patient with INF α2b was INR 4866 ($US 73) for eyes with microscopic evidence of tumor residue (n = 6), INR 9607 ($US 143) for tumors ≤10 mm (n = 13), and INR 10,985 ($US 164) for tumors >10 mm (n = 11), with two patients needing additional surgical excision for complete tumor control. INF α2b can be used for immunoreduction, immunotherapy, or immunoprevention of OSSN. INF α2b is a cost-effective treatment modality for OSSN at an average total treatment cost of INR 9164 ($US 137) per patient.

Quantum analogue computing.

PubMed

Kendon, Vivien M; Nemoto, Kae; Munro, William J

2010-08-13

We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.

The INF controversy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Davis, J.K.; Perry, C.M.; Pfaltzgraff, R.L. Jr.

1989-01-01

This book examines the 1979 dual-track INF deployment decision of the NATO allies, focusing on developments in Britain, the Netherlands, and West Germany, where protest movements sought to pressure their governments to reverse themselves on the INF decision. Assesses the damage to U.S. - European relations resulting from the INF controversy and seek(s) to draw lessons that could prevent future disputes from again seriously disrupting Alliance cohesion.

Triple-server blind quantum computation using entanglement swapping

NASA Astrophysics Data System (ADS)

Li, Qin; Chan, Wai Hong; Wu, Chunhui; Wen, Zhonghua

2014-04-01

Blind quantum computation allows a client who does not have enough quantum resources or technologies to achieve quantum computation on a remote quantum server such that the client's input, output, and algorithm remain unknown to the server. Up to now, single- and double-server blind quantum computation have been considered. In this work, we propose a triple-server blind computation protocol where the client can delegate quantum computation to three quantum servers by the use of entanglement swapping. Furthermore, the three quantum servers can communicate with each other and the client is almost classical since one does not require any quantum computational power, quantum memory, and the ability to prepare any quantum states and only needs to be capable of getting access to quantum channels.

Discordance between surgical care improvement project adherence and postoperative outcomes: implications for new Joint Commission standards.

PubMed

Chang, Victor; Blackwell, Robert H; Markossian, Talar; Yau, Ryan M; Blanco, Barbara A; Zapf, Matthew A C; Abood, Gerard J; Gupta, Gopal N; Kuo, Paul C; Kothari, Anai N

2017-05-15

Infectious (INF) and venous thromboembolism (VTE) complication rates are targeted by surgical care improvement project (SCIP) INF and SCIP VTE measures. We analyzed how adherence to SCIP INF and SCIP VTE affects targeted postoperative outcomes (wound complication [WC], deep vein thrombosis, and pulmonary embolism [PE]) using all-payer data. A retrospective review (2007-2011) was conducted using Healthcare Cost and Utilization Project State Inpatient Database Florida and Medicare's Hospital Compare. The association between SCIP adherence rates and outcomes across 355 included surgical procedures was measured using multilevel mixed-effects linear regression models. One hundred sixty acute care hospitals and 779,922 patients were included. Over 5 y, SCIP INF-1, -2, and -3 adherence improved by 12.5%, 8.0%, and 20.9%, respectively, whereas postoperative WC rate decreased by 14.8%. When controlling for time, SCIP INF-1 adherence was associated with improvement of postoperative WC rates (β = -0.0044, P = 0.005), whereas SCIP INF-2 adherence was associated with increased WCs (β = 0.0031, P = 0.018). SCIP VTE-1, -2 adherence improved by 14.6% and 20.2%, respectively, whereas postoperative deep vein thrombosis rate increased by 7.1% and postoperative PE rate increased by 3.7%. SCIP VTE-1 and -2 adherence were both associated with increased postoperative PE when controlling for time (SCIP VTE-1: β = 0.0019, P < 0.001; SCIP VTE-2: β = 0.0015, P < 0.001). Readmission analysis found SCIP INF-1 adherence to be associated with improved 30-d WC rates when controlling for patient and hospital characteristics (β = -0.0021, P = 0.032), whereas SCIP INF-3 adherence was associated with increased 30-d WC rates when controlling for time (β = 0.0007, P = 0.04). Only SCIP INF-1 adherence was associated with improved outcomes. The Joint Commission has retired SCIP INF-2, -3, and SCIP VTE-2 and made SCIP INF-1 and VTE-1 reporting optional. Our study supports continued reporting of SCIP INF-1. Copyright © 2017 Elsevier Inc. All rights reserved.

Intranasal fluticasone associated with delayed tympanostomy tube placement in children with eustachian tube dysfunction.

PubMed

Crowson, Matthew G; Ryan, Marisa A; Ramprasad, Vaibhav H; Choi, Kevin J; Raynor, Eileen

2017-03-01

Pediatric patient caregivers may prefer to avoid a surgical intervention and request a medical management option for eustachian tube dysfunction (ETD). However, there are limited published data evaluating the efficacy of intranasal fluticasone in the medical management of ETD as an alternative to tympanostomy tube placement. The objectives of this study were to: 1) determine if intranasal fluticasone (INF) prevented tympanostomy tube placement in children with ETD, and 2) describe differences in patient response to INF related to cleft lip and/or palate (CLP) and Down syndrome. Case series with planned chart review at a Tertiary academic hospital. We reviewed pediatric patients treated with INF for ETD. Inclusion criteria included ETD, no prior intranasal or oral steroid therapy, and no prior tympanostomy tube placement. Outcomes included time-to- tympanostomy tube placement with or without INF and therapy compliance. Kaplan-Meier survival analyses with log-rank tests and Fisher's exact tests were used to examine outcome variables. 676 fulfilled inclusion criteria. 393 (58.7%) were male, and 355 (52.5%) Caucasian with mean age of 27.1 months old. 92 (13.6%) had CLP and 46 (6.8%) had Down Syndrome. 266 (39.4%) received INF, and 202 (88.2%) were compliant at their next visit. 474 (70.1%) had tympanostomy tubes placed. Children treated with INF were less likely to have tympanostomy tubes placed than children not treated (52.6% vs. 81.5%; p < 0.0001). Using survival analyses, INF use was associated with significantly longer mean time-to-tympanostomy tube than no INF use (199.4 vs. 133.7 days; p < 0.0001). INF did not reduce time-to-tympanostomy tube in patients with CLP (p = 0.05) or Down Syndrome (p = 0.27). INF significantly reduces the number of children requiring tympanostomy tube placement for ETD. The CLP and Down Syndrome anatomical variants may attenuate INF efficacy. Further in vivo characterization of INF action on eustachian tube tissues will help further substantiate these observations. Copyright © 2017 Elsevier B.V. All rights reserved.

A randomised, double-blind, phase III study comparing SB2, an infliximab biosimilar, to the infliximab reference product Remicade in patients with moderate to severe rheumatoid arthritis despite methotrexate therapy

PubMed Central

Choe, Jung-Yoon; Prodanovic, Nenad; Niebrzydowski, Jaroslaw; Staykov, Ivan; Dokoupilova, Eva; Baranauskaite, Asta; Yatsyshyn, Roman; Mekic, Mevludin; Porawska, Wieskawa; Ciferska, Hana; Jedrychowicz-Rosiak, Krystyna; Zielinska, Agnieszka; Choi, Jasmine; Rho, Young Hee; Smolen, Josef S

2017-01-01

Objectives To compare the efficacy, safety, immunogenicity and pharmacokinetics (PK) of SB2 to the infliximab reference product (INF) in patients with moderate to severe rheumatoid arthritis (RA) despite methotrexate therapy. Methods This is a phase III, randomised, double-blind, multinational, multicentre parallel group study. Patients with moderate to severe RA despite methotrexate therapy were randomised in a 1:1 ratio to receive either SB2 or INF of 3 mg/kg. The primary end point was the American College of Rheumatology 20% (ACR20) response at week 30. Inclusion of the 95% CI of the ACR20 response difference within a ±15% margin was required for equivalence. Results 584 subjects were randomised into SB2 (N=291; 290 analysed) or INF (N=293). The ACR20 response at week 30 in the per-protocol set was 64.1% in SB2 versus 66.0% in INF. The adjusted rate difference was −1.88% (95% CI −10.26% to 6.51%), which was within the predefined equivalence margin. Other efficacy outcomes such as ACR50/70, disease activity score measured by 28 joints and European League against Rheumatism response were similar between SB2 and INF. The incidence of treatment-emergent adverse events was comparable (57.6% in SB2 vs 58.0% in INF) as well as the incidence of antidrug antibodies (ADA) to infliximab up to week 30 (55.1% in SB2 vs 49.7% in INF). The PK profile was similar between SB2 and INF. Efficacy, safety and PK by ADA subgroup were comparable between SB2 and INF. Conclusions SB2 was equivalent to INF in terms of ACR20 response at week 30. SB2 was well tolerated with a comparable safety profile, immunogenicity and PK to INF. Trial registration number NCT01936181. PMID:26318384

Larvicidal, pupicidal and adulticidal activities of non-polar solvent extract of Cymbopogon nardus (Linn.) whole plant against a mosquito, Culex quinquefasciatus (Say.).

PubMed

Ilahi, Ikram; Yousafzai, Ali Muhammad

2017-11-01

The present research is aimed to investigate the susceptibility of Cx. quinquefasciatus larvae (2nd and 4th instars), pupae and adults during exposure to various concentrations of C. nardus n-hexane extract. Increase in mortality of larvae and pupae was observed with increase in concentration of the extract solution (R2>0.90). LC50 values of extract for 2nd and 4th instar larvae were 451.8 and 599.6 ppm, respectively. The LC90 values of extract for 2nd and 4th instar larvae were 2519.6 and 3017.7 ppm, respectively. The LC50 and LC90 values of extract during pupicidal activity were 1307.7 and 2257.9 ppm, respectively. During CDC bottle bioassay, mosquito adult knockdown was observed after exposure to various concentrations (0.15% to 1.25%) of C. nardus n-hexane extract. The KDT50 values at highest (1.25%) and lowest (0.15%) concentrations were 100.9 and 184.2 minutes, respectively. After 24 hours exposure period, the highest extract concentration (1.25%) caused 62.5±6.5% mortality. During filter paper impregnation bioassay, the KDT50 value at highest concentration (0.13 mg/cm2) was 94.4 minutes and at lowest concentration (0.017 mg/cm²) was 178.9 minutes. KDT90 values at these concentrations were 176.7 and 290.1 minutes, respectively. After 24 hours of recovery period, the filter papers impregnated with highest extract concentration (0.13mg/cm2) caused 60±8.2% mortality.

How to Build a Quantum Computer

NASA Astrophysics Data System (ADS)

Sanders, Barry C.

2017-11-01

Quantum computer technology is progressing rapidly with dozens of qubits and hundreds of quantum logic gates now possible. Although current quantum computer technology is distant from being able to solve computational problems beyond the reach of non-quantum computers, experiments have progressed well beyond simply demonstrating the requisite components. We can now operate small quantum logic processors with connected networks of qubits and quantum logic gates, which is a great stride towards functioning quantum computers. This book aims to be accessible to a broad audience with basic knowledge of computers, electronics and physics. The goal is to convey key notions relevant to building quantum computers and to present state-of-the-art quantum-computer research in various media such as trapped ions, superconducting circuits, photonics and beyond.

An Actin-Dependent Step in Mitochondrial Fission Mediated by the ER-Associated Formin INF2

PubMed Central

Korobova, Farida; Ramabhadran, Vinay; Higgs, Henry N.

2013-01-01

Mitochondrial fission is fundamentally important to cellular physiology. The dynamin-related protein Drp1 mediates fission, and interaction between mitochondrion and endoplasmic reticulum (ER) enhances fission. However, the mechanism for Drp1 recruitment to mitochondria is unclear, although previous results implicate actin involvement. Here, we found that actin polymerization through ER-localized inverted formin 2 (INF2) was required for efficient mitochondrial fission in mammalian cells. INF2 functioned upstream of Drp1. Actin filaments appeared to accumulate between mitochondria and INF2-enriched ER membranes at constriction sites. Thus, INF2-induced actin filaments may drive initial mitochondrial constriction, which allows Drp1-driven secondary constriction. Because INF2 mutations can lead to Charcot-Marie-Tooth disease, our results provide a potential cellular mechanism for this disease state. PMID:23349293

Blind topological measurement-based quantum computation.

PubMed

Morimae, Tomoyuki; Fujii, Keisuke

2012-01-01

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 4.3 × 10(-3), which is comparable to that (7.5 × 10(-3)) of non-blind topological quantum computation. As the error per gate of the order 10(-3) was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.

Blind topological measurement-based quantum computation

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki; Fujii, Keisuke

2012-09-01

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 4.3×10-3, which is comparable to that (7.5×10-3) of non-blind topological quantum computation. As the error per gate of the order 10-3 was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.

Influence of nitric oxide-mediated vasodilation on the blood pressure measured with the tail-cuff method in the rat.

PubMed

Fritz, Mariana; Rinaldi, Gustavo

2007-11-01

Systolic blood pressure (SBP) is frequently measured in rats by the tail cuff method, which usually comprises pulse/flow disappearance and reappearance during cuff inflation (Inf) and deflation (Def), separated by an interval between cycles (IBC). Although Def values are habitually used to estimate SBP, in 58 Wistar rats we found (Def-Inf) to be -6 +/- 1 mmHg, indicating that Def < Inf in most cases. When the IBC was lengthened to 2 min, (Def-Inf) was increased to -17 +/- 2 mmHg, indicating the probable accumulation of a vasodilating metabolite. This increase of (Def-Inf) was prevented by papaverine, indicating its relation to smooth muscle contractility. Adrenergic blockade did not prevent the increase of (Def-Inf), but pretreatment with L-NAME decreased it to -5 +/- 2 mmHg (p < 0.05). Simultaneous measurement of SBP by tail-cuff method and carotid cannulation revealed that the Inf value was the most accurate estimation of intravascular SBP. We conclude that: (1) the Inf value should be taken as representative of SBP, since depending on the duration of suprasystolic compression the Def value can underestimate it, and (2) nitric oxide accumulation due to flow deprivation was the main cause of SBP underestimation by Def values.

[Study of the antitumor activity of alveolar macrophages after transfected human INF-γ gene].

PubMed

Zhou, Fengli; Bi, Xiaogang; Zhang, Tiantuo; Huang, Jing

2011-05-01

Alveolar macrophages (AMs) activated have the antitumor activity. The interferon-γ (INF-γ) is one of the stimulating factors. INF-γ can enhance the immune function of AMs in vitro. The aim of this study is to investigate the effect of human INF-γ gene on the antitumor activity of AMs when transfected into the alveolar macrophages (AMs) from the patients with lung cancer in vitro. AMs obtained by brochoalveolar lavage were separated and transfected by INF-γ gene. RT-PCR and ELISA were applied to determine whether the transfection was successful. The levels of tumor necrosis factor α (TNF-α), nitric oxide (NO) and interleukin-1 (IL-1) produced by AMs and the killing activity of AMs against L1210 cells was detected respectively. Both RT-PCR and ELISA demonstrated that human INF-γ gene had been successfully transfected into AMs. When transfected by human INF-γ gene, the levels of TNF-α, NO and IL-1 produced by AMs from the patients with lung cancer and the killing activity of AMs against L1210 cells were significantly higher than those of the control groups. Human INF-γ gene can enhance the antitumor activity of AMs when transfected into AMs from the patients with lung cancer.

Web-Based Dissemination System for the Trusted Computing Exemplar Project

DTIC Science & Technology

2005-06-01

6 3. Fiasco Microkernel ..............................................................................6 4. Apache Web Server...Fiasco Microkernel The next project examined was the Fiasco Microkernel developed by the Dresden University of Technology. This dissemination...System,” 1999, http://www.eros-os.org, Accessed: May 2005. [5] “The Fiasco Microkernel ,” February 2004, http://os.inf.tu-dresden.de/fiasco/, Accessed

Demonstration of blind quantum computing.

PubMed

Barz, Stefanie; Kashefi, Elham; Broadbent, Anne; Fitzsimons, Joseph F; Zeilinger, Anton; Walther, Philip

2012-01-20

Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer. We exploit the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms, are demonstrated. The client only needs to be able to prepare and transmit individual photonic qubits. Our demonstration is crucial for unconditionally secure quantum cloud computing and might become a key ingredient for real-life applications, especially when considering the challenges of making powerful quantum computers widely available.

INF-gamma rearranges membrane topography of MHC-I and ICAM-1 in colon carcinoma cells.

PubMed

Bacsó, Zsolt; Bene, László; Damjanovich, László; Damjanovich, Sándor

2002-01-18

Flow-cytometric fluorescence energy transfer (FCET) measurements between fluorescently labeled cell surface MHC-I and ICAM-1 molecules indicated similar receptor patterns in the plasma membrane of interferon-gamma (INF-gamma)-treated colon carcinoma cells as those observed earlier at the surface of lymphoid cells. INF-gamma activation significantly increased the density of MHC-I and ICAM-1 proteins in the membrane. This increase in receptor density was accompanied by decreased proximity level of the homo-associated MHC-I receptors. Hetero-association of MHC-I and ICAM-1 molecules was increased by INF-gamma treatment. INF-gamma changed neither hetero- nor homo-association of transferrin receptors. By staining the sphingomyelin/cholesterol-enriched lipid microdomains with fluorescently labeled cholera toxin B subunit, we found an increase in the amount of lipid-raft associated G(M1)-gangliosides due to INF-gamma treatment. Confocal microscopic results and FCET measurements show that MHC-I and ICAM-1 are components of G(M1)-ganglioside containing lipid-rafts and also support an increase in the size of these lipid-rafts upon INF-gamma treatment.

Quantum Computation: Entangling with the Future

NASA Technical Reports Server (NTRS)

Jiang, Zhang

2017-01-01

Commercial applications of quantum computation have become viable due to the rapid progress of the field in the recent years. Efficient quantum algorithms are discovered to cope with the most challenging real-world problems that are too hard for classical computers. Manufactured quantum hardware has reached unprecedented precision and controllability, enabling fault-tolerant quantum computation. Here, I give a brief introduction on what principles in quantum mechanics promise its unparalleled computational power. I will discuss several important quantum algorithms that achieve exponential or polynomial speedup over any classical algorithm. Building a quantum computer is a daunting task, and I will talk about the criteria and various implementations of quantum computers. I conclude the talk with near-future commercial applications of a quantum computer.

Undergraduate computational physics projects on quantum computing

NASA Astrophysics Data System (ADS)

Candela, D.

2015-08-01

Computational projects on quantum computing suitable for students in a junior-level quantum mechanics course are described. In these projects students write their own programs to simulate quantum computers. Knowledge is assumed of introductory quantum mechanics through the properties of spin 1/2. Initial, more easily programmed projects treat the basics of quantum computation, quantum gates, and Grover's quantum search algorithm. These are followed by more advanced projects to increase the number of qubits and implement Shor's quantum factoring algorithm. The projects can be run on a typical laptop or desktop computer, using most programming languages. Supplementing resources available elsewhere, the projects are presented here in a self-contained format especially suitable for a short computational module for physics students.

Blind topological measurement-based quantum computation

PubMed Central

Morimae, Tomoyuki; Fujii, Keisuke

2012-01-01

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf–Harrington–Goyal scheme. The error threshold of our scheme is 4.3×10−3, which is comparable to that (7.5×10−3) of non-blind topological quantum computation. As the error per gate of the order 10−3 was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach. PMID:22948818

Quantum computation for solving linear systems

NASA Astrophysics Data System (ADS)

Cao, Yudong

Quantum computation is a subject born out of the combination between physics and computer science. It studies how the laws of quantum mechanics can be exploited to perform computations much more efficiently than current computers (termed classical computers as oppose to quantum computers). The thesis starts by introducing ideas from quantum physics and theoretical computer science and based on these ideas, introducing the basic concepts in quantum computing. These introductory discussions are intended for non-specialists to obtain the essential knowledge needed for understanding the new results presented in the subsequent chapters. After introducing the basics of quantum computing, we focus on the recently proposed quantum algorithm for linear systems. The new results include i) special instances of quantum circuits that can be implemented using current experimental resources; ii) detailed quantum algorithms that are suitable for a broader class of linear systems. We show that for some particular problems the quantum algorithm is able to achieve exponential speedup over their classical counterparts.

Abstract quantum computing machines and quantum computational logics

NASA Astrophysics Data System (ADS)

Chiara, Maria Luisa Dalla; Giuntini, Roberto; Sergioli, Giuseppe; Leporini, Roberto

2016-06-01

Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantum Turing machines are nothing but special examples of classical probabilistic machines. We introduce the concepts of deterministic state machine, classical probabilistic state machine and quantum state machine. On this basis, we discuss the question: To what extent can quantum state machines be simulated by classical probabilistic state machines? Each state machine is devoted to a single task determined by its program. Real computers, however, behave differently, being able to solve different kinds of problems. This capacity can be modeled, in the quantum case, by the mathematical notion of abstract quantum computing machine, whose different programs determine different quantum state machines. The computations of abstract quantum computing machines can be linguistically described by the formulas of a particular form of quantum logic, termed quantum computational logic.

Some foundational aspects of quantum computers and quantum robots.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benioff, P.; Physics

1998-01-01

This paper addresses foundational issues related to quantum computing. The need for a universally valid theory such as quantum mechanics to describe to some extent its own validation is noted. This includes quantum mechanical descriptions of systems that do theoretical calculations (i.e. quantum computers) and systems that perform experiments. Quantum robots interacting with an environment are a small first step in this direction. Quantum robots are described here as mobile quantum systems with on-board quantum computers that interact with environments. Included are discussions on the carrying out of tasks and the division of tasks into computation and action phases. Specificmore » models based on quantum Turing machines are described. Differences and similarities between quantum robots plus environments and quantum computers are discussed.« less

Quantum computers: Definition and implementations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perez-Delgado, Carlos A.; Kok, Pieter

The DiVincenzo criteria for implementing a quantum computer have been seminal in focusing both experimental and theoretical research in quantum-information processing. These criteria were formulated specifically for the circuit model of quantum computing. However, several new models for quantum computing (paradigms) have been proposed that do not seem to fit the criteria well. Therefore, the question is what are the general criteria for implementing quantum computers. To this end, a formal operational definition of a quantum computer is introduced. It is then shown that, according to this definition, a device is a quantum computer if it obeys the following criteria:more » Any quantum computer must consist of a quantum memory, with an additional structure that (1) facilitates a controlled quantum evolution of the quantum memory; (2) includes a method for information theoretic cooling of the memory; and (3) provides a readout mechanism for subsets of the quantum memory. The criteria are met when the device is scalable and operates fault tolerantly. We discuss various existing quantum computing paradigms and how they fit within this framework. Finally, we present a decision tree for selecting an avenue toward building a quantum computer. This is intended to help experimentalists determine the most natural paradigm given a particular physical implementation.« less

Antiferromagnetism and DX2-Y2-WAVE Pairing in the Colored Hubbard Model

NASA Astrophysics Data System (ADS)

Baier, Tobias; Bick, Eike

2001-08-01

We introduce a new formulation of the 2d Hubbard model on a square lattice (the "colored" Hubbard model). In this formulation interesting physical nonlocal properties as antiferromagnetic or dx2-y2-wave superconducting behavior are included in an explicit way. Analyzing the phase diagram in a mean field approximation numerically, we show that our approach yields results which are in qualitative agreement with experiment.

Quantum simulator review

NASA Astrophysics Data System (ADS)

Bednar, Earl; Drager, Steven L.

2007-04-01

Quantum information processing's objective is to utilize revolutionary computing capability based on harnessing the paradigm shift offered by quantum computing to solve classically hard and computationally challenging problems. Some of our computationally challenging problems of interest include: the capability for rapid image processing, rapid optimization of logistics, protecting information, secure distributed simulation, and massively parallel computation. Currently, one important problem with quantum information processing is that the implementation of quantum computers is difficult to realize due to poor scalability and great presence of errors. Therefore, we have supported the development of Quantum eXpress and QuIDD Pro, two quantum computer simulators running on classical computers for the development and testing of new quantum algorithms and processes. This paper examines the different methods used by these two quantum computing simulators. It reviews both simulators, highlighting each simulators background, interface, and special features. It also demonstrates the implementation of current quantum algorithms on each simulator. It concludes with summary comments on both simulators.

A randomised, double-blind, phase III study comparing SB2, an infliximab biosimilar, to the infliximab reference product Remicade in patients with moderate to severe rheumatoid arthritis despite methotrexate therapy.

PubMed

Choe, Jung-Yoon; Prodanovic, Nenad; Niebrzydowski, Jaroslaw; Staykov, Ivan; Dokoupilova, Eva; Baranauskaite, Asta; Yatsyshyn, Roman; Mekic, Mevludin; Porawska, Wieskawa; Ciferska, Hana; Jedrychowicz-Rosiak, Krystyna; Zielinska, Agnieszka; Choi, Jasmine; Rho, Young Hee; Smolen, Josef S

2017-01-01

To compare the efficacy, safety, immunogenicity and pharmacokinetics (PK) of SB2 to the infliximab reference product (INF) in patients with moderate to severe rheumatoid arthritis (RA) despite methotrexate therapy. This is a phase III, randomised, double-blind, multinational, multicentre parallel group study. Patients with moderate to severe RA despite methotrexate therapy were randomised in a 1:1 ratio to receive either SB2 or INF of 3 mg/kg. The primary end point was the American College of Rheumatology 20% (ACR20) response at week 30. Inclusion of the 95% CI of the ACR20 response difference within a ±15% margin was required for equivalence. 584 subjects were randomised into SB2 (N=291; 290 analysed) or INF (N=293). The ACR20 response at week 30 in the per-protocol set was 64.1% in SB2 versus 66.0% in INF. The adjusted rate difference was -1.88% (95% CI -10.26% to 6.51%), which was within the predefined equivalence margin. Other efficacy outcomes such as ACR50/70, disease activity score measured by 28 joints and European League against Rheumatism response were similar between SB2 and INF. The incidence of treatment-emergent adverse events was comparable (57.6% in SB2 vs 58.0% in INF) as well as the incidence of antidrug antibodies (ADA) to infliximab up to week 30 (55.1% in SB2 vs 49.7% in INF). The PK profile was similar between SB2 and INF. Efficacy, safety and PK by ADA subgroup were comparable between SB2 and INF. SB2 was equivalent to INF in terms of ACR20 response at week 30. SB2 was well tolerated with a comparable safety profile, immunogenicity and PK to INF. NCT01936181. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

26 CFR 1.1275-7 - Inflation-indexed debt instruments.

Code of Federal Regulations, 2012 CFR

2012-04-01

...: OID((n) = AIP(n) × [r + inf(n) + (r × inf(n))] in which, r = yield of the debt instrument as determined under paragraph (e)(3)(i) of this section (adjusted for the length of the accrual period); inf(n...

26 CFR 1.1275-7 - Inflation-indexed debt instruments.

Code of Federal Regulations, 2014 CFR

2014-04-01

... using the following formula: OID((n) = AIP(n) × [r + inf(n) + (r × inf(n))] in which, r = yield of the... accrual period); inf(n) = percentage change in the value of the reference index for period (n) as...

26 CFR 1.1275-7 - Inflation-indexed debt instruments.

Code of Federal Regulations, 2013 CFR

2013-04-01

... using the following formula: OID((n) = AIP(n) × [r + inf(n) + (r × inf(n))] in which, r = yield of the... accrual period); inf(n) = percentage change in the value of the reference index for period (n) as...

26 CFR 1.1275-7 - Inflation-indexed debt instruments.

Code of Federal Regulations, 2010 CFR

2010-04-01

... accrual period (n) is determined by using the following formula: OID((n) = AIP(n) × [r + inf(n) + (r × inf... section (adjusted for the length of the accrual period); inf(n) = percentage change in the value of the...

26 CFR 1.1275-7 - Inflation-indexed debt instruments.

Code of Federal Regulations, 2011 CFR

2011-04-01

...: OID((n) = AIP(n) × [r + inf(n) + (r × inf(n))] in which, r = yield of the debt instrument as determined under paragraph (e)(3)(i) of this section (adjusted for the length of the accrual period); inf(n...

Quantum walk computation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kendon, Viv

2014-12-04

Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. Recent results showing quantum walks are “universal for quantum computation” relate to algorithms, to be run on quantum computers. We consider whether an experimental implementation of a quantum walk could provide useful computation before we have a universal quantum computer.

Quantum simulations with noisy quantum computers

NASA Astrophysics Data System (ADS)

Gambetta, Jay

Quantum computing is a new computational paradigm that is expected to lie beyond the standard model of computation. This implies a quantum computer can solve problems that can't be solved by a conventional computer with tractable overhead. To fully harness this power we need a universal fault-tolerant quantum computer. However the overhead in building such a machine is high and a full solution appears to be many years away. Nevertheless, we believe that we can build machines in the near term that cannot be emulated by a conventional computer. It is then interesting to ask what these can be used for. In this talk we will present our advances in simulating complex quantum systems with noisy quantum computers. We will show experimental implementations of this on some small quantum computers.

Immune and inflammatory biomarkers in cases of bovine perinatal mortality with and without infection in utero.

PubMed

Jawor, Paulina; Stefaniak, Tadeusz; Mee, John F

2017-02-01

The objective of this study was to compare acute-phase protein [serum amyloid A (SAA) and haptoglobin (Hp)] and immunoglobulin G 1 and M concentrations in blood plasma of cases of bovine perinatal mortality due to infection in utero or traumotocia and in unexplained cases. Plasma samples were collected from 110 stillborn calves with bacterial infection (INF_B, n = 16), with viral or parasitic infection (INF_V/P, n = 31) during pregnancy, with lesions of fatal traumotocia (TRAUM, n = 22), and from unexplained deaths (UNEXPL, n = 41). Plasma immunoglobulin and SAA concentrations were measured by ELISA, and Hp concentrations were measured by the guaiacol method and ELISA. Concentrations of SAA in the INF_B group were higher than in the UNEXPL group and tended to be higher than in the INF_V/P group. A reference range (0-29 mg/L) was established for SAA in stillborn calves. Concentrations of Hp tended to be higher in the INF_B group compared with INF_V/P group. Concentrations of IgM tended to be higher in the INF_B group compared with the TRAUM and INF_V/P groups. Concentrations of IgG 1 were numerically, but not significantly, higher in the INF_V/P and INF_B groups compared with the other groups. The results demonstrate upregulation of immune and inflammatory responses in stillborn calves exposed to bacterial infection in utero. The immune-inflammatory parameters did not differ between calves with viral or parasitic infections and traumotocia. These immune-inflammatory profiles did not contribute to the diagnosis of unexplained stillbirth. This is the first report of an elevated acute phase protein response in stillborn calves. Measurement of SAA and IgM concentrations may be used in the diagnosis of bacterial infections in stillborn calves. Copyright © 2017 American Dairy Science Association. Published by Elsevier Inc. All rights reserved.

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network.

PubMed

Goto, Hayato

2016-02-22

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

NASA Astrophysics Data System (ADS)

Goto, Hayato

2016-02-01

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

Modeling multi-GeV class laser-plasma accelerators with INF&RNO

NASA Astrophysics Data System (ADS)

Benedetti, Carlo; Schroeder, Carl; Bulanov, Stepan; Geddes, Cameron; Esarey, Eric; Leemans, Wim

2016-10-01

Laser plasma accelerators (LPAs) can produce accelerating gradients on the order of tens to hundreds of GV/m, making them attractive as compact particle accelerators for radiation production or as drivers for future high-energy colliders. Understanding and optimizing the performance of LPAs requires detailed numerical modeling of the nonlinear laser-plasma interaction. We present simulation results, obtained with the computationally efficient, PIC/fluid code INF&RNO (INtegrated Fluid & paRticle simulatioN cOde), concerning present (multi-GeV stages) and future (10 GeV stages) LPA experiments performed with the BELLA PW laser system at LBNL. In particular, we will illustrate the issues related to the guiding of a high-intensity, short-pulse, laser when a realistic description for both the laser driver and the background plasma is adopted. Work Supported by the U.S. Department of Energy under contract No. DE-AC02-05CH11231.

Computation and Dynamics: Classical and Quantum

NASA Astrophysics Data System (ADS)

Kisil, Vladimir V.

2010-05-01

We discuss classical and quantum computations in terms of corresponding Hamiltonian dynamics. This allows us to introduce quantum computations which involve parallel processing of both: the data and programme instructions. Using mixed quantum-classical dynamics we look for a full cost of computations on quantum computers with classical terminals.

Pediatric emergency department triage-based pain guideline utilizing intranasal fentanyl: Effect of implementation.

PubMed

Schoolman-Anderson, Kristin; Lane, Roni D; Schunk, Jeff E; Mecham, Nancy; Thomas, Richard; Adelgais, Kathleen

2018-01-16

Pain management guidelines in the emergency department (ED) may reduce time to analgesia administration (TTA). Intranasal fentanyl (INF) is a safe and effective alternative to intravenous opiates. The effect of an ED pain management guideline providing standing orders for nurse-initiated administration of intranasal fentanyl (INF) is not known. The objective of this study was to determine the impact of a pediatric ED triage-based pain protocol utilizing intranasal fentanyl (INF) on time to analgesia administration (TTA) and patient and parent satisfaction. This was a prospective study of patients 3-17 years with an isolated orthopedic injury presenting to a pediatric ED before and after instituting a triage-based pain guideline allowing for administration of INF by triage nurses. Our primary outcome was median TTA and secondary outcomes included the proportion of patients who received INF for pain, had unnecessary IV placement, and patient and parent satisfaction. We enrolled 132 patients; 72 pre-guideline, 60 post-guideline. Demographics were similar between groups. Median TTA was not different between groups (34.5 min vs. 33 min, p = .7). Utilization of INF increased from 41% pre-guideline to 60% post-guideline (p = .01) and unnecessary IV placement decreased from 24% to 0% (p = .002). Patients and parents preferred the IN route for analgesia administration. A triage-based pain protocol utilizing INF did not reduce TTA, but did result in increased INF use, decreased unnecessary IV placement, and was preferred by patients and parents to IV medication. INF is a viable analgesia alternative for children with isolated extremity injuries. Copyright © 2018. Published by Elsevier Inc.

Quantum chemistry simulation on quantum computers: theories and experiments.

PubMed

Lu, Dawei; Xu, Boruo; Xu, Nanyang; Li, Zhaokai; Chen, Hongwei; Peng, Xinhua; Xu, Ruixue; Du, Jiangfeng

2012-07-14

It has been claimed that quantum computers can mimic quantum systems efficiently in the polynomial scale. Traditionally, those simulations are carried out numerically on classical computers, which are inevitably confronted with the exponential growth of required resources, with the increasing size of quantum systems. Quantum computers avoid this problem, and thus provide a possible solution for large quantum systems. In this paper, we first discuss the ideas of quantum simulation, the background of quantum simulators, their categories, and the development in both theories and experiments. We then present a brief introduction to quantum chemistry evaluated via classical computers followed by typical procedures of quantum simulation towards quantum chemistry. Reviewed are not only theoretical proposals but also proof-of-principle experimental implementations, via a small quantum computer, which include the evaluation of the static molecular eigenenergy and the simulation of chemical reaction dynamics. Although the experimental development is still behind the theory, we give prospects and suggestions for future experiments. We anticipate that in the near future quantum simulation will become a powerful tool for quantum chemistry over classical computations.

ASCR Workshop on Quantum Computing for Science

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aspuru-Guzik, Alan; Van Dam, Wim; Farhi, Edward

This report details the findings of the DOE ASCR Workshop on Quantum Computing for Science that was organized to assess the viability of quantum computing technologies to meet the computational requirements of the DOE’s science and energy mission, and to identify the potential impact of quantum technologies. The workshop was held on February 17-18, 2015, in Bethesda, MD, to solicit input from members of the quantum computing community. The workshop considered models of quantum computation and programming environments, physical science applications relevant to DOE's science mission as well as quantum simulation, and applied mathematics topics including potential quantum algorithms formore » linear algebra, graph theory, and machine learning. This report summarizes these perspectives into an outlook on the opportunities for quantum computing to impact problems relevant to the DOE’s mission as well as the additional research required to bring quantum computing to the point where it can have such impact.« less

Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Mantri, Atul; Demarie, Tommaso F.; Menicucci, Nicolas C.; Fitzsimons, Joseph F.

2017-07-01

Blind quantum computation protocols allow a user to delegate a computation to a remote quantum computer in such a way that the privacy of their computation is preserved, even from the device implementing the computation. To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server or two or more entangled but noncommunicating servers. In this work, we take the first step towards the construction of a blind quantum computing protocol with a completely classical client and single quantum server. Specifically, we show how a classical client can exploit the ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding critical aspects of a computation delegated to a remote quantum computer. This ambiguity arises due to the fact that, for a fixed graph, there exist multiple choices of the input and output vertex sets that result in deterministic measurement patterns consistent with the same fixed total ordering of vertices. This allows a classical user, computing only measurement angles, to drive a measurement-based computation performed on a remote device while hiding critical aspects of the computation.

One-way quantum computing in superconducting circuits

NASA Astrophysics Data System (ADS)

Albarrán-Arriagada, F.; Alvarado Barrios, G.; Sanz, M.; Romero, G.; Lamata, L.; Retamal, J. C.; Solano, E.

2018-03-01

We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster state provides the quantum resource, while the iteration of sequential measurements and local rotations encodes the quantum algorithm. Up to now, technical constraints have limited a scalable approach to this quantum computing alternative. The initial cluster state can be generated with available controlled-phase gates, while the quantum algorithm makes use of high-fidelity readout and coherent feedforward. With current technology, we estimate that quantum algorithms with above 20 qubits may be implemented in the path toward quantum supremacy. Moreover, we propose an alternative initial state with properties of maximal persistence and maximal connectedness, reducing the required resources of one-way quantum computing protocols.

Quantum Spin Glasses, Annealing and Computation

NASA Astrophysics Data System (ADS)

Chakrabarti, Bikas K.; Inoue, Jun-ichi; Tamura, Ryo; Tanaka, Shu

2017-05-01

List of tables; List of figures, Preface; 1. Introduction; Part I. Quantum Spin Glass, Annealing and Computation: 2. Classical spin models from ferromagnetic spin systems to spin glasses; 3. Simulated annealing; 4. Quantum spin glass; 5. Quantum dynamics; 6. Quantum annealing; Part II. Additional Notes: 7. Notes on adiabatic quantum computers; 8. Quantum information and quenching dynamics; 9. A brief historical note on the studies of quantum glass, annealing and computation.

Quantum-Enhanced Cyber Security: Experimental Computation on Quantum-Encrypted Data

DTIC Science & Technology

2017-03-02

AFRL-AFOSR-UK-TR-2017-0020 Quantum-Enhanced Cyber Security: Experimental Computation on Quantum-Encrypted Data Philip Walther UNIVERSITT WIEN Final...REPORT TYPE Final 3. DATES COVERED (From - To) 15 Oct 2015 to 31 Dec 2016 4. TITLE AND SUBTITLE Quantum-Enhanced Cyber Security: Experimental Computation...FORM SF 298 Final Report for FA9550-1-6-1-0004 Quantum-enhanced cyber security: Experimental quantum computation with quantum-encrypted data

Computing quantum discord is NP-complete

NASA Astrophysics Data System (ADS)

Huang, Yichen

2014-03-01

We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, squashed entanglement, classical squashed entanglement, conditional entanglement of mutual information, and broadcast regularization of mutual information) and constrained Holevo capacity are NP-hard/NP-complete to compute. These complexity-theoretic results are directly applicable in common randomness distillation, quantum state merging, entanglement distillation, superdense coding, and quantum teleportation; they may offer significant insights into quantum information processing. Moreover, we prove the NP-completeness of two typical problems: linear optimization over classical states and detecting classical states in a convex set, providing evidence that working with classical states is generically computationally intractable.

Quantum Computation

NASA Astrophysics Data System (ADS)

Aharonov, Dorit

In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically powerful computational tool, capable of performing tasks which seem intractable for classical computers. This review is about to tell the story of theoretical quantum computation. I l out the developing topic of experimental realizations of the model, and neglected other closely related topics which are quantum information and quantum communication. As a result of narrowing the scope of this paper, I hope it has gained the benefit of being an almost self contained introduction to the exciting field of quantum computation. The review begins with background on theoretical computer science, Turing machines and Boolean circuits. In light of these models, I define quantum computers, and discuss the issue of universal quantum gates. Quantum algorithms, including Shor's factorization algorithm and Grover's algorithm for searching databases, are explained. I will devote much attention to understanding what the origins of the quantum computational power are, and what the limits of this power are. Finally, I describe the recent theoretical results which show that quantum computers maintain their complexity power even in the presence of noise, inaccuracies and finite precision. This question cannot be separated from that of quantum complexity because any realistic model will inevitably be subjected to such inaccuracies. I tried to put all results in their context, asking what the implications to other issues in computer science and physics are. In the end of this review, I make these connections explicit by discussing the possible implications of quantum computation on fundamental physical questions such as the transition from quantum to classical physics.

Influence of Immunogenicity on the Efficacy of Long-Term Treatment with TNFα Blockers in Rheumatoid Arthritis and Spondyloarthritis Patients

PubMed Central

2015-01-01

Objective. To analyze the clinical relevance of the levels of TNFα blockers and anti-drug antibodies (anti-drug Ab) in patients with rheumatoid arthritis (RA) and spondyloarthritis (SpA) treated with adalimumab (ADA), etanercept (ETA), or infliximab (INF) for a prolonged period of time. Methods. Clinical characteristics (disease activity, and adverse events), serum TNFα blockers, and anti-drug Ab levels were evaluated in 62 RA and 81 SpA patients treated with TNFα blockers for a median of 28 months. Results. Anti-ADA Ab were detected in 1 (4.0%) and anti-INF Ab in 14 out of 57 (24.6%) RA and SpA patients. Patient with anti-ADA Ab and 57.1% patients with anti-INF Ab were considered nonresponders to treatment. Anti-ETA Ab were not found in any of 61 ETA treated patients. Anti-ADA and anti-INF Ab levels differ between responders and nonresponders (P > 0.05). Three (5.3%) patients with high serum anti-INF Ab levels developed infusion related reactions. Patients with anti-INF Ab more often required changing to another biologic drug (OR 11.43 (95% CI 1.08–120.93)) and treatment discontinuation (OR 9.28 (95% CI 1.64–52.52)). Conclusion. Patients not responding to treatment had higher serum anti-ADA and anti-INF Ab concentrations. Anti-INF Ab formation is related to increased risk of infusion related reactions, changing to another biologic drug, and treatment discontinuation. PMID:26064930

Generation and characterization of functional mutants in the translation initiation factor IF1 of Escherichia coli.

PubMed

Croitoru, Victor; Bucheli-Witschel, Margarete; Hägg, Peter; Abdulkarim, Farhad; Isaksson, Leif A

2004-02-01

Three protein factors IF1, IF2 and IF3 are involved in the initiation of translation in prokaryotes. No clear function has been assigned to the smallest of these three factors, IF1. Therefore, to investigate the role of this protein in the initiation process in Escherichia coli we have mutated the corresponding gene infA. Because IF1 is essential for cell viability and no mutant selection has so far been described, the infA gene in a plasmid was mutated by site-directed mutagenesis in a strain with a chromosomal infA+ gene, followed by deletion of this infA+ gene. Using this approach, the six arginine residues of IF1 were altered to leucine or aspartate. Another set of plasmid-encoded IF1 mutants with a cold-sensitive phenotype was collected using localized random mutagenesis. All mutants with a mutated infA gene on a plasmid and a deletion of the chromosomal infA copy were viable, except for an R65D alteration. Differences in growth phenotypes of the mutants were observed in both minimal and rich media. Some of the mutated infA genes were successfully recombined into the chromosome thereby replacing the wild-type infA+ allele. Several of these recombinants showed reduced growth rate and a partial cold-sensitive phenotype. This paper presents a collection of IF1 mutants designed for in vivo and in vitro studies on the function of IF1.

Quantum Computing: Selected Internet Resources for Librarians, Researchers, and the Casually Curious

ERIC Educational Resources Information Center

Cirasella, Jill

2009-01-01

This article presents an annotated selection of the most important and informative Internet resources for learning about quantum computing, finding quantum computing literature, and tracking quantum computing news. All of the quantum computing resources described in this article are freely available, English-language web sites that fall into one…

Contextuality as a Resource for Models of Quantum Computation with Qubits

NASA Astrophysics Data System (ADS)

Bermejo-Vega, Juan; Delfosse, Nicolas; Browne, Dan E.; Okay, Cihan; Raussendorf, Robert

2017-09-01

A central question in quantum computation is to identify the resources that are responsible for quantum speed-up. Quantum contextuality has been recently shown to be a resource for quantum computation with magic states for odd-prime dimensional qudits and two-dimensional systems with real wave functions. The phenomenon of state-independent contextuality poses a priori an obstruction to characterizing the case of regular qubits, the fundamental building block of quantum computation. Here, we establish contextuality of magic states as a necessary resource for a large class of quantum computation schemes on qubits. We illustrate our result with a concrete scheme related to measurement-based quantum computation.

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

PubMed Central

Goto, Hayato

2016-01-01

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence. PMID:26899997

Architectures and Applications for Scalable Quantum Information Systems

DTIC Science & Technology

2007-01-01

quantum computation models, such as adiabatic quantum computing , can be converted to quantum circuits. Therefore, in our design flow’s first phase...vol. 26, no. 5, pp. 1484–1509, 1997. [19] A. Childs, E. Farhi, and J. Preskill, “Robustness of adiabatic quantum computation ,” Phys. Rev. A, vol. 65...magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic

Hybrid quantum computing with ancillas

NASA Astrophysics Data System (ADS)

Proctor, Timothy J.; Kendon, Viv

2016-10-01

In the quest to build a practical quantum computer, it is important to use efficient schemes for enacting the elementary quantum operations from which quantum computer programs are constructed. The opposing requirements of well-protected quantum data and fast quantum operations must be balanced to maintain the integrity of the quantum information throughout the computation. One important approach to quantum operations is to use an extra quantum system - an ancilla - to interact with the quantum data register. Ancillas can mediate interactions between separated quantum registers, and by using fresh ancillas for each quantum operation, data integrity can be preserved for longer. This review provides an overview of the basic concepts of the gate model quantum computer architecture, including the different possible forms of information encodings - from base two up to continuous variables - and a more detailed description of how the main types of ancilla-mediated quantum operations provide efficient quantum gates.

QCE: A Simulator for Quantum Computer Hardware

NASA Astrophysics Data System (ADS)

Michielsen, Kristel; de Raedt, Hans

2003-09-01

The Quantum Computer Emulator (QCE) described in this paper consists of a simulator of a generic, general purpose quantum computer and a graphical user interface. The latter is used to control the simulator, to define the hardware of the quantum computer and to debug and execute quantum algorithms. QCE runs in a Windows 98/NT/2000/ME/XP environment. It can be used to validate designs of physically realizable quantum processors and as an interactive educational tool to learn about quantum computers and quantum algorithms. A detailed exposition is given of the implementation of the CNOT and the Toffoli gate, the quantum Fourier transform, Grover's database search algorithm, an order finding algorithm, Shor's algorithm, a three-input adder and a number partitioning algorithm. We also review the results of simulations of an NMR-like quantum computer.

Verification for measurement-only blind quantum computing

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki

2014-06-01

Blind quantum computing is a new secure quantum computing protocol where a client who does not have any sophisticated quantum technology can delegate her quantum computing to a server without leaking any privacy. It is known that a client who has only a measurement device can perform blind quantum computing [T. Morimae and K. Fujii, Phys. Rev. A 87, 050301(R) (2013), 10.1103/PhysRevA.87.050301]. It has been an open problem whether the protocol can enjoy the verification, i.e., the ability of the client to check the correctness of the computing. In this paper, we propose a protocol of verification for the measurement-only blind quantum computing.

Experimental demonstration of blind quantum computing

NASA Astrophysics Data System (ADS)

Barz, Stefanie; Kashefi, Elham; Broadbent, Anne; Fitzsimons, Joe; Zeilinger, Anton; Walther, Philip

2012-02-01

Quantum computers are among the most promising applications of quantum-enhanced technologies. Quantum effects such as superposition and entanglement enable computational speed-ups that are unattainable using classical computers. The challenges in realising quantum computers suggest that in the near future, only a few facilities worldwide will be capable of operating such devices. In order to exploit these computers, users would seemingly have to give up their privacy. It was recently shown that this is not the case and that, via the universal blind quantum computation protocol, quantum mechanics provides a way to guarantee that the user's data remain private. Here, we demonstrate the first experimental version of this protocol using polarisation-entangled photonic qubits. We demonstrate various blind one- and two-qubit gate operations as well as blind versions of the Deutsch's and Grover's algorithms. When the technology to build quantum computers becomes available, this will become an important privacy-preserving feature of quantum information processing.

Single-server blind quantum computation with quantum circuit model

NASA Astrophysics Data System (ADS)

Zhang, Xiaoqian; Weng, Jian; Li, Xiaochun; Luo, Weiqi; Tan, Xiaoqing; Song, Tingting

2018-06-01

Blind quantum computation (BQC) enables the client, who has few quantum technologies, to delegate her quantum computation to a server, who has strong quantum computabilities and learns nothing about the client's quantum inputs, outputs and algorithms. In this article, we propose a single-server BQC protocol with quantum circuit model by replacing any quantum gate with the combination of rotation operators. The trap quantum circuits are introduced, together with the combination of rotation operators, such that the server is unknown about quantum algorithms. The client only needs to perform operations X and Z, while the server honestly performs rotation operators.

Polar extract of Curcuma longa protects cartilage homeostasis: possible mechanism of action.

PubMed

Velusami, Chandrasekaran Chinampudur; Richard, Edwin Jothie; Bethapudi, Bharathi

2018-01-08

Curcuma longa has been well documented for managing joint inflammation and pain. The present study investigated the effect of polar extract of C. longa (NR-INF-02) on cartilage homeostasis in human articular chondrocytes knee (NHAC-kn) cells to understand its plausible mechanism of action. Dysregulation of cartilage homeostasis was induced by IL-1β and H 2 O 2 . Modulating effects of NR-INF-02 on degradation markers viz., chondrocyte apoptosis, senescence, cytokine, eicosanoids, and cartilage synthesis markers viz., glycosaminoglycans and type II collagen degradation was evaluated in human articular chondrocytes knee (NHAC-kn) cells. Further, the effect of NR-INF-02 on lipopolysaccharide (LPS)-induced expression of NF-kB in RAW264.7 macrophages was investigated. NR-INF-02 significantly attenuated IL-1β-induced chondrocyte cytotoxicity, apoptosis and release of chondrocyte degradation markers such as IL-6, IL-8, COX-2, PGE 2 , TNF-α, ICAM-1 in NHAC-kn cells. Also, NR-INF-02 protected IL-1β-induced damage to synthesis markers such as glycosaminoglycans, type II collagen and further attenuated H 2 O 2 -induced chondrocyte senescence. In addition NR-INF-02 suppressed LPS-induced NF-kB expression in RAW264.7 cells. NR-INF-02 protects cartilage homeostasis by maintaining the balance between synthesis and degradation of cartilage matrix.

Association among metabolic syndrome, inflammation, and survival in prostate cancer.

PubMed

Conteduca, Vincenza; Caffo, Orazio; Galli, Luca; Maugeri, Antonio; Scarpi, Emanuela; Maines, Francesca; Chiuri, Vincenzo Emanuele; Lolli, Cristian; Kinspergher, Stefania; Schepisi, Giuseppe; Santoni, Matteo; Santini, Daniele; Fratino, Lucia; Burgio, Salvatore Luca; Salvi, Samanta; Menna, Cecilia; De Giorgi, Ugo

2018-05-01

Metabolic syndrome (MS) and inflammation (INF) alterations are among the factors involved in cancer progression. The study aimed to assess the relationship between MS and INF and its effect on progression-free/overall survival (PFS/OS) in metastatic castration-resistant prostate cancer (mCRPC) treaed with abiraterone or enzalutamide. We, retrospectively, evaluated patients with mCRPC in 7 Italian Institutes between March 2011 and October 2016. MS was defined by modified adult treatment panel-III criteria. INF was characterized by at least one of these criteria: neutrophil to lymphocyte ratio ≥ 3, elevated erythrocyte sedimentation rate or C-reactive protein. Eighty-three of 551 (15.1%) patients met MS criteria at baseline and 34 (6.2%) during treatment. MS patients (MS+) presented a greater INF profile compared to MS- (P<0.0001). Median PFS was 3.7 for MS+ vs. 8.7 months for MS- (hazard ratio [HR] = 2.77; 95% CI: 2.12-3.61; P<0.0001). Median OS was 6.9 and 19 months in MS+ and MS-, respectively (HR = 3.43; 95% CI: 2.56-4.58; P<0.0001). We also demonstrated INF led to shorter PFS and OS (4.5 vs. 8.5 months, HR = 1.48, 95% CI: 1.15-1.90, P = 0.002, and 11.2 vs. 18.8 months, HR =1.66, 95% CI: 1.26-2.18, P = 0.0003, respectively). The combination of MS with INF provided the identification of high-risk prognostic group (MS+/INF+ vs. MS-/INF-) with worse PFS (3.7 vs. 9 months, HR = 2.7, 95% CI: 1.88-3.89, P<0.0001) and OS (6.3 vs. 20.4 months, HR = 4.04, 95% CI: 2.75-5.93, P<0.0001). Multivariable analysis confirmed that MS was independently associated with PFS (HR = 2.07; 95% CI: 1.03-4.18; P = 0.041) and OS (HR = 4.87; 95% CI: 2.36-10.03; P<0.0001). The absence of INF as an independent predictor of survival underlined the correlation between MS/INF. Pretreatment identification of MS and INF alterations might represent an available and easy tool for better prognostication of patients with mCRPC. A prospective evaluation is warranted. Copyright © 2018 Elsevier Inc. All rights reserved.

Sera from severe trauma patients with pneumonia and without infectious complications have differential effects on neutrophil biology.

PubMed

Relja, B; Taraki, R; Teuben, M P J; Mörs, K; Wagner, N; Wutzler, S; Hildebrand, F; Perl, M; Marzi, I

2016-12-01

Major trauma patients (TP) developing imbalanced immune response are at high risk for infectious post-injury complications including pneumonia. Neutrophils play a central role in the host defense against bacteria and thereby pathogenesis of infections. While there are numerous studies about neutrophil function after trauma, data about their biology in patients who suffer from pneumonia following trauma are sparse. Here, we studied the effect of serum isolated from patients who do and do not develop infection (inf.) on the biology of neutrophils from healthy volunteers. Sera samples from eighteen TP with an injury severity score above 16 were obtained. Nine patients were grouped to no inf. group (TP without pneumonia), and nine to inf. group (TP with pneumonia). Samples were obtained at admission to emergency department (ED), a day prior pneumonia diagnosis (1 d prior inf) or at the day of diagnosis (1 d prior inf). Samples from the equal post-injury days in the corresponding no inf. group were used. Neutrophils from nine healthy volunteers were isolated. Effects for sera isolated from infected and non-infected patients on neutrophil biology were analyzed. Migratory capacity of neutrophils towards TP's serum, their CD11b and CD62L membrane receptor expression and oxidative burst activity after stimulation with TP's serum were determined and compared between groups. Migratory capacity of neutrophils was significantly increased after trauma and persisted during the study period. CD11b expression in all groups was significantly increased. CD62L expression decreased generally in samples from ED and recovered later to baseline. Stratifying no inf. and inf. groups showed significantly decreased migratory capacity, increased CD11b and significantly decreased CD62L expression in the no inf. group. These differences persisted during the complete observational period. ROS production was strongly reduced in the no inf. group compared to the inf. group at later experimental time points. This data indicate that patients at risk for pneumonia development have differentially and early activated neutrophils following trauma compared to patients who are not at risk for post-injury complication. Studies about the differential biology of neutrophils and their immediately after trauma modified activity depending on the post-injury clinical course are warranted, and may deliver predictive or even therapeutic strategies to control inflammation.

Contextuality supplies the 'magic' for quantum computation.

PubMed

Howard, Mark; Wallman, Joel; Veitch, Victor; Emerson, Joseph

2014-06-19

Quantum computers promise dramatic advantages over their classical counterparts, but the source of the power in quantum computing has remained elusive. Here we prove a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via 'magic state' distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer. This is a conceptually satisfying link, because contextuality, which precludes a simple 'hidden variable' model of quantum mechanics, provides one of the fundamental characterizations of uniquely quantum phenomena. Furthermore, this connection suggests a unifying paradigm for the resources of quantum information: the non-locality of quantum theory is a particular kind of contextuality, and non-locality is already known to be a critical resource for achieving advantages with quantum communication. In addition to clarifying these fundamental issues, this work advances the resource framework for quantum computation, which has a number of practical applications, such as characterizing the efficiency and trade-offs between distinct theoretical and experimental schemes for achieving robust quantum computation, and putting bounds on the overhead cost for the classical simulation of quantum algorithms.

Exploiting Locality in Quantum Computation for Quantum Chemistry.

PubMed

McClean, Jarrod R; Babbush, Ryan; Love, Peter J; Aspuru-Guzik, Alán

2014-12-18

Accurate prediction of chemical and material properties from first-principles quantum chemistry is a challenging task on traditional computers. Recent developments in quantum computation offer a route toward highly accurate solutions with polynomial cost; however, this solution still carries a large overhead. In this Perspective, we aim to bring together known results about the locality of physical interactions from quantum chemistry with ideas from quantum computation. We show that the utilization of spatial locality combined with the Bravyi-Kitaev transformation offers an improvement in the scaling of known quantum algorithms for quantum chemistry and provides numerical examples to help illustrate this point. We combine these developments to improve the outlook for the future of quantum chemistry on quantum computers.

Computational Multiqubit Tunnelling in Programmable Quantum Annealers

DTIC Science & Technology

2016-08-25

ARTICLE Received 3 Jun 2015 | Accepted 26 Nov 2015 | Published 7 Jan 2016 Computational multiqubit tunnelling in programmable quantum annealers...state itself. Quantum tunnelling has been hypothesized as an advantageous physical resource for optimization in quantum annealing. However, computational ...qubit tunnelling plays a computational role in a currently available programmable quantum annealer. We devise a probe for tunnelling, a computational

Complexity Bounds for Quantum Computation

DTIC Science & Technology

2007-06-22

Programs Trustees of Boston University Boston, MA 02215 - Complexity Bounds for Quantum Computation REPORT DOCUMENTATION PAGE 18. SECURITY CLASSIFICATION...Complexity Bounds for Quantum Comp[utation Report Title ABSTRACT This project focused on upper and lower bounds for quantum computability using constant...classical computation models, particularly emphasizing new examples of where quantum circuits are more powerful than their classical counterparts. A second

Application of Blind Quantum Computation to Two-Party Quantum Computation

NASA Astrophysics Data System (ADS)

Sun, Zhiyuan; Li, Qin; Yu, Fang; Chan, Wai Hong

2018-06-01

Blind quantum computation (BQC) allows a client who has only limited quantum power to achieve quantum computation with the help of a remote quantum server and still keep the client's input, output, and algorithm private. Recently, Kashefi and Wallden extended BQC to achieve two-party quantum computation which allows two parties Alice and Bob to perform a joint unitary transform upon their inputs. However, in their protocol Alice has to prepare rotated single qubits and perform Pauli operations, and Bob needs to have a powerful quantum computer. In this work, we also utilize the idea of BQC to put forward an improved two-party quantum computation protocol in which the operations of both Alice and Bob are simplified since Alice only needs to apply Pauli operations and Bob is just required to prepare and encrypt his input qubits.

Application of Blind Quantum Computation to Two-Party Quantum Computation

NASA Astrophysics Data System (ADS)

Sun, Zhiyuan; Li, Qin; Yu, Fang; Chan, Wai Hong

2018-03-01

Blind quantum computation (BQC) allows a client who has only limited quantum power to achieve quantum computation with the help of a remote quantum server and still keep the client's input, output, and algorithm private. Recently, Kashefi and Wallden extended BQC to achieve two-party quantum computation which allows two parties Alice and Bob to perform a joint unitary transform upon their inputs. However, in their protocol Alice has to prepare rotated single qubits and perform Pauli operations, and Bob needs to have a powerful quantum computer. In this work, we also utilize the idea of BQC to put forward an improved two-party quantum computation protocol in which the operations of both Alice and Bob are simplified since Alice only needs to apply Pauli operations and Bob is just required to prepare and encrypt his input qubits.

Decoherence in adiabatic quantum computation

NASA Astrophysics Data System (ADS)

Albash, Tameem; Lidar, Daniel A.

2015-06-01

Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master-equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which correspond to decoherence in the energy eigenbasis and in the computational basis, respectively. We demonstrate that decoherence in the instantaneous energy eigenbasis does not necessarily detrimentally affect adiabatic quantum computation, and in particular that a short single-qubit T2 time need not imply adverse consequences for the success of the quantum adiabatic algorithm. We further demonstrate that boundary cancellation methods, designed to improve the fidelity of adiabatic quantum computing in the closed-system setting, remain beneficial in the open-system setting. To address the high computational cost of master-equation simulations, we also demonstrate that a quantum Monte Carlo algorithm that explicitly accounts for a thermal bosonic bath can be used to interpolate between classical and quantum annealing. Our study highlights and clarifies the significantly different role played by decoherence in the adiabatic and circuit models of quantum computing.

Spin-based quantum computation in multielectron quantum dots

NASA Astrophysics Data System (ADS)

Hu, Xuedong; Das Sarma, S.

2001-10-01

In a quantum computer the hardware and software are intrinsically connected because the quantum Hamiltonian (or more precisely its time development) is the code that runs the computer. We demonstrate this subtle and crucial relationship by considering the example of electron-spin-based solid-state quantum computer in semiconductor quantum dots. We show that multielectron quantum dots with one valence electron in the outermost shell do not behave simply as an effective single-spin system unless special conditions are satisfied. Our work compellingly demonstrates that a delicate synergy between theory and experiment (between software and hardware) is essential for constructing a quantum computer.

Elucidating reaction mechanisms on quantum computers.

PubMed

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M; Wecker, Dave; Troyer, Matthias

2017-07-18

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

Elucidating reaction mechanisms on quantum computers

PubMed Central

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M.; Wecker, Dave; Troyer, Matthias

2017-01-01

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources. PMID:28674011

Elucidating reaction mechanisms on quantum computers

NASA Astrophysics Data System (ADS)

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M.; Wecker, Dave; Troyer, Matthias

2017-07-01

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

Software Systems for High-performance Quantum Computing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S; Britt, Keith A

Quantum computing promises new opportunities for solving hard computational problems, but harnessing this novelty requires breakthrough concepts in the design, operation, and application of computing systems. We define some of the challenges facing the development of quantum computing systems as well as software-based approaches that can be used to overcome these challenges. Following a brief overview of the state of the art, we present models for the quantum programming and execution models, the development of architectures for hybrid high-performance computing systems, and the realization of software stacks for quantum networking. This leads to a discussion of the role that conventionalmore » computing plays in the quantum paradigm and how some of the current challenges for exascale computing overlap with those facing quantum computing.« less

Homomorphic encryption experiments on IBM's cloud quantum computing platform

NASA Astrophysics Data System (ADS)

Huang, He-Liang; Zhao, You-Wei; Li, Tan; Li, Feng-Guang; Du, Yu-Tao; Fu, Xiang-Qun; Zhang, Shuo; Wang, Xiang; Bao, Wan-Su

2017-02-01

Quantum computing has undergone rapid development in recent years. Owing to limitations on scalability, personal quantum computers still seem slightly unrealistic in the near future. The first practical quantum computer for ordinary users is likely to be on the cloud. However, the adoption of cloud computing is possible only if security is ensured. Homomorphic encryption is a cryptographic protocol that allows computation to be performed on encrypted data without decrypting them, so it is well suited to cloud computing. Here, we first applied homomorphic encryption on IBM's cloud quantum computer platform. In our experiments, we successfully implemented a quantum algorithm for linear equations while protecting our privacy. This demonstration opens a feasible path to the next stage of development of cloud quantum information technology.

Parasitic Nematode-Induced CD4+Foxp3+T Cells Can Ameliorate Allergic Airway Inflammation

PubMed Central

Kang, Shin Ae; Park, Mi-Kyung; Cho, Min Kyoung; Park, Sang Kyun; Jang, Min Seong; Yang, Bo-Gie; Jang, Myoung Ho; Kim, Dong-Hee; Yu, Hak Sun

2014-01-01

Background The recruitment of CD4+CD25+Foxp3+T (Treg) cells is one of the most important mechanisms by which parasites down-regulate the immune system. Methodology/Principal Findings We compared the effects of Treg cells from Trichinella spiralis-infected mice and uninfected mice on experimental allergic airway inflammation in order to understand the functions of parasite-induced Treg cells. After four weeks of T. spiralis infection, we isolated Foxp3-GFP-expressing cells from transgenic mice using a cell sorter. We injected CD4+Foxp3+ cells from T. spiralis-infected [Inf(+)Foxp3+] or uninfected [Inf(-)Foxp3+] mice into the tail veins of C57BL/6 mice before the induction of inflammation or during inflammation. Inflammation was induced by ovalbumin (OVA)-alum sensitization and OVA challenge. The concentrations of the Th2-related cytokines IL-4, IL-5, and IL-13 in the bronchial alveolar lavage fluid and the levels of OVA-specific IgE and IgG1 in the serum were lower in mice that received intravenous application of Inf(+)Foxp3+ cells [IV(inf):+(+) group] than in control mice. Some features of allergic airway inflammation were ameliorated by the intravenous application of Inf(-)Foxp3+ cells [IV(inf):+(-) group], but the effects were less distinct than those observed in the IV(inf):+(+) group. We found that Inf(+)Foxp3+ cells migrated to inflammation sites in the lung and expressed higher levels of Treg-cell homing receptors (CCR5 and CCR9) and activation markers (Klrg1, Capg, GARP, Gzmb, OX40) than did Inf(-)Foxp3+ cells. Conclusion/Significance T. spiralis infection promotes the proliferation and functional activation of Treg cells. Parasite-induced Treg cells migrate to the inflammation site and suppress immune responses more effectively than non-parasite-induced Treg cells. The adoptive transfer of Inf(+)Foxp3+ cells is an effective method for the treatment and prevention of allergic airway diseases in mice and is a promising therapeutic approach for the treatment of allergic airway diseases. PMID:25522145

A cross-disciplinary introduction to quantum annealing-based algorithms

NASA Astrophysics Data System (ADS)

Venegas-Andraca, Salvador E.; Cruz-Santos, William; McGeoch, Catherine; Lanzagorta, Marco

2018-04-01

A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics and computer science; hence this article presents a concise introduction to basic concepts from both fields that are used in annealing-based quantum computation, an alternative to the more familiar quantum gate model. We introduce some concepts from computer science required to define difficult computational problems and to realise the potential relevance of quantum algorithms to find novel solutions to those problems. We introduce the structure of quantum annealing-based algorithms as well as two examples of this kind of algorithms for solving instances of the max-SAT and Minimum Multicut problems. An overview of the quantum annealing systems manufactured by D-Wave Systems is also presented.

Families of short interspersed elements in the genome of the oomycete plant pathogen, Phytophthora infestans.

PubMed

Whisson, Stephen C; Avrova, Anna O; Lavrova, Olga; Pritchard, Leighton

2005-04-01

The first known families of tRNA-related short interspersed elements (SINEs) in the oomycetes were identified by exploiting the genomic DNA sequence resources for the potato late blight pathogen, Phytophthora infestans. Fifteen families of tRNA-related SINEs, as well as predicted tRNAs, and other possible RNA polymerase III-transcribed sequences were identified. The size of individual elements ranges from 101 to 392 bp, representing sequences present from low (1) to highly abundant (over 2000) copy number in the P. infestans genome, based on quantitative PCR analysis. Putative short direct repeat sequences (6-14 bp) flanking the elements were also identified for eight of the SINEs. Predicted SINEs were named in a series prefixed infSINE (for infestans-SINE). Two SINEs were apparently present as multimers of tRNA-related units; four copies of a related unit for infSINEr, and two unrelated units for infSINEz. Two SINEs, infSINEh and infSINEi, were typically located within 400 bp of each other. These were also the only two elements identified as being actively transcribed in the mycelial stage of P. infestans by RT-PCR. It is possible that infSINEh and infSINEi represent active retrotransposons in P. infestans. Based on the quantitative PCR estimates of copy number for all of the elements identified, tRNA-related SINEs were estimated to comprise 0.3% of the 250 Mb P. infestans genome. InfSINE-related sequences were found to occur in species throughout the genus Phytophthora. However, seven elements were shown to be exclusive to P. infestans.

Stromal Fibroblasts from the Interface Zone of Triple Negative Breast Carcinomas Induced Epithelial-Mesenchymal Transition and its Inhibition by Emodin

PubMed Central

Wang, Hao-Yu; Hung, Chao-Ming; Lin, Ying-Chao; Ho, Chi-Tang; Way, Tzong-Der

2017-01-01

“Triple negative breast cancer” (TNBC) is associated with a higher rate and earlier time of recurrence and worse prognosis after recurrence. In this study, we aimed to examine the crosstalk between fibroblasts and TNBC cells. The fibroblasts were isolated from TNBC patients’ tissue in tumor burden zones, distal normal zones and interface zones. The fibroblasts were indicated as cancer-associated fibroblasts (CAFs), normal zone fibroblasts (NFs) and interface zone fibroblasts (INFs). Our study found that INFs grew significantly faster than NFs and CAFs in vitro. The epithelial BT20 cells cultured with the conditioned medium of INFs (INFs-CM) and CAFs (CAFs-CM) showed more spindle-like shape and cell scattering than cultured with the conditioned medium of NFs (NFs-CM). These results indicated that factors secreted by INFs-CM or CAFs-CM could induce the epithelial-mesenchymal transition (EMT) phenotype in BT20 cells. Using an in vitro co-culture model, INFs or CAFs induced EMT and promoted cancer cell migration in BT20 cells. Interestingly, we found that emodin inhibited INFs-CM or CAFs-CM-induced EMT programming and phenotype in BT20 cells. Previous studies reported that CAFs and INFs-secreted TGF-β promoted human breast cancer cell proliferation, here; our results indicated that TGF-β initiated EMT in BT20 cells. Pretreatment with emodin significantly suppressed the TGF-β-induced EMT and cell migration in BT20 cells. These results suggest that emodin may be used as a novel agent for the treatment of TNBC. PMID:28060811

Some Thoughts Regarding Practical Quantum Computing

NASA Astrophysics Data System (ADS)

Ghoshal, Debabrata; Gomez, Richard; Lanzagorta, Marco; Uhlmann, Jeffrey

2006-03-01

Quantum computing has become an important area of research in computer science because of its potential to provide more efficient algorithmic solutions to certain problems than are possible with classical computing. The ability of performing parallel operations over an exponentially large computational space has proved to be the main advantage of the quantum computing model. In this regard, we are particularly interested in the potential applications of quantum computers to enhance real software systems of interest to the defense, industrial, scientific and financial communities. However, while much has been written in popular and scientific literature about the benefits of the quantum computational model, several of the problems associated to the practical implementation of real-life complex software systems in quantum computers are often ignored. In this presentation we will argue that practical quantum computation is not as straightforward as commonly advertised, even if the technological problems associated to the manufacturing and engineering of large-scale quantum registers were solved overnight. We will discuss some of the frequently overlooked difficulties that plague quantum computing in the areas of memories, I/O, addressing schemes, compilers, oracles, approximate information copying, logical debugging, error correction and fault-tolerant computing protocols.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sherrett, R.R.

This study investigates the relationship between NATO's decision to approach the problem created by the intermediate-range nuclear force superiority of the Soviets and the eventual signing of the INF Treaty by the United States and the Soviet Union. The concept presented is that by adopting the dual track decision, (a track for negotiations and a simultaneous track for fielding U.S. INF missiles), the United States was eventually able to conduct arms negotiations from a position of strength. In this way a significant contribution to the INF Treaty negotiation process was made. The study examines the position of each principal priormore » to the dual track decision, examines the role each played in that decision, and looks at the actions taken following the implementation of the dual track decision. The study also presents the nuclear background of NATO, and also examines the INF negotiations in some detail. The conclusions provide the current status of the INF Treaty implementation and outlines some lessons which could be applied to future negotiations of this type. Intermediate-range Nuclear Forces, INF Treaty, GLCM, PIT, Pershing II missiles, Ground Launched Cruise Missiles, Dual Track Decision, Nuclear arms negotiations.« less

Intermediate-range Nuclear Forces (INF) negotiations and treaty: An historical case study. Master's thesis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wussler, D.E.

1989-09-01

This thesis performs detailed analysis of the Intermediate Range Nuclear Forces (INF) negotiations and treaty and compares them with those of the two Strategic Arms Limitations Talks (SALT). The study's objectives were: describe SALT and INF negotiations and the contents of the treaties; analyze US and Soviet goals and strategies during the INF negotiations; determine which goals were or were not attained by both sides, and ascertain reasons for this; and delineate arms control progress and prospects since INF Treaty ratification. The study found that the two SALT treaties did impose ceilings in certain areas of strategic weapons but didmore » not curtail the arms race. Treaty verification methods were criticized as being lax. The US achieved the major goal of ridding Europe of the Soviet SS-20 missile. It had to deploy missiles of its own to make the USSR realize the seriousness of its resolve. The US had total support from NATO in achieving this goal. However, with INF gone, the European conventional forces imbalance looms larger, and the West is fighting to obtain asymmetric conventional cuts.« less

Novel Shear-horizontal Surface Acoustic Wave Based Immunosensors Using SiO2Waveguiding Layers And Flow Injection Analysis.

PubMed

Guo, X S; Chen, Y Q; Yang, X L; Wang, L R

2005-01-01

Surface acoustic wave (SAW) devices based on shear-horizontal (SH) waves can be used as mass-sensitive immunosensors. This paper presents a novel SH-SAW sensor to detect anti-immunoglobulin (IgG) molecules by means of the antibody-antigen binding mechanism. The sensor system comprising dual delay lines was fabricated on 36° Y-X LiTaO3substrate. A SiO2layer was used as love mode waveguiding layers, well as insulating and chemically resistant protective layer. Moreover, flow injection analysis (FIA) method was used for continuous detection the protein molecules. The protein A was immobilized on the optional surface of the gold layer, then coupled with IgG to adsorb the antigens to be measured in the protein solution. The operational frequency of the system changed due to the interaction of antibody-antigen binding. The experimental result demonstrates the sensor has stable frequency response to the mass loading effect of the various anti-IgG concentrations with the sensitivity up to 3.3ng/ml/Hz.

Non-unitary probabilistic quantum computing circuit and method

NASA Technical Reports Server (NTRS)

Williams, Colin P. (Inventor); Gingrich, Robert M. (Inventor)

2009-01-01

A quantum circuit performing quantum computation in a quantum computer. A chosen transformation of an initial n-qubit state is probabilistically obtained. The circuit comprises a unitary quantum operator obtained from a non-unitary quantum operator, operating on an n-qubit state and an ancilla state. When operation on the ancilla state provides a success condition, computation is stopped. When operation on the ancilla state provides a failure condition, computation is performed again on the ancilla state and the n-qubit state obtained in the previous computation, until a success condition is obtained.

[Simultaneous detection of respiratory viruses and influenza A virus subtypes using multiplex PCR].

PubMed

Ciçek, Candan; Bayram, Nuri; Anıl, Murat; Gülen, Figen; Pullukçu, Hüsnü; Saz, Eylem Ulaş; Telli, Canan; Cok, Gürsel

2014-10-01

This study was conducted to investigate the respiratory viruses and subtyping of influenza A virus when positive by multiplex PCR in patients with flu-like symptoms, after the pandemic caused by influenza A (H1N1)pdm09. Nasopharyngeal swab samples collected from 700 patients (313 female, 387 male; age range: 24 days-94 yrs, median age: 1 yr) between December 2010 - January 2013 with flu-like symptoms including fever, headache, sore throat, rhinitis, cough, myalgia as defined by the World Health Organization were included in the study. Nucleic acid extractions (Viral DNA/RNA Extraction Kit, iNtRON, South Korea) and cDNA synthesis (RevertAid First Strand cDNA Synthesis Kits, Fermentas, USA) were performed according to the manufacturer's protocol. Multiplex amplification of nucleic acids was performed using DPO (dual priming oligonucleotide) primers and RV5 ACE Screening Kit (Seegene, South Korea) in terms of the presence of influenza A (INF-A) virus, influenza B (INF-B) virus, respiratory syncytial virus (RSV), and the other respiratory viruses. PCR products were detected by automated polyacrylamide gel electrophoresis using Screen Tape multiple detection system. Specimens which were positive for viral nucleic acids have been further studied by using specific DPO primers, FluA ACE Subtyping and RV15 Screening (Seegene, South Korea) kits. Four INF-A virus subtypes [human H1 (hH1), human H3 (hH3), swine H1 (sH1), avian H5 (aH5)] and 11 other respiratory viruses [Adenovirus, parainfluenza virus (PIV) types 1-4, human bocavirus (HBoV), human metapneumovirus (HMPV), rhinovirus types A and B, human coronaviruses (HCoV) OC43, 229E/NL63] were investigated with those tests. In the study, 53.6% (375/700) of the patients were found to be infected with at least one virus and multiple respiratory virus infections were detected in 15.7% (59/375) of the positive cases, which were mostly (49/59, 83%) in pediatric patients. RSV and rhinovirus coinfections were the most prevalent (18/29, 62.7%) dual infections. The distribution of 436 respiratory viruses identified from 375 patients were as follows; 189 (43.3%) RSV, 93 (21.4%) rhinovirus, 86 (19.8%) INF-A, seven (1.6%) INF-B, 22 (5%) PIV types 1-3, 14 (3.2%) HMPV, 11 (2.5%) HCoV, nine (2%) HBoV, and five (1.2%) adenovirus. Fifty-five (64%) out of 86 INF-A viruses were subtyped as hH3, 24 (27.9%) were sH1 and seven (8.1%) were hH1. Avian H5 was not detected in any samples. The overall prevalence rates of INF-A, INF-B, RSV and other respiratory viruses were 12%, 1%, 27%, and 14.6%, respectively. RSV was the most prevalent respiratory agent in pediatric (161/313, 51%) cases, while INF-A virus in adult (24/62, 38.7%) patients. Influenza viruses were detected as responsible pathogens in 13.3% (93/700) of the patients with flu-like symptoms. Among the cases, a 1-month-old baby was infected with three virus strains (INF-A hH1+INF-A sH1+HCoV OC43) and a 82-year-old patient was infected with two INF-A virus subtypes (hH3 + sH1). INF-A viruses were mostly detected (79/86) in winter period, from December to March. INF-A virus sH1, was the most prevalent subtype in flu cases till February 2011 (22/86), after replaced by INF-A virus hH3. Beginning from February 2012, a significant increase observed in the cases infected with INF-A virus subtype hH3 (39/86). In conclusion, the identification and surveillance of influenza virus types and subtypes circulating in populations have importance both for epidemiological data and selection of vaccine strains.

Infiltration of forest fire and residential wood smoke: an evaluation of air cleaner effectiveness.

PubMed

Barn, Prabjit; Larson, Timothy; Noullett, Melanie; Kennedy, Susan; Copes, Ray; Brauer, Michael

2008-09-01

Communities impacted by fine-particle air pollution (particles with an aerodynamic diameter less than 2.5 microm; PM(2.5)) from forest fires and residential wood burning require effective, evidence-based exposure-reduction strategies. Public health recommendations during smoke episodes typically include advising community members to remain indoors and the use of air cleaners, yet little information is available on the effectiveness of these measures. Our study attempted to address the following objectives: to measure indoor infiltration factor (F(inf)) of PM(2.5) from forest fires/wood smoke, to determine the effectiveness of high-efficiency particulate air (HEPA) filter air cleaners in reducing indoor PM(2.5), and to analyze the home determinants of F(inf) and air cleaner effectiveness (ACE). We collected indoor/outdoor 1-min PM(2.5) averages and 48-h outdoor PM(2.5) filter samples for 21 winter and 17 summer homes impacted by wood burning and forest fire smoke, respectively, during 2004-2005. A portable HEPA filter air cleaner was operated indoors with the filter removed for one of two sampling days. Particle F(inf) and ACE were calculated for each home using a recursive model. We found mean F(inf)+/-SD was 0.27+/-0.18 and 0.61+/-0.27 in winter (n=19) and summer (n=13), respectively, for days when HEPA filters were not used. Lower F(inf)+/-SD values of 0.10+/-0.08 and 0.19+/-0.20 were found on corresponding days when HEPA filters were in place. Mean+/-SD ACE ([F(inf) without filter-F(inf) with filter]/F(inf) without filter) in winter and summer were 55+/-38% and 65+/-35%, respectively. Number of windows and season predicted F(inf) (P<0.001). No significant predictors of ACE were identified. Our findings show that remaining indoors combined with use of air cleaner can effectively reduce PM(2.5) exposure during forest fires and residential wood burning.

[Efficacy, influencing factors and safety of PEG-INF alpha-2a (PEG-INF-2a) in the treatment of chronic hepatitis C: analysis of 89 patients].

PubMed

Ma, Li-na; Chen, Xin-yue; Chen, Jie; Shen, Cheng-li; Wang, Jun-tao

2006-06-01

To investigate the efficacy, influencing factors and safety of PEG-INF alpha-2a (PEG-INF-2a) in the treatment of hepatitis C. Totally 89 patients with hepatitis C were included in this study and 46 patients were treated with PEG-INF-2a (180 microg or 135 microg/week) and RBV 900 mg/d, 43 patients were treated with IFNalpha-2a (5 MIU/qod) and RBV 900 mg/d. The time of treatment was 48 weeks, and all the patients were visited 24 weeks after treatment. There were no significant differences between the two groups in pretreatment HCV-RNA, HCV genotype and other clinical data. The main parameters to evaluate the efficacy were virological and biochemical responses. The side effects were intensively observed. Sustained virological response (SVR) rate in PEG-IFNalpha-2a group was significantly higher than that in IFNalpha-2a group (56.5% and 19.5% respectively, P<0.001). As the patients were divided according to HCV genotype 1 and high virus load, the SVR rate of PEG-INF alpha-2a group was higher than IFNalpha-2a group (P<0.001). However, there was no significant difference between two groups in the patients with non-genotype 1 and low viral load (P=0.664, 0.116). Similar side-effects were observed in PEG-IFNalpha-2a group and IFNalpha-2a group, but the rate of weight decline and the degree of leukocyte decrease were more significant in PEG-INF alpha-2a group than in IFNalpha-2a group (P=0.001). The efficacy of PEG-INF alpha-2a in the treatment of chronic hepatitis C is superior to that of conventional IFNalpha-2a, PEG-INF alpha-2a had good tolerance and safety profiles.

Relation between iron metabolism and antioxidants enzymes and δ-ALA-D activity in rats experimentally infected by Fasciola hepatica.

PubMed

Bottari, Nathieli B; Mendes, Ricardo E; Baldissera, Matheus D; Bochi, Guilherme V; Moresco, Rafael N; Leal, Marta L R; Morsch, Vera M; Schetinger, Maria R C; Christ, Ricardo; Gheller, Larissa; Marques, Éder J; Da Silva, Aleksandro S

2016-06-01

The aim of this study was to evaluate the iron metabolism in serum, as well as antioxidant enzymes, in addition to the Delta-Aminolevulinic Acid Dehydratase (δ-ALA-D) activity in the liver of rats experimentally infected by Fasciola hepatica. Thirty male adult rats (Wistar) specific pathogen free were divided into four groups: two uninfected group (CTRL 1 and CTRL 2) with five animals each and two infected groups (INF 1 and INF 2) with 10 animals each. Infection was performed orally with 20 metacercariae at day 1. On day 15 (CTRL 1 and INF 1 groups) and 87 PI (CTRL 2 and INF 2 groups) blood and bone marrow were collected and the animals were subsequently euthanized for liver sampling. Blood was allocated in tubes without anticoagulant for serum acquisition to measure iron, transferrin and unsaturated iron binding capacity (UIBC). δ-ALA-D, superoxide dismutase (SOD), and catalase (CAT) activities were measured in the liver. A decrease in iron, transferrin and UIBC levels was observed in all infected animals compared to control groups (P < 0.05). Furthermore, iron accumulation was observed in bone marrow of infected mice. Infected animals showed an increase in δ-ALA-D activity at 87 post-infection (PI) (INF 2) as well as in SOD activity at days 15 (INF 1) and 87 PI (INF 2). On the other hand, CAT activity was reduced in rats infected by F. hepatica during acute and chronic phase of fasciolosis (INF 1 and INF 2 groups), when moderate (acute) and severe necrosis in the liver histopathology were observed. These results may suggest that oxidative damage to tissues along with antioxidant mechanisms might have taken part in fasciolosis pathogenesis and are also involved in iron deficiency associated to changes in δ-ALA-D activity during chronic phase of disease. Copyright © 2016 Elsevier Inc. All rights reserved.

Comparing biosimilar SB2 with reference infliximab after 54 weeks of a double-blind trial: clinical, structural and safety results.

PubMed

Smolen, Josef S; Choe, Jung-Yoon; Prodanovic, Nenad; Niebrzydowski, Jaroslaw; Staykov, Ivan; Dokoupilova, Eva; Baranauskaite, Asta; Yatsyshyn, Roman; Mekic, Mevludin; Porawska, Wieskawa; Ciferska, Hana; Jedrychowicz-Rosiak, Krystyna; Zielinska, Agnieszka; Choi, Jasmine; Rho, Young Hee

2017-10-01

SB2 is a biosimilar to the reference infliximab (INF). Similar efficacy, safety and immunogenicity between SB2 and INF up to 30 weeks were previously reported. This report investigates such clinical similarity up to 54 weeks, including structural joint damage. In this phase III, double-blind, parallel-group, multicentre study, patients with moderate to severe RA despite MTX were randomized (1:1) to receive 3 mg/kg of either SB2 or INF at 0, 2, 6 and every 8 weeks thereafter. Dose escalation by 1.5 mg/kg up to a maximum dose of 7.5 mg/kg was allowed after week 30. Efficacy, safety and immunogenicity were measured at each visit up to week 54. Radiographic damage evaluated by modified total Sharp score was measured at baseline and week 54. A total of 584 patients were randomized to receive SB2 (n = 291) or INF (n = 293). The rate of radiographic progression was comparable between SB2 and INF (mean modified total Sharp score difference: SB2, 0.38; INF, 0.37) at 1 year. ACR responses, 28-joint DAS, Clinical Disease Activity Index and Simplified Disease Activity Index were comparable between SB2 and INF up to week 54. The incidence of treatment-emergent adverse events and anti-drug antibodies were comparable between treatment groups. Such comparable trends of efficacy, safety and immunogenicity were consistent from baseline up to 54 weeks. The pattern of dose increment was also comparable between SB2 and INF. SB2 maintained similar efficacy, safety and immunogenicity with INF up to 54 weeks in patients with moderate to severe RA. Radiographic progression was comparable at 1 year. ClinicalTrials.gov (http://clinicaltrials.gov; NCT01936181) and EudraCT (https://www.clinicaltrialsregister.eu; 2012-005733-37). © The Author 2017. Published by Oxford University Press on behalf of the British Society for Rheumatology.

Comparing biosimilar SB2 with reference infliximab after 54 weeks of a double-blind trial: clinical, structural and safety results

PubMed Central

Smolen, Josef S.; Choe, Jung-Yoon; Prodanovic, Nenad; Niebrzydowski, Jaroslaw; Staykov, Ivan; Dokoupilova, Eva; Baranauskaite, Asta; Yatsyshyn, Roman; Mekic, Mevludin; Porawska, Wieskawa; Ciferska, Hana; Jedrychowicz-Rosiak, Krystyna; Zielinska, Agnieszka; Choi, Jasmine; Rho, Young Hee

2017-01-01

Abstract Objectives SB2 is a biosimilar to the reference infliximab (INF). Similar efficacy, safety and immunogenicity between SB2 and INF up to 30 weeks were previously reported. This report investigates such clinical similarity up to 54 weeks, including structural joint damage. Methods In this phase III, double-blind, parallel-group, multicentre study, patients with moderate to severe RA despite MTX were randomized (1:1) to receive 3 mg/kg of either SB2 or INF at 0, 2, 6 and every 8 weeks thereafter. Dose escalation by 1.5 mg/kg up to a maximum dose of 7.5 mg/kg was allowed after week 30. Efficacy, safety and immunogenicity were measured at each visit up to week 54. Radiographic damage evaluated by modified total Sharp score was measured at baseline and week 54. Results A total of 584 patients were randomized to receive SB2 (n = 291) or INF (n = 293). The rate of radiographic progression was comparable between SB2 and INF (mean modified total Sharp score difference: SB2, 0.38; INF, 0.37) at 1 year. ACR responses, 28-joint DAS, Clinical Disease Activity Index and Simplified Disease Activity Index were comparable between SB2 and INF up to week 54. The incidence of treatment-emergent adverse events and anti-drug antibodies were comparable between treatment groups. Such comparable trends of efficacy, safety and immunogenicity were consistent from baseline up to 54 weeks. The pattern of dose increment was also comparable between SB2 and INF. Conclusion SB2 maintained similar efficacy, safety and immunogenicity with INF up to 54 weeks in patients with moderate to severe RA. Radiographic progression was comparable at 1 year. Trial registration ClinicalTrials.gov (http://clinicaltrials.gov; NCT01936181) and EudraCT (https://www.clinicaltrialsregister.eu; 2012-005733-37) PMID:28957563

Programming languages and compiler design for realistic quantum hardware.

PubMed

Chong, Frederic T; Franklin, Diana; Martonosi, Margaret

2017-09-13

Quantum computing sits at an important inflection point. For years, high-level algorithms for quantum computers have shown considerable promise, and recent advances in quantum device fabrication offer hope of utility. A gap still exists, however, between the hardware size and reliability requirements of quantum computing algorithms and the physical machines foreseen within the next ten years. To bridge this gap, quantum computers require appropriate software to translate and optimize applications (toolflows) and abstraction layers. Given the stringent resource constraints in quantum computing, information passed between layers of software and implementations will differ markedly from in classical computing. Quantum toolflows must expose more physical details between layers, so the challenge is to find abstractions that expose key details while hiding enough complexity.

Programming languages and compiler design for realistic quantum hardware

NASA Astrophysics Data System (ADS)

Chong, Frederic T.; Franklin, Diana; Martonosi, Margaret

2017-09-01

Quantum computing sits at an important inflection point. For years, high-level algorithms for quantum computers have shown considerable promise, and recent advances in quantum device fabrication offer hope of utility. A gap still exists, however, between the hardware size and reliability requirements of quantum computing algorithms and the physical machines foreseen within the next ten years. To bridge this gap, quantum computers require appropriate software to translate and optimize applications (toolflows) and abstraction layers. Given the stringent resource constraints in quantum computing, information passed between layers of software and implementations will differ markedly from in classical computing. Quantum toolflows must expose more physical details between layers, so the challenge is to find abstractions that expose key details while hiding enough complexity.

Implications of the INF (intermediate nuclear force) treaty on NATO strategy. Student report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Amend, J.H.

1988-03-01

The INF Treaty has refocused NATO attention on the longstanding concern of the applicability of the current NATO strategy. This study examines the implications of the INF Treaty on the current NATO strategy of Flexible Response. The tenets of Flexible Response include sustainability and escalation control. This study concludes that even prior to the INF Treaty, Flexible Response was not a valid strategy due to lack of sustainability and escalation control. In the absence of a valid Flexible Response Doctrine, NATO strategy reverts to massive Retaliation. Recommendations to alleviate this situation are suggested.

Building an adiabatic quantum computer simulation in the classroom

NASA Astrophysics Data System (ADS)

Rodríguez-Laguna, Javier; Santalla, Silvia N.

2018-05-01

We present a didactic introduction to adiabatic quantum computation (AQC) via the explicit construction of a classical simulator of quantum computers. This constitutes a suitable route to introduce several important concepts for advanced undergraduates in physics: quantum many-body systems, quantum phase transitions, disordered systems, spin-glasses, and computational complexity theory.

Nontrivial Quantum Effects in Biology: A Skeptical Physicists' View

NASA Astrophysics Data System (ADS)

Wiseman, Howard; Eisert, Jens

The following sections are included: * Introduction * A Quantum Life Principle * A quantum chemistry principle? * The anthropic principle * Quantum Computing in the Brain * Nature did everything first? * Decoherence as the make or break issue * Quantum error correction * Uselessness of quantum algorithms for organisms * Quantum Computing in Genetics * Quantum search * Teleological aspects and the fast-track to life * Quantum Consciousness * Computability and free will * Time scales * Quantum Free Will * Predictability and free will * Determinism and free will * Acknowledgements * References

Heavy metal concentrations in the small intestine of red fox (Vulpes vulpes) with and without Echinococcus multilocularis infection.

PubMed

Brožová, Adela; Jankovská, Ivana; Miholová, Daniela; Scháňková, Štěpánka; Truněčková, Jana; Langrová, Iva; Kudrnáčová, Marie; Vadlejch, Jaroslav

2015-02-01

Heavy metal (Cd, Cr, Cu, Fe, Mn, Ni, Pb and Zn) levels in red fox small intestine samples with or without Echinococcus multilocularis infection were studied. The red foxes were taken from the open countryside of northwest Bohemia (CR). Red foxes with E. multilocularis infection had lower levels of toxic metals (Cd, Pb); cadmium levels in infected foxes (0.0052 mg/kg) were twice as low as in uninfected foxes (0.0106 mg/kg). This was the same case for lead: 0.0288 mg/kg infected red foxes (inf.) and 0.0413 mg/kg uninfected (uninf.). Conversely, red foxes with E. multilocularis infection yielded higher concentrations in comparison to their uninfected counterparts: Cr (0.0087 mg/kg uninf. and 0.0116 mg/kg inf.), Cu (0.2677 mg/kg uninf. and 0.3205 mg/kg inf.), Fe (6.46 mg/kg uninf. and 10.89 mg/kg inf.), Mn (0.1966 mg/kg uninf. and 0.2029 mg/kg inf.), Ni (0.0415 mg/kg uninf. and 0.064 mg/kg inf.) and Zn (16.71 mg/kg uninf. and 20.25 mg/kg inf). This could support the hypothesis that tapeworms are able to absorb toxic heavy metals from the host body into their tissues, as well as to modify other element concentrations in the host body.

Algorithmic complexity of quantum capacity

NASA Astrophysics Data System (ADS)

Oskouei, Samad Khabbazi; Mancini, Stefano

2018-04-01

We analyze the notion of quantum capacity from the perspective of algorithmic (descriptive) complexity. To this end, we resort to the concept of semi-computability in order to describe quantum states and quantum channel maps. We introduce algorithmic entropies (like algorithmic quantum coherent information) and derive relevant properties for them. Then we show that quantum capacity based on semi-computable concept equals the entropy rate of algorithmic coherent information, which in turn equals the standard quantum capacity. Thanks to this, we finally prove that the quantum capacity, for a given semi-computable channel, is limit computable.

Computing quantum hashing in the model of quantum branching programs

NASA Astrophysics Data System (ADS)

Ablayev, Farid; Ablayev, Marat; Vasiliev, Alexander

2018-02-01

We investigate the branching program complexity of quantum hashing. We consider a quantum hash function that maps elements of a finite field into quantum states. We require that this function is preimage-resistant and collision-resistant. We consider two complexity measures for Quantum Branching Programs (QBP): a number of qubits and a number of compu-tational steps. We show that the quantum hash function can be computed efficiently. Moreover, we prove that such QBP construction is optimal. That is, we prove lower bounds that match the constructed quantum hash function computation.

Symmetrically private information retrieval based on blind quantum computing

NASA Astrophysics Data System (ADS)

Sun, Zhiwei; Yu, Jianping; Wang, Ping; Xu, Lingling

2015-05-01

Universal blind quantum computation (UBQC) is a new secure quantum computing protocol which allows a user Alice who does not have any sophisticated quantum technology to delegate her computing to a server Bob without leaking any privacy. Using the features of UBQC, we propose a protocol to achieve symmetrically private information retrieval, which allows a quantum limited Alice to query an item from Bob with a fully fledged quantum computer; meanwhile, the privacy of both parties is preserved. The security of our protocol is based on the assumption that malicious Alice has no quantum computer, which avoids the impossibility proof of Lo. For the honest Alice, she is almost classical and only requires minimal quantum resources to carry out the proposed protocol. Therefore, she does not need any expensive laboratory which can maintain the coherence of complicated quantum experimental setups.

Hybrid Quantum-Classical Approach to Quantum Optimal Control.

PubMed

Li, Jun; Yang, Xiaodong; Peng, Xinhua; Sun, Chang-Pu

2017-04-14

A central challenge in quantum computing is to identify more computational problems for which utilization of quantum resources can offer significant speedup. Here, we propose a hybrid quantum-classical scheme to tackle the quantum optimal control problem. We show that the most computationally demanding part of gradient-based algorithms, namely, computing the fitness function and its gradient for a control input, can be accomplished by the process of evolution and measurement on a quantum simulator. By posing queries to and receiving answers from the quantum simulator, classical computing devices update the control parameters until an optimal control solution is found. To demonstrate the quantum-classical scheme in experiment, we use a seven-qubit nuclear magnetic resonance system, on which we have succeeded in optimizing state preparation without involving classical computation of the large Hilbert space evolution.

INF (Intermediate Range Nuclear Forces) Treaty and flexible response. Research report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lewis, J.W.

1988-03-01

This paper examines how the Intermediate Range Nuclear Forces (INF) Treaty affects NATO's military strategy of flexible response. A discussion of flexible response strategy is provided as background for the reader. Then, relevant terms of the INF treaty are addressed followed by an assessment of the treaty's impact on the military strategy of the alliance.

Private quantum computation: an introduction to blind quantum computing and related protocols

NASA Astrophysics Data System (ADS)

Fitzsimons, Joseph F.

2017-06-01

Quantum technologies hold the promise of not only faster algorithmic processing of data, via quantum computation, but also of more secure communications, in the form of quantum cryptography. In recent years, a number of protocols have emerged which seek to marry these concepts for the purpose of securing computation rather than communication. These protocols address the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation. We present a review of the progress to date in this emerging area.

[Carotid plaque assessment using inversion recovery T1 weighted-3 dimensions variable refocus flip angle turbo spin echo sampling perfection with application optimized contrast using different angle evolutions black blood imaging].

PubMed

Inoue, Yuji; Yoneyama, Masami; Nakamura, Masanobu; Ozaki, Satoshi; Ito, Kenjiro; Hiura, Mikio

2012-01-01

Vulnerable plaque can be attributed to induction of ischemic symptoms and magnetic resonance imaging of carotid artery is valuable to detect the plaque. Magnetization prepared rapid acquisition with gradient echo (MPRAGE) method could detect hemorrhagic vulnerable plaque as high intensity signal; however, blood flow is not sufficiently masked by this method. The contrast for plaque in T1 weighted image (T1WI) could not be obtained sufficiently with black blood image (BBI) by sampling perfection with application optimized contrast using different angle evolutions (SPACE) method as turbo spin echo (TSE). In addition, an appearance of artifact by slow flow is a problem. Considering these controversial situations in plaque imaging, we examined the modified BBI inversion recovery (IR)-SPACE in which IR was added for SPACE method so that the contrast for plaque in T1WI was optimized. We investigated the application of this method in plaque imaging. As a result of phantom imaging, the contrast for plaque in T1WI was definitely obtained by choosing an appropriate inversion time (TI) for the corresponding repetition time. In clinical cases, blood flow was sufficiently masked by IR-SPACE method and the plaque imaging was clearly obtained in clinical cases to the same extent as MPRAGE method. Since BBI with IR-SPACE method was derived from both IR pulse and flow void effect, this method could obtain the blood flow masking effect definitely. The present study suggested that SPACE method might be applicable to estimate properties of carotid artery plaque.

OpenFlow Extensions for Programmable Quantum Networks

DTIC Science & Technology

2017-06-19

Extensions for Programmable Quantum Networks by Venkat Dasari, Nikolai Snow, and Billy Geerhart Computational and Information Sciences Directorate...distribution is unlimited. 1 1. Introduction Quantum networks and quantum computing have been receiving a surge of interest recently.1–3 However, there has...communicate using entangled particles and perform calculations using quantum logic gates. Additionally, quantum computing uses a quantum bit (qubit

Disciplines, models, and computers: the path to computational quantum chemistry.

PubMed

Lenhard, Johannes

2014-12-01

Many disciplines and scientific fields have undergone a computational turn in the past several decades. This paper analyzes this sort of turn by investigating the case of computational quantum chemistry. The main claim is that the transformation from quantum to computational quantum chemistry involved changes in three dimensions. First, on the side of instrumentation, small computers and a networked infrastructure took over the lead from centralized mainframe architecture. Second, a new conception of computational modeling became feasible and assumed a crucial role. And third, the field of computa- tional quantum chemistry became organized in a market-like fashion and this market is much bigger than the number of quantum theory experts. These claims will be substantiated by an investigation of the so-called density functional theory (DFT), the arguably pivotal theory in the turn to computational quantum chemistry around 1990.

Recent progress of quantum annealing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Suzuki, Sei

2015-03-10

We review the recent progress of quantum annealing. Quantum annealing was proposed as a method to solve generic optimization problems. Recently a Canadian company has drawn a great deal of attention, as it has commercialized a quantum computer based on quantum annealing. Although the performance of quantum annealing is not sufficiently understood, it is likely that quantum annealing will be a practical method both on a conventional computer and on a quantum computer.

DOE pushes for useful quantum computing

NASA Astrophysics Data System (ADS)

Cho, Adrian

2018-01-01

The U.S. Department of Energy (DOE) is joining the quest to develop quantum computers, devices that would exploit quantum mechanics to crack problems that overwhelm conventional computers. The initiative comes as Google and other companies race to build a quantum computer that can demonstrate "quantum supremacy" by beating classical computers on a test problem. But reaching that milestone will not mean practical uses are at hand, and the new $40 million DOE effort is intended to spur the development of useful quantum computing algorithms for its work in chemistry, materials science, nuclear physics, and particle physics. With the resources at its 17 national laboratories, DOE could play a key role in developing the machines, researchers say, although finding problems with which quantum computers can help isn't so easy.

Geometric manipulation of trapped ions for quantum computation.

PubMed

Duan, L M; Cirac, J I; Zoller, P

2001-06-01

We propose an experimentally feasible scheme to achieve quantum computation based solely on geometric manipulations of a quantum system. The desired geometric operations are obtained by driving the quantum system to undergo appropriate adiabatic cyclic evolutions. Our implementation of the all-geometric quantum computation is based on laser manipulation of a set of trapped ions. An all-geometric approach, apart from its fundamental interest, offers a possible method for robust quantum computation.

Cooling the Collective Motion of Trapped Ions to Initialize a Quantum Register

DTIC Science & Technology

2016-09-13

computation [1] provides a gen- eral framework for fundamental investigations into sub- jects such as entanglement, quantum measurement, and quantum ...information theory. Since quantum computation relies on entanglement between qubits, any implementa- tion of a quantum computer must offer isolation from the...for realiz- ing a quantum computer , which is scalable to an arbitrary number of qubits. Their scheme is based on a collection of trapped atomic ions

Quantum computing on encrypted data

NASA Astrophysics Data System (ADS)

Fisher, K. A. G.; Broadbent, A.; Shalm, L. K.; Yan, Z.; Lavoie, J.; Prevedel, R.; Jennewein, T.; Resch, K. J.

2014-01-01

The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

Quantum computing on encrypted data.

PubMed

Fisher, K A G; Broadbent, A; Shalm, L K; Yan, Z; Lavoie, J; Prevedel, R; Jennewein, T; Resch, K J

2014-01-01

The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

Research progress on quantum informatics and quantum computation

NASA Astrophysics Data System (ADS)

Zhao, Yusheng

2018-03-01

Quantum informatics is an emerging interdisciplinary subject developed by the combination of quantum mechanics, information science, and computer science in the 1980s. The birth and development of quantum information science has far-reaching significance in science and technology. At present, the application of quantum information technology has become the direction of people’s efforts. The preparation, storage, purification and regulation, transmission, quantum coding and decoding of quantum state have become the hotspot of scientists and technicians, which have a profound impact on the national economy and the people’s livelihood, technology and defense technology. This paper first summarizes the background of quantum information science and quantum computer and the current situation of domestic and foreign research, and then introduces the basic knowledge and basic concepts of quantum computing. Finally, several quantum algorithms are introduced in detail, including Quantum Fourier transform, Deutsch-Jozsa algorithm, Shor’s quantum algorithm, quantum phase estimation.

Elucidating Reaction Mechanisms on Quantum Computers

NASA Astrophysics Data System (ADS)

Wiebe, Nathan; Reiher, Markus; Svore, Krysta; Wecker, Dave; Troyer, Matthias

We show how a quantum computer can be employed to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical-computer simulations for such problems, to significantly increase their accuracy and enable hitherto intractable simulations. Detailed resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. This demonstrates that quantum computers will realistically be able to tackle important problems in chemistry that are both scientifically and economically significant.

An accurate and efficient laser-envelope solver for the modeling of laser-plasma accelerators

DOE PAGES

Benedetti, C.; Schroeder, C. B.; Geddes, C. G. R.; ...

2017-10-17

Detailed and reliable numerical modeling of laser-plasma accelerators (LPAs), where a short and intense laser pulse interacts with an underdense plasma over distances of up to a meter, is a formidably challenging task. This is due to the great disparity among the length scales involved in the modeling, ranging from the micron scale of the laser wavelength to the meter scale of the total laser-plasma interaction length. The use of the time-averaged ponderomotive force approximation, where the laser pulse is described by means of its envelope, enables efficient modeling of LPAs by removing the need to model the details ofmore » electron motion at the laser wavelength scale. Furthermore, it allows simulations in cylindrical geometry which captures relevant 3D physics at 2D computational cost. A key element of any code based on the time-averaged ponderomotive force approximation is the laser envelope solver. In this paper we present the accurate and efficient envelope solver used in the code INF & RNO (INtegrated Fluid & paRticle simulatioN cOde). The features of the INF & RNO laser solver enable an accurate description of the laser pulse evolution deep into depletion even at a reasonably low resolution, resulting in significant computational speed-ups.« less

An accurate and efficient laser-envelope solver for the modeling of laser-plasma accelerators

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benedetti, C.; Schroeder, C. B.; Geddes, C. G. R.

Detailed and reliable numerical modeling of laser-plasma accelerators (LPAs), where a short and intense laser pulse interacts with an underdense plasma over distances of up to a meter, is a formidably challenging task. This is due to the great disparity among the length scales involved in the modeling, ranging from the micron scale of the laser wavelength to the meter scale of the total laser-plasma interaction length. The use of the time-averaged ponderomotive force approximation, where the laser pulse is described by means of its envelope, enables efficient modeling of LPAs by removing the need to model the details ofmore » electron motion at the laser wavelength scale. Furthermore, it allows simulations in cylindrical geometry which captures relevant 3D physics at 2D computational cost. A key element of any code based on the time-averaged ponderomotive force approximation is the laser envelope solver. In this paper we present the accurate and efficient envelope solver used in the code INF & RNO (INtegrated Fluid & paRticle simulatioN cOde). The features of the INF & RNO laser solver enable an accurate description of the laser pulse evolution deep into depletion even at a reasonably low resolution, resulting in significant computational speed-ups.« less

An accurate and efficient laser-envelope solver for the modeling of laser-plasma accelerators

NASA Astrophysics Data System (ADS)

Benedetti, C.; Schroeder, C. B.; Geddes, C. G. R.; Esarey, E.; Leemans, W. P.

2018-01-01

Detailed and reliable numerical modeling of laser-plasma accelerators (LPAs), where a short and intense laser pulse interacts with an underdense plasma over distances of up to a meter, is a formidably challenging task. This is due to the great disparity among the length scales involved in the modeling, ranging from the micron scale of the laser wavelength to the meter scale of the total laser-plasma interaction length. The use of the time-averaged ponderomotive force approximation, where the laser pulse is described by means of its envelope, enables efficient modeling of LPAs by removing the need to model the details of electron motion at the laser wavelength scale. Furthermore, it allows simulations in cylindrical geometry which captures relevant 3D physics at 2D computational cost. A key element of any code based on the time-averaged ponderomotive force approximation is the laser envelope solver. In this paper we present the accurate and efficient envelope solver used in the code INF&RNO (INtegrated Fluid & paRticle simulatioN cOde). The features of the INF&RNO laser solver enable an accurate description of the laser pulse evolution deep into depletion even at a reasonably low resolution, resulting in significant computational speed-ups.

Blueprint for a microwave trapped ion quantum computer.

PubMed

Lekitsch, Bjoern; Weidt, Sebastian; Fowler, Austin G; Mølmer, Klaus; Devitt, Simon J; Wunderlich, Christof; Hensinger, Winfried K

2017-02-01

The availability of a universal quantum computer may have a fundamental impact on a vast number of research fields and on society as a whole. An increasingly large scientific and industrial community is working toward the realization of such a device. An arbitrarily large quantum computer may best be constructed using a modular approach. We present a blueprint for a trapped ion-based scalable quantum computer module, making it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are constructed using silicon microfabrication techniques, and are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength radiation-based quantum gate technology. To scale this microwave quantum computer architecture to a large size, we present a fully scalable design that makes use of ion transport between different modules, thereby allowing arbitrarily many modules to be connected to construct a large-scale device. A high error-threshold surface error correction code can be implemented in the proposed architecture to execute fault-tolerant operations. With appropriate adjustments, the proposed modules are also suitable for alternative trapped ion quantum computer architectures, such as schemes using photonic interconnects.

A scalable quantum computer with ions in an array of microtraps

PubMed

Cirac; Zoller

2000-04-06

Quantum computers require the storage of quantum information in a set of two-level systems (called qubits), the processing of this information using quantum gates and a means of final readout. So far, only a few systems have been identified as potentially viable quantum computer models--accurate quantum control of the coherent evolution is required in order to realize gate operations, while at the same time decoherence must be avoided. Examples include quantum optical systems (such as those utilizing trapped ions or neutral atoms, cavity quantum electrodynamics and nuclear magnetic resonance) and solid state systems (using nuclear spins, quantum dots and Josephson junctions). The most advanced candidates are the quantum optical and nuclear magnetic resonance systems, and we expect that they will allow quantum computing with about ten qubits within the next few years. This is still far from the numbers required for useful applications: for example, the factorization of a 200-digit number requires about 3,500 qubits, rising to 100,000 if error correction is implemented. Scalability of proposed quantum computer architectures to many qubits is thus of central importance. Here we propose a model for an ion trap quantum computer that combines scalability (a feature usually associated with solid state proposals) with the advantages of quantum optical systems (in particular, quantum control and long decoherence times).

24 CFR Appendix B to Part 1000 - IHBG Block Grant Formula Mechanisms

Code of Federal Regulations, 2012 CFR

2012-04-01

... unit subsidy for Low-Rent units ($2,440*INF). MH+TK = number of Mutual Help and Turnkey III units. HOSUB = national per unit subsidy for Homeownership units ($528*INF). S8 = number of Section 8 units. S8SUB = national per unit subsidy for Section 8 units = ($3,625*INF). AELFMR = greater of AEL Factor or...

24 CFR Appendix B to Part 1000 - IHBG Block Grant Formula Mechanisms

Code of Federal Regulations, 2014 CFR

2014-04-01

... unit subsidy for Low-Rent units ($2,440*INF). MH+TK = number of Mutual Help and Turnkey III units. HOSUB = national per unit subsidy for Homeownership units ($528*INF). S8 = number of Section 8 units. S8SUB = national per unit subsidy for Section 8 units = ($3,625*INF). AELFMR = greater of AEL Factor or...

24 CFR Appendix B to Part 1000 - IHBG Block Grant Formula Mechanisms

Code of Federal Regulations, 2013 CFR

2013-04-01

... unit subsidy for Low-Rent units ($2,440*INF). MH+TK = number of Mutual Help and Turnkey III units. HOSUB = national per unit subsidy for Homeownership units ($528*INF). S8 = number of Section 8 units. S8SUB = national per unit subsidy for Section 8 units = ($3,625*INF). AELFMR = greater of AEL Factor or...

Measurement of GEP/GMP to Q2 = 5.6 GEV2 via Recoil Polarization at Jefferson Lab

NASA Astrophysics Data System (ADS)

Gayou, Olivier

2001-10-01

The measurement of the elastic form factors is a key ingredient to any complete understanding of the internal structure of the nucleons, and ultimately of the strong force. Precise data are essential to impose stringent tests on any QCD-based theory. The electromagnetic interaction provides a unique tool to investigate these form factors. In elastic electron scattering off a proton, the electron interacts with the nucleon exchanging a virtual photon. The electron-photon interaction is fully understood from QED, hence making the hadron vertex the only unknown of the reaction...

Differential Games of inf-sup Type and Isaacs Equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kaise, Hidehiro; Sheu, S.-J.

2005-06-15

Motivated by the work of Fleming, we provide a general framework to associate inf-sup type values with the Isaacs equations.We show that upper and lower bounds for the generators of inf-sup type are upper and lower Hamiltonians, respectively. In particular, the lower (resp. upper) bound corresponds to the progressive (resp. strictly progressive) strategy. By the Dynamic Programming Principle and identification of the generator, we can prove that the inf-sup type game is characterized as the unique viscosity solution of the Isaacs equation. We also discuss the Isaacs equation with a Hamiltonian of a convex combination between the lower and uppermore » Hamiltonians.« less

Cp Asymmetries of B → ϕK0 and B → η'KS Decays in SUSY Models

NASA Astrophysics Data System (ADS)

Dutta, Bhaskar; Kim, C. S.; Oh, Sechul; Zhu, Guohuai

2005-04-01

CP asymmetries of B → ϕK and B → η(')K modes are analyzed in the QCD improved factorization framework. The phenomenological parameters are determined from the global fit for the available B → PP and V P modes (without the subprocess b -> sbar {s}s). The possible deviation of sin(2ϕ1)ϕK0, η'Ks from sin(2ϕ1)J/ΨKs and the large branching ratio for B± → η'K± can be simultaneously explained in the context of R-parity conserving SUGRA models and R-parity violating SUSY models.

Cardiac arrhythmia induced by interferon beta-1a.

PubMed

Kastalli, Sarrah; El Aïdli, Sihem; Mourali, Sami; Zaïem, Ahmed; Daghfous, Riadh; Lakhal, Mohamed

2012-04-01

Cardiac adverse effects have never been reported with interferon (INF) beta. We report a case of left bundle branch block in a 35-year-old woman treated with INF beta-1a for multiple sclerosis. Five years after INF therapy, she presented loss of consciousness, retrosternal pains, short breath and lowered tolerance of effort. ECG and Holter 24-h ECG monitoring revealed permanent complete left bundle branch block. Nine months after stopping INF, no abnormalities were found at ECG and echocardiogram examination. © 2011 The Authors Fundamental and Clinical Pharmacology © 2011 Société Française de Pharmacologie et de Thérapeutique.

Intermediate-range nuclear forces (INF) treaty: an operational error

DOE Office of Scientific and Technical Information (OSTI.GOV)

Caldwell, W.B.

1988-05-12

The purpose of this paper is to examine the operational impact of the INF treaty and what it means for the future of NATO. At this writing, there is considerable debate going on as to whether or not the US Congress should ratify the INF treaty. The political issues are well known and under careful examination. A critical element that still needs to be addressed is the operational impact of the INF treaty. This area may have been neglected because nuclear weapons are viewed primarily as an element of deterrence. Therefore, their warfighting potential is given only minimal consideration. Thismore » paper begins with a discussion of the historical use of nuclear weapons in NATO's defensive Alliance. It follows through to the decision in 1979 to modernize NATO's nuclear force. This decision resulted in the deployment of the Pershing II and ground-launched cruise missile (GLCM) systems in Europe. The Soviet warfighting concept for Europe is addressed next to place the intermediate-range nuclear forces in their proper perspective. This is followed by a discussion on the operational implications of the INF treaty. The paper concludes by briefly mentioning a few of the defensive proposals for the post-INF period.« less

PHOTOPRODUCTION OF γp → pπ0 η AT ELSA IN BONN

NASA Astrophysics Data System (ADS)

Crede, V.

2003-07-01

The study of nucleon resonances provides important information on many open questions in baryon spectroscopy. The key to any progress is the identification of the effective degrees of freedom leading to a qualitative understanding of strong QCD. The problem of missing resonances predicted by quark models is discussed on the basis of experimental results of the CB-ELSA experiment at the e- accelerator ELSA in Bonn. Resonance production and even cascades of the type N**(∆**) → N*(∆*) → pπ0π0(pπ0η) are observed as well as ηη photoproduction off the proton. Indications for a ∆ resonance around 1900 MeV are seen. The latter is particularly interesting if it had negative parity because a confirmation of this state would be in contradiction with constituent quark models1,5. Both, the quark models using one-gluon exchange and the quark model using instantoninduced forces as short-range residual quark-quark interaction predict the three states ∆5/2- (1930), ∆3/2- (1940) and ∆1/2- (1900) at masses in the 2100 MeV region.

Open-System Quantum Annealing in Mean-Field Models with Exponential Degeneracy

DTIC Science & Technology

2016-08-25

life quantum computers are inevitably affected by intrinsic noise resulting in dissipative nonunitary dynamics realized by these devices. We consider an... quantum computer . DOI: 10.1103/PhysRevX.6.021028 Subject Areas: Condensed Matter Physics, Quantum Physics, Quantum Information I. INTRODUCTION Quantum ... computing hardware is affected by a substantial level of intrinsic noise and therefore naturally realizes dis- sipative quantum dynamics [1,2

Quasi-hamiltonian quotients as disjoint unions of symplectic manifolds

NASA Astrophysics Data System (ADS)

Schaffhauser, Florent

2007-08-01

The main result of this paper is Theorem 2.12 which says that the quotient μ-1({1})/U associated to a quasi-hamiltonian space (M, ω, μ: M → U) has a symplectic structure even when 1 is not a regular value of the momentum map μ. Namely, it is a disjoint union of symplectic manifolds of possibly different dimensions, which generalizes the result of Alekseev, Malkin and Meinrenken in [AMM98]. We illustrate this theorem with the example of representation spaces of surface groups. As an intermediary step, we give a new class of examples of quasi-hamiltonian spaces: the isotropy submanifold MK whose points are the points of M with isotropy group K ⊂ U. The notion of quasi-hamiltonian space was introduced by Alekseev, Malkin and Meinrenken in their paper [AMM98]. The main motivation for it was the existence, under some regularity assumptions, of a symplectic structure on the associated quasi-hamiltonian quotient. Throughout their paper, the analogy with usual hamiltonian spaces is often used as a guiding principle, replacing Lie-algebra-valued momentum maps with Lie-group-valued momentum maps. In the hamiltonian setting, when the usual regularity assumptions on the group action or the momentum map are dropped, Lerman and Sjamaar showed in [LS91] that the quotient associated to a hamiltonian space carries a stratified symplectic structure. In particular, this quotient space is a disjoint union of symplectic manifolds. In this paper, we prove an analogous result for quasi-hamiltonian quotients. More precisely, we show that for any quasi-hamiltonian space (M, ω, μ: M → U), the associated quotient M//U := μ-1({1})/U is a disjoint union of symplectic manifolds (Theorem 2.12): [ mu^{-1}(\\{1\\})/U = bigsqcup_{jin J} (mu^{-1}(\\{1\\})\\cap M_{K_j})/L_{K_j} . ] Here Kj denotes a closed subgroup of U and MKj denotes the isotropy submanifold of type Kj: MKj = {x ∈ M | Ux = Kj}. Finally, LKj is the quotient group LKj = { N}(Kj)/K_j, where { N}(Kj) is the normalizer of Kj in U. As an intermediary step in our study, we show that MKj is a quasi-hamiltonian space when endowed with the (free) action of LKj.

Quantum Accelerators for High-performance Computing Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S.; Britt, Keith A.; Mohiyaddin, Fahd A.

We define some of the programming and system-level challenges facing the application of quantum processing to high-performance computing. Alongside barriers to physical integration, prominent differences in the execution of quantum and conventional programs challenges the intersection of these computational models. Following a brief overview of the state of the art, we discuss recent advances in programming and execution models for hybrid quantum-classical computing. We discuss a novel quantum-accelerator framework that uses specialized kernels to offload select workloads while integrating with existing computing infrastructure. We elaborate on the role of the host operating system to manage these unique accelerator resources, themore » prospects for deploying quantum modules, and the requirements placed on the language hierarchy connecting these different system components. We draw on recent advances in the modeling and simulation of quantum computing systems with the development of architectures for hybrid high-performance computing systems and the realization of software stacks for controlling quantum devices. Finally, we present simulation results that describe the expected system-level behavior of high-performance computing systems composed from compute nodes with quantum processing units. We describe performance for these hybrid systems in terms of time-to-solution, accuracy, and energy consumption, and we use simple application examples to estimate the performance advantage of quantum acceleration.« less

Adiabatic topological quantum computing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cesare, Chris; Landahl, Andrew J.; Bacon, Dave

Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic excitations will be created that will disorder the encoded quantum information. Here, we explore this question in detail by studying adiabatic code deformations on Hamiltonians based on topological codes, notably Kitaev’s surface codes and the more recently discovered color codes. We develop protocols that enable universal quantum computing by adiabatic evolution in a way that keeps the energy gap of the system constant with respect to the computationmore » size and introduces only simple local Hamiltonian interactions. This allows one to perform holonomic quantum computing with these topological quantum computing systems. The tools we develop allow one to go beyond numerical simulations and understand these processes analytically.« less

Adiabatic topological quantum computing

DOE PAGES

Cesare, Chris; Landahl, Andrew J.; Bacon, Dave; ...

2015-07-31

Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic excitations will be created that will disorder the encoded quantum information. Here, we explore this question in detail by studying adiabatic code deformations on Hamiltonians based on topological codes, notably Kitaev’s surface codes and the more recently discovered color codes. We develop protocols that enable universal quantum computing by adiabatic evolution in a way that keeps the energy gap of the system constant with respect to the computationmore » size and introduces only simple local Hamiltonian interactions. This allows one to perform holonomic quantum computing with these topological quantum computing systems. The tools we develop allow one to go beyond numerical simulations and understand these processes analytically.« less

Quantum computing and probability.

PubMed

Ferry, David K

2009-11-25

Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction.

A novel pH-sensitive interferon-β (INF-β) oral delivery system for application in multiple sclerosis.

PubMed

Kondiah, Pierre P D; Tomar, Lomas K; Tyagi, Charu; Choonara, Yahya E; Modi, Girish; du Toit, Lisa C; Kumar, Pradeep; Pillay, Viness

2013-11-18

pH-sensitive microparticles were prepared using trimethyl-chitosan (TMC), poly(ethylene glycol)dimethacrylate (PEGDMA) and methacrylic acid (MAA) by free radical suspension polymerization, for the oral delivery of interferon-β (INF-β). The microparticles were subsequently compressed into a suitable oral tablet formulation. A Box-Behnken experimental design was employed for generating a series of formulations with varying concentrations of TMC (0.05-0.5 g/100 mL) and percentage crosslinker (polyethylene glycol diacrylate) (3-8%, w/w of monomers), for establishment of an optimized TMC-PEGDMA-MAA copolymeric microparticles. For pragmatism, insulin was initially employed as the model peptide for undertaking the preliminary experimentation and the optimized formulation was subsequently evaluated using INF-β. The prepared copolymeric microparticulate system was characterized for its morphological, porositometric and mucoadhesive properties. The optimized microparticles with 0.5 g/100 mL TMC and 3% crosslinker had an INF-β loading efficiency of 53.25%. The in vitro release of INF-β was recorded at 74% and 3% in intestinal (pH 6.8) and gastric (pH 1.2) pH from the oral tablet formulation, respectively. The tablet was further evaluated for plasma concentration of INF-β in the New Zealand White rabbit, and compared to a known subcutaneous formulation. The system showed an astounding effective release profile over 24h with higher INF-β plasma concentrations compared with the subcutaneous injection formulation. Copyright © 2013 Elsevier B.V. All rights reserved.

Production of Fumonisin B(inf1) and Moniliformin by Gibberella fujikuroi from Rice from Various Geographic Areas

PubMed Central

Desjardins, A. E.; Plattner, R. D.; Nelson, P. E.

1997-01-01

Gibberella fujikuroi strains isolated from rice in the United States, Asia, and other geographic areas were tested for sexual fertility with members of mating population D and for production of fumonisin B(inf1) and moniliformin in culture. Of the 59 field strains tested, 32 (54%) were able to cross with tester strains of mating population D, but only a few ascospores were produced in most of these crosses. Thirty-four strains produced more than 10 (mu)g of fumonisin B(inf1) per g, but only three strains produced more than 1000 (mu)g/g. Twenty-five strains produced more than 100 (mu)g of moniliformin per g, and 15 produced more than 1,000 (mu)g/g. Seven field strains produced both fumonisin B(inf1) and moniliformin, but none of these strains produced a high level of fumonisin B(inf1) (>1,000 (mu)g/g). However, a genetic cross between a strain that produced fumonisin B(inf1) but no moniliformin and a strain that produced moniliformin but no fumonisin B(inf1) yielded progeny that produced high levels of both toxins. Strains of G. fujikuroi isolated from rice infected with bakanae disease are similar to strains of mating population D isolated from maize in their ability to produce both fumonisins and moniliformin. This finding suggests a potential for contamination of rice with both fumonisins and moniliformin. PMID:16535599

Fast non-Abelian geometric gates via transitionless quantum driving.

PubMed

Zhang, J; Kyaw, Thi Ha; Tong, D M; Sjöqvist, Erik; Kwek, Leong-Chuan

2015-12-21

A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.

Fast non-Abelian geometric gates via transitionless quantum driving

PubMed Central

Zhang, J.; Kyaw, Thi Ha; Tong, D. M.; Sjöqvist, Erik; Kwek, Leong-Chuan

2015-01-01

A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer. PMID:26687580

Verifiable fault tolerance in measurement-based quantum computation

NASA Astrophysics Data System (ADS)

Fujii, Keisuke; Hayashi, Masahito

2017-09-01

Quantum systems, in general, cannot be simulated efficiently by a classical computer, and hence are useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately, that verification of the output of the quantum systems is not so trivial, since predicting the output is exponentially hard. As another problem, the quantum system is very delicate for noise and thus needs an error correction. Here, we propose a framework for verification of the output of fault-tolerant quantum computation in a measurement-based model. In contrast to existing analyses on fault tolerance, we do not assume any noise model on the resource state, but an arbitrary resource state is tested by using only single-qubit measurements to verify whether or not the output of measurement-based quantum computation on it is correct. Verifiability is equipped by a constant time repetition of the original measurement-based quantum computation in appropriate measurement bases. Since full characterization of quantum noise is exponentially hard for large-scale quantum computing systems, our framework provides an efficient way to practically verify the experimental quantum error correction.

Embracing the quantum limit in silicon computing.

PubMed

Morton, John J L; McCamey, Dane R; Eriksson, Mark A; Lyon, Stephen A

2011-11-16

Quantum computers hold the promise of massive performance enhancements across a range of applications, from cryptography and databases to revolutionary scientific simulation tools. Such computers would make use of the same quantum mechanical phenomena that pose limitations on the continued shrinking of conventional information processing devices. Many of the key requirements for quantum computing differ markedly from those of conventional computers. However, silicon, which plays a central part in conventional information processing, has many properties that make it a superb platform around which to build a quantum computer. © 2011 Macmillan Publishers Limited. All rights reserved

Compiling Planning into Quantum Optimization Problems: A Comparative Study

DTIC Science & Technology

2015-06-07

and Sipser, M. 2000. Quantum computation by adiabatic evolution. arXiv:quant- ph/0001106. Fikes, R. E., and Nilsson, N. J. 1972. STRIPS: A new...become available: quantum annealing. Quantum annealing is one of the most accessible quantum algorithms for a computer sci- ence audience not versed...in quantum computing because of its close ties to classical optimization algorithms such as simulated annealing. While large-scale universal quantum

Quantum Computer Science

NASA Astrophysics Data System (ADS)

Mermin, N. David

2007-08-01

Preface; 1. Cbits and Qbits; 2. General features and some simple examples; 3. Breaking RSA encryption with a quantum computer; 4. Searching with a quantum computer; 5. Quantum error correction; 6. Protocols that use just a few Qbits; Appendices; Index.

Visualizing a silicon quantum computer

NASA Astrophysics Data System (ADS)

Sanders, Barry C.; Hollenberg, Lloyd C. L.; Edmundson, Darran; Edmundson, Andrew

2008-12-01

Quantum computation is a fast-growing, multi-disciplinary research field. The purpose of a quantum computer is to execute quantum algorithms that efficiently solve computational problems intractable within the existing paradigm of 'classical' computing built on bits and Boolean gates. While collaboration between computer scientists, physicists, chemists, engineers, mathematicians and others is essential to the project's success, traditional disciplinary boundaries can hinder progress and make communicating the aims of quantum computing and future technologies difficult. We have developed a four minute animation as a tool for representing, understanding and communicating a silicon-based solid-state quantum computer to a variety of audiences, either as a stand-alone animation to be used by expert presenters or embedded into a longer movie as short animated sequences. The paper includes a generally applicable recipe for successful scientific animation production.

Quantum Statistical Mechanics on a Quantum Computer

NASA Astrophysics Data System (ADS)

Raedt, H. D.; Hams, A. H.; Michielsen, K.; Miyashita, S.; Saito, K.

We describe a quantum algorithm to compute the density of states and thermal equilibrium properties of quantum many-body systems. We present results obtained by running this algorithm on a software implementation of a 21-qubit quantum computer for the case of an antiferromagnetic Heisenberg model on triangular lattices of different size.

An approach to quantum-computational hydrologic inverse analysis

DOE PAGES

O'Malley, Daniel

2018-05-02

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealermore » to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.« less

An approach to quantum-computational hydrologic inverse analysis.

PubMed

O'Malley, Daniel

2018-05-02

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealer to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.

An approach to quantum-computational hydrologic inverse analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

O'Malley, Daniel

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealermore » to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.« less

A novel quantum scheme for secure two-party distance computation

NASA Astrophysics Data System (ADS)

Peng, Zhen-wan; Shi, Run-hua; Zhong, Hong; Cui, Jie; Zhang, Shun

2017-12-01

Secure multiparty computational geometry is an essential field of secure multiparty computation, which computes a computation geometric problem without revealing any private information of each party. Secure two-party distance computation is a primitive of secure multiparty computational geometry, which computes the distance between two points without revealing each point's location information (i.e., coordinate). Secure two-party distance computation has potential applications with high secure requirements in military, business, engineering and so on. In this paper, we present a quantum solution to secure two-party distance computation by subtly using quantum private query. Compared to the classical related protocols, our quantum protocol can ensure higher security and better privacy protection because of the physical principle of quantum mechanics.

High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction

NASA Astrophysics Data System (ADS)

Fukui, Kosuke; Tomita, Akihisa; Okamoto, Atsushi; Fujii, Keisuke

2018-04-01

To implement fault-tolerant quantum computation with continuous variables, the Gottesman-Kitaev-Preskill (GKP) qubit has been recognized as an important technological element. However, it is still challenging to experimentally generate the GKP qubit with the required squeezing level, 14.8 dB, of the existing fault-tolerant quantum computation. To reduce this requirement, we propose a high-threshold fault-tolerant quantum computation with GKP qubits using topologically protected measurement-based quantum computation with the surface code. By harnessing analog information contained in the GKP qubits, we apply analog quantum error correction to the surface code. Furthermore, we develop a method to prevent the squeezing level from decreasing during the construction of the large-scale cluster states for the topologically protected, measurement-based, quantum computation. We numerically show that the required squeezing level can be relaxed to less than 10 dB, which is within the reach of the current experimental technology. Hence, this work can considerably alleviate this experimental requirement and take a step closer to the realization of large-scale quantum computation.

Quantum Gauss-Jordan Elimination and Simulation of Accounting Principles on Quantum Computers

NASA Astrophysics Data System (ADS)

Diep, Do Ngoc; Giang, Do Hoang; Van Minh, Nguyen

2017-06-01

The paper is devoted to a version of Quantum Gauss-Jordan Elimination and its applications. In the first part, we construct the Quantum Gauss-Jordan Elimination (QGJE) Algorithm and estimate the complexity of computation of Reduced Row Echelon Form (RREF) of N × N matrices. The main result asserts that QGJE has computation time is of order 2 N/2. The second part is devoted to a new idea of simulation of accounting by quantum computing. We first expose the actual accounting principles in a pure mathematics language. Then, we simulate the accounting principles on quantum computers. We show that, all accounting actions are exhousted by the described basic actions. The main problems of accounting are reduced to some system of linear equations in the economic model of Leontief. In this simulation, we use our constructed Quantum Gauss-Jordan Elimination to solve the problems and the complexity of quantum computing is a square root order faster than the complexity in classical computing.

Blueprint for a microwave trapped ion quantum computer

PubMed Central

Lekitsch, Bjoern; Weidt, Sebastian; Fowler, Austin G.; Mølmer, Klaus; Devitt, Simon J.; Wunderlich, Christof; Hensinger, Winfried K.

2017-01-01

The availability of a universal quantum computer may have a fundamental impact on a vast number of research fields and on society as a whole. An increasingly large scientific and industrial community is working toward the realization of such a device. An arbitrarily large quantum computer may best be constructed using a modular approach. We present a blueprint for a trapped ion–based scalable quantum computer module, making it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are constructed using silicon microfabrication techniques, and are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength radiation–based quantum gate technology. To scale this microwave quantum computer architecture to a large size, we present a fully scalable design that makes use of ion transport between different modules, thereby allowing arbitrarily many modules to be connected to construct a large-scale device. A high error–threshold surface error correction code can be implemented in the proposed architecture to execute fault-tolerant operations. With appropriate adjustments, the proposed modules are also suitable for alternative trapped ion quantum computer architectures, such as schemes using photonic interconnects. PMID:28164154

Silicon CMOS architecture for a spin-based quantum computer.

PubMed

Veldhorst, M; Eenink, H G J; Yang, C H; Dzurak, A S

2017-12-15

Recent advances in quantum error correction codes for fault-tolerant quantum computing and physical realizations of high-fidelity qubits in multiple platforms give promise for the construction of a quantum computer based on millions of interacting qubits. However, the classical-quantum interface remains a nascent field of exploration. Here, we propose an architecture for a silicon-based quantum computer processor based on complementary metal-oxide-semiconductor (CMOS) technology. We show how a transistor-based control circuit together with charge-storage electrodes can be used to operate a dense and scalable two-dimensional qubit system. The qubits are defined by the spin state of a single electron confined in quantum dots, coupled via exchange interactions, controlled using a microwave cavity, and measured via gate-based dispersive readout. We implement a spin qubit surface code, showing the prospects for universal quantum computation. We discuss the challenges and focus areas that need to be addressed, providing a path for large-scale quantum computing.

Experimental Identification of Non-Abelian Topological Orders on a Quantum Simulator.

PubMed

Li, Keren; Wan, Yidun; Hung, Ling-Yan; Lan, Tian; Long, Guilu; Lu, Dawei; Zeng, Bei; Laflamme, Raymond

2017-02-24

Topological orders can be used as media for topological quantum computing-a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing device for special purposes, also offers a way of characterizing topological orders. Here, we show how to identify distinct topological orders via measuring their modular S and T matrices. In particular, we employ a nuclear magnetic resonance quantum simulator to study the properties of three topologically ordered matter phases described by the string-net model with two string types, including the Z_{2} toric code, doubled semion, and doubled Fibonacci. The third one, non-Abelian Fibonacci order is notably expected to be the simplest candidate for universal topological quantum computing. Our experiment serves as the basic module, built on which one can simulate braiding of non-Abelian anyons and ultimately, topological quantum computation via the braiding, and thus provides a new approach of investigating topological orders using quantum computers.

Noise Threshold and Resource Cost of Fault-Tolerant Quantum Computing with Majorana Fermions in Hybrid Systems.

PubMed

Li, Ying

2016-09-16

Fault-tolerant quantum computing in systems composed of both Majorana fermions and topologically unprotected quantum systems, e.g., superconducting circuits or quantum dots, is studied in this Letter. Errors caused by topologically unprotected quantum systems need to be corrected with error-correction schemes, for instance, the surface code. We find that the error-correction performance of such a hybrid topological quantum computer is not superior to a normal quantum computer unless the topological charge of Majorana fermions is insusceptible to noise. If errors changing the topological charge are rare, the fault-tolerance threshold is much higher than the threshold of a normal quantum computer and a surface-code logical qubit could be encoded in only tens of topological qubits instead of about 1,000 normal qubits.

Demonstration of a small programmable quantum computer with atomic qubits.

PubMed

Debnath, S; Linke, N M; Figgatt, C; Landsman, K A; Wright, K; Monroe, C

2016-08-04

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully connected set of gate operations that are native to the hardware and have a mean fidelity of 98 per cent. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms with average success rates of 95 and 90 per cent, respectively. We also perform a coherent quantum Fourier transform on five trapped-ion qubits for phase estimation and period finding with average fidelities of 62 and 84 per cent, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

Demonstration of a small programmable quantum computer with atomic qubits

NASA Astrophysics Data System (ADS)

Debnath, S.; Linke, N. M.; Figgatt, C.; Landsman, K. A.; Wright, K.; Monroe, C.

2016-08-01

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully connected set of gate operations that are native to the hardware and have a mean fidelity of 98 per cent. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms with average success rates of 95 and 90 per cent, respectively. We also perform a coherent quantum Fourier transform on five trapped-ion qubits for phase estimation and period finding with average fidelities of 62 and 84 per cent, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

Two-spectral Yang-Baxter operators in topological quantum computation

NASA Astrophysics Data System (ADS)

Sanchez, William F.

2011-05-01

One of the current trends in quantum computing is the application of algebraic topological methods in the design of new algorithms and quantum computers, giving rise to topological quantum computing. One of the tools used in it is the Yang-Baxter equation whose solutions are interpreted as universal quantum gates. Lately, more general Yang-Baxter equations have been investigated, making progress as two-spectral equations and Yang-Baxter systems. This paper intends to apply these new findings to the field of topological quantum computation, more specifically, the proposition of the two-spectral Yang-Baxter operators as universal quantum gates for 2 qubits and 2 qutrits systems, obtaining 4x4 and 9x9 matrices respectively, and further elaboration of the corresponding Hamiltonian by the use of computer algebra software Mathematica® and its Qucalc package. In addition, possible physical systems to which the Yang-Baxter operators obtained can be applied are considered. In the present work it is demonstrated the utility of the Yang-Baxter equation to generate universal quantum gates and the power of computer algebra to design them; it is expected that these mathematical studies contribute to the further development of quantum computers

Universal non-adiabatic holonomic quantum computation in decoherence-free subspaces with quantum dots inside a cavity

NASA Astrophysics Data System (ADS)

Liu, Jun; Dong, Ping; Zhou, Jian; Cao, Zhuo-Liang

2017-05-01

A scheme for implementing the non-adiabatic holonomic quantum computation in decoherence-free subspaces is proposed with the interactions between a microcavity and quantum dots. A universal set of quantum gates can be constructed on the encoded logical qubits with high fidelities. The current scheme can suppress both local and collective noises, which is very important for achieving universal quantum computation. Discussions about the gate fidelities with the experimental parameters show that our schemes can be implemented in current experimental technology. Therefore, our scenario offers a method for universal and robust solid-state quantum computation.

The INF Treaty: Past, present, and future

DOE Office of Scientific and Technical Information (OSTI.GOV)

Garrity, P.J.

1988-02-01

This informal paper is intended to provide information to the Los Alamos National Laboratory staff about the recently-signed INF Treaty (formally, the ''Treaty between the United States of America and the Union of Soviet Socialist Republics on the Elimination of Their Intermediate-Range and Shorter-Range Missiles''). It consists of (a) historical background concerning the US/NATO objectives in deploying and negotiating over INF systems; (b) a synopsis of the treaty's provisions with a brief commentary; (c) discussion of the possible impact of the treaty on future American and alliance security policy; and (d) an appendix which contains a summary chronology of eventsmore » relative to INF from 1979 to 1987.« less

A new software-based architecture for quantum computer

NASA Astrophysics Data System (ADS)

Wu, Nan; Song, FangMin; Li, Xiangdong

2010-04-01

In this paper, we study a reliable architecture of a quantum computer and a new instruction set and machine language for the architecture, which can improve the performance and reduce the cost of the quantum computing. We also try to address some key issues in detail in the software-driven universal quantum computers.

Efficient quantum walk on a quantum processor

PubMed Central

Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F.

2016-01-01

The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor. PMID:27146471

Estimating the Resources for Quantum Computation with the QuRE Toolbox

DTIC Science & Technology

2013-05-31

quantum computing. Quantum Info. Comput., 9(7):666–682, July 2009. [13] M. Saffman, T. G. Walker, and K. Mølmer. Quantum information with rydberg atoms...109(5):735–750, 2011. [24] Aram Harrow , Avinatan Hassidim, and Seth Lloyd. Quantum algorithm for solving linear systems of equations. Phys. Rev

Entanglement in a Quantum Annealing Processor

DTIC Science & Technology

2016-09-07

that QA is a viable technology for large- scale quantum computing . DOI: 10.1103/PhysRevX.4.021041 Subject Areas: Quantum Physics, Quantum Information...Superconductivity I. INTRODUCTION The past decade has been exciting for the field of quantum computation . A wide range of physical imple- mentations...measurements used in studying prototype universal quantum computers [9–14]. These constraints make it challenging to experimentally determine whether a scalable

Quantum Optical Implementations of Current Quantum Computing Paradigms

DTIC Science & Technology

2005-05-01

Conferences and Proceedings: The results were presented at several conferences. These include: 1. M. O. Scully, " Foundations of Quantum Mechanics ", in...applications have revealed a strong connection between the fundamental aspects of quantum mechanics that governs physical systems and the informational...could be solved in polynomial time using quantum computers. Another set of problems where quantum mechanics can carry out computations substantially

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System.

PubMed

Xu, Kebiao; Xie, Tianyu; Li, Zhaokai; Xu, Xiangkun; Wang, Mengqi; Ye, Xiangyu; Kong, Fei; Geng, Jianpei; Duan, Changkui; Shi, Fazhan; Du, Jiangfeng

2017-03-31

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System

NASA Astrophysics Data System (ADS)

Xu, Kebiao; Xie, Tianyu; Li, Zhaokai; Xu, Xiangkun; Wang, Mengqi; Ye, Xiangyu; Kong, Fei; Geng, Jianpei; Duan, Changkui; Shi, Fazhan; Du, Jiangfeng

2017-03-01

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian SzIz on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

Compressed quantum computation using a remote five-qubit quantum computer

NASA Astrophysics Data System (ADS)

Hebenstreit, M.; Alsina, D.; Latorre, J. I.; Kraus, B.

2017-05-01

The notion of compressed quantum computation is employed to simulate the Ising interaction of a one-dimensional chain consisting of n qubits using the universal IBM cloud quantum computer running on log2(n ) qubits. The external field parameter that controls the quantum phase transition of this model translates into particular settings of the quantum gates that generate the circuit. We measure the magnetization, which displays the quantum phase transition, on a two-qubit system, which simulates a four-qubit Ising chain, and show its agreement with the theoretical prediction within a certain error. We also discuss the relevant point of how to assess errors when using a cloud quantum computer with a limited amount of runs. As a solution, we propose to use validating circuits, that is, to run independent controlled quantum circuits of similar complexity to the circuit of interest.

Experimental comparison of two quantum computing architectures.

PubMed

Linke, Norbert M; Maslov, Dmitri; Roetteler, Martin; Debnath, Shantanu; Figgatt, Caroline; Landsman, Kevin A; Wright, Kenneth; Monroe, Christopher

2017-03-28

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device (www. ibm.com/ibm-q) with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programed in a way that is blind to the underlying hardware, thus allowing a comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits. Although the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

Continuous-variable quantum Gaussian process regression and quantum singular value decomposition of nonsparse low-rank matrices

NASA Astrophysics Data System (ADS)

Das, Siddhartha; Siopsis, George; Weedbrook, Christian

2018-02-01

With the significant advancement in quantum computation during the past couple of decades, the exploration of machine-learning subroutines using quantum strategies has become increasingly popular. Gaussian process regression is a widely used technique in supervised classical machine learning. Here we introduce an algorithm for Gaussian process regression using continuous-variable quantum systems that can be realized with technology based on photonic quantum computers under certain assumptions regarding distribution of data and availability of efficient quantum access. Our algorithm shows that by using a continuous-variable quantum computer a dramatic speedup in computing Gaussian process regression can be achieved, i.e., the possibility of exponentially reducing the time to compute. Furthermore, our results also include a continuous-variable quantum-assisted singular value decomposition method of nonsparse low rank matrices and forms an important subroutine in our Gaussian process regression algorithm.

Effect of Echinostoma friedi (Trematoda: Echinostomatidae) experimental infection on longevity, growth and fecundity of juvenile Radix peregra (Gastropoda: Lymnaeidae) and Biomphalaria glabrata (Gastropoda: Planorbidae) snails.

PubMed

Muñoz-Antoli, Carla; Marín, Antoni; Toledo, Rafael; Esteban, José-Guillermo

2007-11-01

The effect of Echinostoma friedi experimental infection on longevity, growth and fecundity of two susceptible first intermediate host snails, Radix peregra and Biomphalaria glabrata, was studied to contrast the level of compatibility. 120 R. peregra and 150 B. glabrata snails were used exposed to one, three or five miracidia and divided in three categories: INF (snails exposed and infected); ENI (exposed but not infected) and C (control or not miracidial-exposed snails). R. peregra INF snails' death process starts sooner, but in a prolonged extension, while B. glabrata INF snails have a much shorter life span. The infection and the miracidial exposure are able to reduce R. peregra normal development (stunting). B. glabrata INF snails' growth exceeds that of C snails (gigantism). E. friedi produces a total parasitic castration of R. peregra and B. glabrata INF snails. R. peregra would be considered as the required snail host, while B. glabrata only as an adequate snail host.

INF-γ sensitizes head and neck squamous cell carcinoma cells to chemotherapy-induced apoptosis and necroptosis through up-regulation of Egr-1.

PubMed

Xu, Bei; Shu, Yongqian; Liu, Peng

2014-11-01

Head and neck squamous cell carcinoma (HNSCC) is the sixth most common cancer worldwide. Acquired resistance to standard chemotherapy accounts for most of treatment failure. Here we demonstrate that Interferon-γ (INF-γ) may up-regulate Egr-1 gene expression in HNSCC cell line SCC-25. Forced expression of Egr-1 sensitizes SCC-25 cells to chemotherapy-induced apoptosis and necroptosis, a novel form of programmed cell death. Egr-1 up-regulation also significantly increases the production of Thrombospondin-1 (TSP-1), a matricellular glycoprotein which has been described to induce cell death in HNSCC. Moreover, INF-γ-induced sensitization of cells to chemotherapy-mediated cell death and TSP-1 production could be markedly abolished by Egr-1 silencing. The present investigation provides the first evidence that INF-γ may sensitize HNSCC cells to chemotherapy-induced apoptosis and necroptosis through up-regulation of Egr-1. These data support the combination use of INF-γ and cytotoxic drugs for HNSCC Therapy.

Scalable quantum computer architecture with coupled donor-quantum dot qubits

DOEpatents

Schenkel, Thomas; Lo, Cheuk Chi; Weis, Christoph; Lyon, Stephen; Tyryshkin, Alexei; Bokor, Jeffrey

2014-08-26

A quantum bit computing architecture includes a plurality of single spin memory donor atoms embedded in a semiconductor layer, a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, wherein a first voltage applied across at least one pair of the aligned quantum dot and donor atom controls a donor-quantum dot coupling. A method of performing quantum computing in a scalable architecture quantum computing apparatus includes arranging a pattern of single spin memory donor atoms in a semiconductor layer, forming a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, applying a first voltage across at least one aligned pair of a quantum dot and donor atom to control a donor-quantum dot coupling, and applying a second voltage between one or more quantum dots to control a Heisenberg exchange J coupling between quantum dots and to cause transport of a single spin polarized electron between quantum dots.

Russian Compliance with the Intermediate Range Nuclear Forces (INF) Treaty: Background and Issues for Congress

DTIC Science & Technology

2017-01-27

Russian Compliance with the Intermediate Range Nuclear Forces (INF) Treaty: Background and Issues for Congress Amy F. Woolf Specialist in... Nuclear Weapons Policy January 27, 2017 Congressional Research Service 7-5700 www.crs.gov R43832 Russian Compliance with the Intermediate Range... Nuclear Forces (INF) Treaty Congressional Research Service Summary The United States and Soviet Union signed the Intermediate-Range Nuclear Forces

Risk of isolated nodal failure for non-small cell lung cancer (NSCLC) treated with the elective nodal irradiation (ENI) using 3D-conformal radiotherapy (3D-CRT) techniques--a retrospective analysis.

PubMed

Kepka, Lucyna; Bujko, Krzysztof; Zolciak-Siwinska, Agnieszka

2008-01-01

To estimate retrospectively the rate of isolated nodal failures (INF) in NSCLC patients treated with the elective nodal irradiation (ENI) using 3D-conformal radiotherapy (3D-CRT). One hundred and eighty-five patients with I-IIIB stage treated with 3D-CRT in consecutive clinical trials differing in an extent of the ENI were analyzed. According to the extent of the ENI, two groups were distinguished: extended (n = 124) and limited (n = 61) ENI. INF was defined as regional nodal failure occurring without local progression. Cumulative Incidence of INF (CIINF) was evaluated by univariate and multivariate analysis with regard to prognostic factors. With a median follow up of 30 months, the two-year actuarial overall survival was 35%. The two-year CIINF rate was 12%. There were 16 (9%) INF, eight (6%) for extended and eight (13%) for limited ENI. In the univariate analysis bulky mediastinal disease (BMD), left side, higher N stage, and partial response to RT had a significant negative impact on the CIINF. BMD was the only independent predictor of the risk of incidence of the INF (p = 0.001). INF is more likely to occur in case of more advanced nodal status.

Experimental realization of universal geometric quantum gates with solid-state spins.

PubMed

Zu, C; Wang, W-B; He, L; Zhang, W-G; Dai, C-Y; Wang, F; Duan, L-M

2014-10-02

Experimental realization of a universal set of quantum logic gates is the central requirement for the implementation of a quantum computer. In an 'all-geometric' approach to quantum computation, the quantum gates are implemented using Berry phases and their non-Abelian extensions, holonomies, from geometric transformation of quantum states in the Hilbert space. Apart from its fundamental interest and rich mathematical structure, the geometric approach has some built-in noise-resilience features. On the experimental side, geometric phases and holonomies have been observed in thermal ensembles of liquid molecules using nuclear magnetic resonance; however, such systems are known to be non-scalable for the purposes of quantum computing. There are proposals to implement geometric quantum computation in scalable experimental platforms such as trapped ions, superconducting quantum bits and quantum dots, and a recent experiment has realized geometric single-bit gates in a superconducting system. Here we report the experimental realization of a universal set of geometric quantum gates using the solid-state spins of diamond nitrogen-vacancy centres. These diamond defects provide a scalable experimental platform with the potential for room-temperature quantum computing, which has attracted strong interest in recent years. Our experiment shows that all-geometric and potentially robust quantum computation can be realized with solid-state spin quantum bits, making use of recent advances in the coherent control of this system.

Universal quantum gates for Single Cooper Pair Box based quantum computing

NASA Technical Reports Server (NTRS)

Echternach, P.; Williams, C. P.; Dultz, S. C.; Braunstein, S.; Dowling, J. P.

2000-01-01

We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.

Dissipative quantum computing with open quantum walks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sinayskiy, Ilya; Petruccione, Francesco

An open quantum walk approach to the implementation of a dissipative quantum computing scheme is presented. The formalism is demonstrated for the example of an open quantum walk implementation of a 3 qubit quantum circuit consisting of 10 gates.

Nonadiabatic holonomic quantum computation in decoherence-free subspaces.

PubMed

Xu, G F; Zhang, J; Tong, D M; Sjöqvist, Erik; Kwek, L C

2012-10-26

Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, nonadiabatic holonomic quantum computation in decoherence-free subspaces, which avoids a long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize nonadiabatic holonomic quantum computation in decoherence-free subspaces. By using only three neighboring physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of quantum gates.

Hybrid architecture for encoded measurement-based quantum computation

PubMed Central

Zwerger, M.; Briegel, H. J.; Dür, W.

2014-01-01

We present a hybrid scheme for quantum computation that combines the modular structure of elementary building blocks used in the circuit model with the advantages of a measurement-based approach to quantum computation. We show how to construct optimal resource states of minimal size to implement elementary building blocks for encoded quantum computation in a measurement-based way, including states for error correction and encoded gates. The performance of the scheme is determined by the quality of the resource states, where within the considered error model a threshold of the order of 10% local noise per particle for fault-tolerant quantum computation and quantum communication. PMID:24946906

Simulating chemistry using quantum computers.

PubMed

Kassal, Ivan; Whitfield, James D; Perdomo-Ortiz, Alejandro; Yung, Man-Hong; Aspuru-Guzik, Alán

2011-01-01

The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.

A software methodology for compiling quantum programs

NASA Astrophysics Data System (ADS)

Häner, Thomas; Steiger, Damian S.; Svore, Krysta; Troyer, Matthias

2018-04-01

Quantum computers promise to transform our notions of computation by offering a completely new paradigm. To achieve scalable quantum computation, optimizing compilers and a corresponding software design flow will be essential. We present a software architecture for compiling quantum programs from a high-level language program to hardware-specific instructions. We describe the necessary layers of abstraction and their differences and similarities to classical layers of a computer-aided design flow. For each layer of the stack, we discuss the underlying methods for compilation and optimization. Our software methodology facilitates more rapid innovation among quantum algorithm designers, quantum hardware engineers, and experimentalists. It enables scalable compilation of complex quantum algorithms and can be targeted to any specific quantum hardware implementation.

Resonant transition-based quantum computation

NASA Astrophysics Data System (ADS)

Chiang, Chen-Fu; Hsieh, Chang-Yu

2017-05-01

In this article we assess a novel quantum computation paradigm based on the resonant transition (RT) phenomenon commonly associated with atomic and molecular systems. We thoroughly analyze the intimate connections between the RT-based quantum computation and the well-established adiabatic quantum computation (AQC). Both quantum computing frameworks encode solutions to computational problems in the spectral properties of a Hamiltonian and rely on the quantum dynamics to obtain the desired output state. We discuss how one can adapt any adiabatic quantum algorithm to a corresponding RT version and the two approaches are limited by different aspects of Hamiltonians' spectra. The RT approach provides a compelling alternative to the AQC under various circumstances. To better illustrate the usefulness of the novel framework, we analyze the time complexity of an algorithm for 3-SAT problems and discuss straightforward methods to fine tune its efficiency.

Quantum computing without wavefunctions: time-dependent density functional theory for universal quantum computation.

PubMed

Tempel, David G; Aspuru-Guzik, Alán

2012-01-01

We prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. From a practical standpoint this opens the possibility of approximating observables of interest in quantum computations directly in terms of single-qubit quantities (i.e. as density functionals). Additionally, we also demonstrate that TDDFT provides an exact prescription for simulating universal Hamiltonians with other universal Hamiltonians that have different, and possibly easier-to-realize two-qubit interactions. This establishes the foundations of TDDFT for quantum computation and opens the possibility of developing density functionals for use in quantum algorithms.

Quantum Computing: Solving Complex Problems

ScienceCinema

DiVincenzo, David

2018-05-22

One of the motivating ideas of quantum computation was that there could be a new kind of machine that would solve hard problems in quantum mechanics. There has been significant progress towards the experimental realization of these machines (which I will review), but there are still many questions about how such a machine could solve computational problems of interest in quantum physics. New categorizations of the complexity of computational problems have now been invented to describe quantum simulation. The bad news is that some of these problems are believed to be intractable even on a quantum computer, falling into a quantum analog of the NP class. The good news is that there are many other new classifications of tractability that may apply to several situations of physical interest.

Immune-stimulatory and anti-inflammatory activities of Curcuma longa extract and its polysaccharide fraction

PubMed Central

Chandrasekaran, Chinampudur V.; Sundarajan, Kannan; Edwin, Jothie R.; Gururaja, Giligar M.; Mundkinajeddu, Deepak; Agarwal, Amit

2013-01-01

Background: While curcuminoids have been reported to possess diverse biological activities, the anti-inflammatory activity of polar extracts (devoid of curcuminoids) of Curcuma longa (C. longa) has seldom been studied. In this study, we have investigated immune-stimulatory and anti-inflammatory activities of an aqueous based extract of C. longa (NR-INF-02) and its fractions in presence and absence of mitogens. Materials and Methods: Effects of NR-INF-02 (Turmacin™, Natural Remedies Pvt. Ltd., Bangalore, India) on proliferation, nitric oxide (NO), monocyte chemotactic protein-1 (MCP-1), interleukins (ILs) and prostaglandin (PGE2) levels of mouse splenocytes and mouse macrophage (RAW264.7) cells were determined. Results: NR-INF-02 increased splenocytes number in presence and absence of lipopolysaccharide (LPS) or concanavalin A. Treatment of NR-INF-02 showed a significant increase of NO, IL-2, IL-6, IL-10, IL-12, interferon (IFN) gamma, tumor necrosis factor (TNF) alpha and MCP-1 production in unstimulated mouse splenocytes and mouse macrophages. Interestingly, NR-INF-02 showed potent inhibitory effect towards release of PGE2 and IL-12 levels in LPS stimulated mouse splenocytes. Further, NR-INF-02 was fractionated into polysaccharide fraction (F1) and mother liquor (F2) to study their immune-modulatory effects. F1 was found to be more potent than F2 toward inhibiting PGE2 and IL-12 in LPS stimulated splenocytes. Conclusion: Present findings revealed the novel anti-inflammatory property of NR-INF-02 and its polysaccharide fraction by inhibiting the secretion of IL-12 and PGE2 in vitro. PMID:23798880

Area under the curve predictions of dalbavancin, a new lipoglycopeptide agent, using the end of intravenous infusion concentration data point by regression analyses such as linear, log-linear and power models.

PubMed

Bhamidipati, Ravi Kanth; Syed, Muzeeb; Mullangi, Ramesh; Srinivas, Nuggehally

2018-02-01

1. Dalbavancin, a lipoglycopeptide, is approved for treating gram-positive bacterial infections. Area under plasma concentration versus time curve (AUC inf ) of dalbavancin is a key parameter and AUC inf /MIC ratio is a critical pharmacodynamic marker. 2. Using end of intravenous infusion concentration (i.e. C max ) C max versus AUC inf relationship for dalbavancin was established by regression analyses (i.e. linear, log-log, log-linear and power models) using 21 pairs of subject data. 3. The predictions of the AUC inf were performed using published C max data by application of regression equations. The quotient of observed/predicted values rendered fold difference. The mean absolute error (MAE)/root mean square error (RMSE) and correlation coefficient (r) were used in the assessment. 4. MAE and RMSE values for the various models were comparable. The C max versus AUC inf exhibited excellent correlation (r > 0.9488). The internal data evaluation showed narrow confinement (0.84-1.14-fold difference) with a RMSE < 10.3%. The external data evaluation showed that the models predicted AUC inf with a RMSE of 3.02-27.46% with fold difference largely contained within 0.64-1.48. 5. Regardless of the regression models, a single time point strategy of using C max (i.e. end of 30-min infusion) is amenable as a prospective tool for predicting AUC inf of dalbavancin in patients.

Cloud Quantum Computing of an Atomic Nucleus

NASA Astrophysics Data System (ADS)

Dumitrescu, E. F.; McCaskey, A. J.; Hagen, G.; Jansen, G. R.; Morris, T. D.; Papenbrock, T.; Pooser, R. C.; Dean, D. J.; Lougovski, P.

2018-05-01

We report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

Cloud Quantum Computing of an Atomic Nucleus

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dumitrescu, Eugene F.; McCaskey, Alex J.; Hagen, Gaute

Here, we report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

Cloud Quantum Computing of an Atomic Nucleus.

PubMed

Dumitrescu, E F; McCaskey, A J; Hagen, G; Jansen, G R; Morris, T D; Papenbrock, T; Pooser, R C; Dean, D J; Lougovski, P

2018-05-25

We report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

Cloud Quantum Computing of an Atomic Nucleus

DOE PAGES

Dumitrescu, Eugene F.; McCaskey, Alex J.; Hagen, Gaute; ...

2018-05-23

Here, we report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

Differential interactions of the formins INF2, mDia1, and mDia2 with microtubules

PubMed Central

Gaillard, Jeremie; Ramabhadran, Vinay; Neumanne, Emmanuelle; Gurel, Pinar; Blanchoin, Laurent; Vantard, Marylin; Higgs, Henry N.

2011-01-01

A number of cellular processes use both microtubules and actin filaments, but the molecular machinery linking these two cytoskeletal elements remains to be elucidated in detail. Formins are actin-binding proteins that have multiple effects on actin dynamics, and one formin, mDia2, has been shown to bind and stabilize microtubules through its formin homology 2 (FH2) domain. Here we show that three formins, INF2, mDia1, and mDia2, display important differences in their interactions with microtubules and actin. Constructs containing FH1, FH2, and C-terminal domains of all three formins bind microtubules with high affinity (Kd < 100 nM). However, only mDia2 binds microtubules at 1:1 stoichiometry, with INF2 and mDia1 showing saturating binding at approximately 1:3 (formin dimer:tubulin dimer). INF2-FH1FH2C is a potent microtubule-bundling protein, an effect that results in a large reduction in catastrophe rate. In contrast, neither mDia1 nor mDia2 is a potent microtubule bundler. The C-termini of mDia2 and INF2 have different functions in microtubule interaction, with mDia2's C-terminus required for high-affinity binding and INF2's C-terminus required for bundling. mDia2's C-terminus directly binds microtubules with submicromolar affinity. These formins also differ in their abilities to bind actin and microtubules simultaneously. Microtubules strongly inhibit actin polymerization by mDia2, whereas they moderately inhibit mDia1 and have no effect on INF2. Conversely, actin monomers inhibit microtubule binding/bundling by INF2 but do not affect mDia1 or mDia2. These differences in interactions with microtubules and actin suggest differential function in cellular processes requiring both cytoskeletal elements. PMID:21998204

DAPk1 inhibits NF-κB activation through TNF-α and INF-γ-induced apoptosis.

PubMed

Yoo, Heon Jong; Byun, Hyun-Jung; Kim, Boh-Ram; Lee, Ki Hwan; Park, Sang-Yoon; Rho, Seung Bae

2012-07-01

Recent studies have shown DAPk as a molecular modulator induced by the second messenger, responsible for controlling cell destiny decisions, but the detailed mechanism mediating the role of DAPk1 during cell death is still not fully understood. In this present report, we attempted to characterize the effects of TNF-α and INF-γ on DAPk1 in human ovarian carcinoma cell lines, OVCAR-3. Both TNF-α and INF-γ significantly induce DAPk1 levels in a time-dependent manner. At the same time, they both arrested cell cycle progression in the G(0)-G(1) and G2/M phase, down-regulated cyclin D1, CDK4 and NF-κB expression, while also up-regulating p27 and p16 expression. Subsequently, the efficacy of the combined treatment with DAPk1 was investigated. In the presence of DAPk1, TNF-α or INF-γ-induced apoptosis was additively increased, while TNF-α or INF-γ-induced NF-κB activity was inhibited. Conversely, TNF-α or INF-γ-dependent NF-κB activity was further enhanced by the inhibition of DAPk1 with its specific siRNA. The activity of NF-κB was dependent on the level of DAPk1, indicating the requirement of DAPk1 for the activation of NF-κB. Low levels of DAPk1 expression were frequently observed in different human patient's tissue and cancer cell lines compared to normal samples. In addition, over-expression of DAPk1 from either TNF-α or INF-γ-treatment cells suppressed the anti-apoptosis protein XIAP as well as COX-2 and ICAM-1, more than control. Taken together, our data findings suggest that DAPk1 can mediate the pro-apoptotic activity of TNF-α and INF-γ via the NF-κB signaling pathways. Copyright © 2012 Elsevier Inc. All rights reserved.

Designing, programming, and optimizing a (small) quantum computer

NASA Astrophysics Data System (ADS)

Svore, Krysta

In 1982, Richard Feynman proposed to use a computer founded on the laws of quantum physics to simulate physical systems. In the more than thirty years since, quantum computers have shown promise to solve problems in number theory, chemistry, and materials science that would otherwise take longer than the lifetime of the universe to solve on an exascale classical machine. The practical realization of a quantum computer requires understanding and manipulating subtle quantum states while experimentally controlling quantum interference. It also requires an end-to-end software architecture for programming, optimizing, and implementing a quantum algorithm on the quantum device hardware. In this talk, we will introduce recent advances in connecting abstract theory to present-day real-world applications through software. We will highlight recent advancement of quantum algorithms and the challenges in ultimately performing a scalable solution on a quantum device.

Quantum Walk Schemes for Universal Quantum Computation

NASA Astrophysics Data System (ADS)

Underwood, Michael S.

Random walks are a powerful tool for the efficient implementation of algorithms in classical computation. Their quantum-mechanical analogues, called quantum walks, hold similar promise. Quantum walks provide a model of quantum computation that has recently been shown to be equivalent in power to the standard circuit model. As in the classical case, quantum walks take place on graphs and can undergo discrete or continuous evolution, though quantum evolution is unitary and therefore deterministic until a measurement is made. This thesis considers the usefulness of continuous-time quantum walks to quantum computation from the perspectives of both their fundamental power under various formulations, and their applicability in practical experiments. In one extant scheme, logical gates are effected by scattering processes. The results of an exhaustive search for single-qubit operations in this model are presented. It is shown that the number of distinct operations increases exponentially with the number of vertices in the scattering graph. A catalogue of all graphs on up to nine vertices that implement single-qubit unitaries at a specific set of momenta is included in an appendix. I develop a novel scheme for universal quantum computation called the discontinuous quantum walk, in which a continuous-time quantum walker takes discrete steps of evolution via perfect quantum state transfer through small 'widget' graphs. The discontinuous quantum-walk scheme requires an exponentially sized graph, as do prior discrete and continuous schemes. To eliminate the inefficient vertex resource requirement, a computation scheme based on multiple discontinuous walkers is presented. In this model, n interacting walkers inhabiting a graph with 2n vertices can implement an arbitrary quantum computation on an input of length n, an exponential savings over previous universal quantum walk schemes. This is the first quantum walk scheme that allows for the application of quantum error correction. The many-particle quantum walk can be viewed as a single quantum walk undergoing perfect state transfer on a larger weighted graph, obtained via equitable partitioning. I extend this formalism to non-simple graphs. Examples of the application of equitable partitioning to the analysis of quantum walks and many-particle quantum systems are discussed.

Step-by-step magic state encoding for efficient fault-tolerant quantum computation

PubMed Central

Goto, Hayato

2014-01-01

Quantum error correction allows one to make quantum computers fault-tolerant against unavoidable errors due to decoherence and imperfect physical gate operations. However, the fault-tolerant quantum computation requires impractically large computational resources for useful applications. This is a current major obstacle to the realization of a quantum computer. In particular, magic state distillation, which is a standard approach to universality, consumes the most resources in fault-tolerant quantum computation. For the resource problem, here we propose step-by-step magic state encoding for concatenated quantum codes, where magic states are encoded step by step from the physical level to the logical one. To manage errors during the encoding, we carefully use error detection. Since the sizes of intermediate codes are small, it is expected that the resource overheads will become lower than previous approaches based on the distillation at the logical level. Our simulation results suggest that the resource requirements for a logical magic state will become comparable to those for a single logical controlled-NOT gate. Thus, the present method opens a new possibility for efficient fault-tolerant quantum computation. PMID:25511387

Step-by-step magic state encoding for efficient fault-tolerant quantum computation.

PubMed

Goto, Hayato

2014-12-16

Quantum error correction allows one to make quantum computers fault-tolerant against unavoidable errors due to decoherence and imperfect physical gate operations. However, the fault-tolerant quantum computation requires impractically large computational resources for useful applications. This is a current major obstacle to the realization of a quantum computer. In particular, magic state distillation, which is a standard approach to universality, consumes the most resources in fault-tolerant quantum computation. For the resource problem, here we propose step-by-step magic state encoding for concatenated quantum codes, where magic states are encoded step by step from the physical level to the logical one. To manage errors during the encoding, we carefully use error detection. Since the sizes of intermediate codes are small, it is expected that the resource overheads will become lower than previous approaches based on the distillation at the logical level. Our simulation results suggest that the resource requirements for a logical magic state will become comparable to those for a single logical controlled-NOT gate. Thus, the present method opens a new possibility for efficient fault-tolerant quantum computation.

Secure entanglement distillation for double-server blind quantum computation.

PubMed

Morimae, Tomoyuki; Fujii, Keisuke

2013-07-12

Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computation to a server, who has a fully fledged quantum computer, in such a way that the server cannot learn anything about the client's input, output, and program. If the client interacts with only a single server, the client has to have some minimum quantum power, such as the ability of emitting randomly rotated single-qubit states or the ability of measuring states. If the client interacts with two servers who share Bell pairs but cannot communicate with each other, the client can be completely classical. For such a double-server scheme, two servers have to share clean Bell pairs, and therefore the entanglement distillation is necessary in a realistic noisy environment. In this Letter, we show that it is possible to perform entanglement distillation in the double-server scheme without degrading the security of blind quantum computing.

Efficient universal blind quantum computation.

PubMed

Giovannetti, Vittorio; Maccone, Lorenzo; Morimae, Tomoyuki; Rudolph, Terry G

2013-12-06

We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party's quantum computer without revealing either which computation is performed, or its input and output. The first party's computational capabilities can be extremely limited: she must only be able to create and measure single-qubit superposition states. The second party is not required to use measurement-based quantum computation. The protocol requires the (optimal) exchange of O(Jlog2(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation.

Hyperon-Nucleon Interaction and Strangeness Production in PP Collisions

NASA Astrophysics Data System (ADS)

Haidenbauer, J.

2002-09-01

A new model for the hyperon-nucleon (ΛN, ΣN) interaction is presented. The model incorporates the standard one-boson exchange contributions of the lowest pseudoscalar and vector meson multiplets with coupling constants fixed by SU(6) symmetry relations. As the main feature of the new model, the exchange of two correlated pions or kaons, both in the scalar-isoscalar (σ) and vector-isovector (ρ) channels, is included. Furthermore, results of a model calculation for the reactions pp → NΛK and pp → NΣK near their thresholds are reported. Special attention is paid to the cross section ratio σpp→pΛK+/σpp→pΣ0K+ which was found to be unexpectedly large in recent experiments.

W + Jet Production at Cdf

NASA Astrophysics Data System (ADS)

Messina, Andrea

2007-01-01

The cross section for the inclusive production of W bosons in association with jets in pbar {p} collisions at √ {s} = 1.96\\ TeV using the Collider Detector at Fermilab (CDF II) is presented. The measurement is based on an integrated luminosity of 320 pb-1, and includes events with up to 4 or more jets. In each jet multiplicity sample the differential and cumulative cross sections with respect to the transverse energy of the ith-jet are measured. For W + ≥ 2 jets the differential cross section with respect to the 2-leading jets invariant mass mj1j2 and angular separation ΔRj1j2 is also reported. The data are compared to predictions from Monte Carlo simulations.

On the Energy of the Minimizers of the Ginzburg-Landau Functional for Exterior Magnetic Fields Between HC2 and HC3

NASA Astrophysics Data System (ADS)

Helffer, Bernard

2011-04-01

Superconductivity for Type II superconductors in external magnetic fields of magnitude between the second and third critical fields is known to be restricted to a narrow boundary region. The profile of the superconducting order parameter in the Ginzburg-Landau model is expected to be governed by an effective one-dimensional model. This is known to be the case for external magnetic fields sufficiently close to the third critical field. In this text we announce such a result on a larger interval of validity. These results have been obtained in collaboration with Soeren Fournais and Mikael Persson and the complete proofs will appear elsewhere.

High-speed linear optics quantum computing using active feed-forward.

PubMed

Prevedel, Robert; Walther, Philip; Tiefenbacher, Felix; Böhi, Pascal; Kaltenbaek, Rainer; Jennewein, Thomas; Zeilinger, Anton

2007-01-04

As information carriers in quantum computing, photonic qubits have the advantage of undergoing negligible decoherence. However, the absence of any significant photon-photon interaction is problematic for the realization of non-trivial two-qubit gates. One solution is to introduce an effective nonlinearity by measurements resulting in probabilistic gate operations. In one-way quantum computation, the random quantum measurement error can be overcome by applying a feed-forward technique, such that the future measurement basis depends on earlier measurement results. This technique is crucial for achieving deterministic quantum computation once a cluster state (the highly entangled multiparticle state on which one-way quantum computation is based) is prepared. Here we realize a concatenated scheme of measurement and active feed-forward in a one-way quantum computing experiment. We demonstrate that, for a perfect cluster state and no photon loss, our quantum computation scheme would operate with good fidelity and that our feed-forward components function with very high speed and low error for detected photons. With present technology, the individual computational step (in our case the individual feed-forward cycle) can be operated in less than 150 ns using electro-optical modulators. This is an important result for the future development of one-way quantum computers, whose large-scale implementation will depend on advances in the production and detection of the required highly entangled cluster states.

A Decoherence-Free Quantum Memory Using Trapped Ions

DTIC Science & Technology

2016-09-22

superpo- sitions. Robust quantum memories are there- fore essential to realizing the potential gains of quantum computing (3). However, inter- action of a...tolerant quantum logic (13, 14). These properties suggest that DFSs will be intrinsic to future quantum computing architectures. Logic gates on DFS...practi- cal quantum computing will in any case re- quire logic gates of a much higher fidelity than those used in this work. We therefore expect that, once

Harnessing Disordered-Ensemble Quantum Dynamics for Machine Learning

NASA Astrophysics Data System (ADS)

Fujii, Keisuke; Nakajima, Kohei

2017-08-01

The quantum computer has an amazing potential of fast information processing. However, the realization of a digital quantum computer is still a challenging problem requiring highly accurate controls and key application strategies. Here we propose a platform, quantum reservoir computing, to solve these issues successfully by exploiting the natural quantum dynamics of ensemble systems, which are ubiquitous in laboratories nowadays, for machine learning. This framework enables ensemble quantum systems to universally emulate nonlinear dynamical systems including classical chaos. A number of numerical experiments show that quantum systems consisting of 5-7 qubits possess computational capabilities comparable to conventional recurrent neural networks of 100-500 nodes. This discovery opens up a paradigm for information processing with artificial intelligence powered by quantum physics.

QCCM Center for Quantum Algorithms

DTIC Science & Technology

2008-10-17

algorithms (e.g., quantum walks and adiabatic computing ), as well as theoretical advances relating algorithms to physical implementations (e.g...Park, NC 27709-2211 15. SUBJECT TERMS Quantum algorithms, quantum computing , fault-tolerant error correction Richard Cleve MITACS East Academic...0511200 Algebraic results on quantum automata A. Ambainis, M. Beaudry, M. Golovkins, A. Kikusts, M. Mercer, D. Thrien Theory of Computing Systems 39(2006

Self-guaranteed measurement-based quantum computation

NASA Astrophysics Data System (ADS)

Hayashi, Masahito; Hajdušek, Michal

2018-05-01

In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling effects, unexpected noise, or unaccounted for correlations between several subsystems. If we do not trust the measurement basis or the prepared entangled state, we do need to be worried about such uncertainties. To this end, we propose a self-guaranteed protocol for verification of quantum computation under the scheme of measurement-based quantum computation where no prior-trusted devices (measurement basis or entangled state) are needed. The approach we present enables the implementation of verifiable quantum computation using the measurement-based model in the context of a particular instance of delegated quantum computation where the server prepares the initial computational resource and sends it to the client, who drives the computation by single-qubit measurements. Applying self-testing procedures, we are able to verify the initial resource as well as the operation of the quantum devices and hence the computation itself. The overhead of our protocol scales with the size of the initial resource state to the power of 4 times the natural logarithm of the initial state's size.

Limits on efficient computation in the physical world

NASA Astrophysics Data System (ADS)

Aaronson, Scott Joel

More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use powerful tools from computational complexity theory to help determine which are which. In the first part of the thesis, I attack the common belief that quantum computing resembles classical exponential parallelism, by showing that quantum computers would face serious limitations on a wider range of problems than was previously known. In particular, any quantum algorithm that solves the collision problem---that of deciding whether a sequence of n integers is one-to-one or two-to-one---must query the sequence O (n1/5) times. This resolves a question that was open for years; previously no lower bound better than constant was known. A corollary is that there is no "black-box" quantum algorithm to break cryptographic hash functions or solve the Graph Isomorphism problem in polynomial time. I also show that relative to an oracle, quantum computers could not solve NP-complete problems in polynomial time, even with the help of nonuniform "quantum advice states"; and that any quantum algorithm needs O (2n/4/n) queries to find a local minimum of a black-box function on the n-dimensional hypercube. Surprisingly, the latter result also leads to new classical lower bounds for the local search problem. Finally, I give new lower bounds on quantum one-way communication complexity, and on the quantum query complexity of total Boolean functions and recursive Fourier sampling. The second part of the thesis studies the relationship of the quantum computing model to physical reality. I first examine the arguments of Leonid Levin, Stephen Wolfram, and others who believe quantum computing to be fundamentally impossible. I find their arguments unconvincing without a "Sure/Shor separator"---a criterion that separates the already-verified quantum states from those that appear in Shor's factoring algorithm. I argue that such a separator should be based on a complexity classification of quantum states, and go on to create such a classification. Next I ask what happens to the quantum computing model if we take into account that the speed of light is finite---and in particular, whether Grover's algorithm still yields a quadratic speedup for searching a database. Refuting a claim by Benioff, I show that the surprising answer is yes. Finally, I analyze hypothetical models of computation that go even beyond quantum computing. I show that many such models would be as powerful as the complexity class PP, and use this fact to give a simple, quantum computing based proof that PP is closed under intersection. On the other hand, I also present one model---wherein we could sample the entire history of a hidden variable---that appears to be more powerful than standard quantum computing, but only slightly so.

Architectures for Quantum Simulation Showing a Quantum Speedup

NASA Astrophysics Data System (ADS)

Bermejo-Vega, Juan; Hangleiter, Dominik; Schwarz, Martin; Raussendorf, Robert; Eisert, Jens

2018-04-01

One of the main aims in the field of quantum simulation is to achieve a quantum speedup, often referred to as "quantum computational supremacy," referring to the experimental realization of a quantum device that computationally outperforms classical computers. In this work, we show that one can devise versatile and feasible schemes of two-dimensional, dynamical, quantum simulators showing such a quantum speedup, building on intermediate problems involving nonadaptive, measurement-based, quantum computation. In each of the schemes, an initial product state is prepared, potentially involving an element of randomness as in disordered models, followed by a short-time evolution under a basic translationally invariant Hamiltonian with simple nearest-neighbor interactions and a mere sampling measurement in a fixed basis. The correctness of the final-state preparation in each scheme is fully efficiently certifiable. We discuss experimental necessities and possible physical architectures, inspired by platforms of cold atoms in optical lattices and a number of others, as well as specific assumptions that enter the complexity-theoretic arguments. This work shows that benchmark settings exhibiting a quantum speedup may require little control, in contrast to universal quantum computing. Thus, our proposal puts a convincing experimental demonstration of a quantum speedup within reach in the near term.

Demonstration of measurement-only blind quantum computing

NASA Astrophysics Data System (ADS)

Greganti, Chiara; Roehsner, Marie-Christine; Barz, Stefanie; Morimae, Tomoyuki; Walther, Philip

2016-01-01

Blind quantum computing allows for secure cloud networks of quasi-classical clients and a fully fledged quantum server. Recently, a new protocol has been proposed, which requires a client to perform only measurements. We demonstrate a proof-of-principle implementation of this measurement-only blind quantum computing, exploiting a photonic setup to generate four-qubit cluster states for computation and verification. Feasible technological requirements for the client and the device-independent blindness make this scheme very applicable for future secure quantum networks.

Quantum machine learning.

PubMed

Biamonte, Jacob; Wittek, Peter; Pancotti, Nicola; Rebentrost, Patrick; Wiebe, Nathan; Lloyd, Seth

2017-09-13

Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Quantum systems produce atypical patterns that classical systems are thought not to produce efficiently, so it is reasonable to postulate that quantum computers may outperform classical computers on machine learning tasks. The field of quantum machine learning explores how to devise and implement quantum software that could enable machine learning that is faster than that of classical computers. Recent work has produced quantum algorithms that could act as the building blocks of machine learning programs, but the hardware and software challenges are still considerable.

Quantum machine learning

NASA Astrophysics Data System (ADS)

Biamonte, Jacob; Wittek, Peter; Pancotti, Nicola; Rebentrost, Patrick; Wiebe, Nathan; Lloyd, Seth

2017-09-01

Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Quantum systems produce atypical patterns that classical systems are thought not to produce efficiently, so it is reasonable to postulate that quantum computers may outperform classical computers on machine learning tasks. The field of quantum machine learning explores how to devise and implement quantum software that could enable machine learning that is faster than that of classical computers. Recent work has produced quantum algorithms that could act as the building blocks of machine learning programs, but the hardware and software challenges are still considerable.

The Effect of Electroencephalogram (EEG) Reference Choice on Information-Theoretic Measures of the Complexity and Integration of EEG Signals

PubMed Central

Trujillo, Logan T.; Stanfield, Candice T.; Vela, Ruben D.

2017-01-01

Converging evidence suggests that human cognition and behavior emerge from functional brain networks interacting on local and global scales. We investigated two information-theoretic measures of functional brain segregation and integration—interaction complexity CI(X), and integration I(X)—as applied to electroencephalographic (EEG) signals and how these measures are affected by choice of EEG reference. CI(X) is a statistical measure of the system entropy accounted for by interactions among its elements, whereas I(X) indexes the overall deviation from statistical independence of the individual elements of a system. We recorded 72 channels of scalp EEG from human participants who sat in a wakeful resting state (interleaved counterbalanced eyes-open and eyes-closed blocks). CI(X) and I(X) of the EEG signals were computed using four different EEG references: linked-mastoids (LM) reference, average (AVG) reference, a Laplacian (LAP) “reference-free” transformation, and an infinity (INF) reference estimated via the Reference Electrode Standardization Technique (REST). Fourier-based power spectral density (PSD), a standard measure of resting state activity, was computed for comparison and as a check of data integrity and quality. We also performed dipole source modeling in order to assess the accuracy of neural source CI(X) and I(X) estimates obtained from scalp-level EEG signals. CI(X) was largest for the LAP transformation, smallest for the LM reference, and at intermediate values for the AVG and INF references. I(X) was smallest for the LAP transformation, largest for the LM reference, and at intermediate values for the AVG and INF references. Furthermore, across all references, CI(X) and I(X) reliably distinguished between resting-state conditions (larger values for eyes-open vs. eyes-closed). These findings occurred in the context of the overall expected pattern of resting state PSD. Dipole modeling showed that simulated scalp EEG-level CI(X) and I(X) reflected changes in underlying neural source dependencies, but only for higher levels of integration and with highest accuracy for the LAP transformation. Our observations suggest that the Laplacian-transformation should be preferred for the computation of scalp-level CI(X) and I(X) due to its positive impact on EEG signal quality and statistics, reduction of volume-conduction, and the higher accuracy this provides when estimating scalp-level EEG complexity and integration. PMID:28790884

Experimental comparison of two quantum computing architectures

PubMed Central

Linke, Norbert M.; Maslov, Dmitri; Roetteler, Martin; Debnath, Shantanu; Figgatt, Caroline; Landsman, Kevin A.; Wright, Kenneth; Monroe, Christopher

2017-01-01

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device (www.research.ibm.com/ibm-q) with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programed in a way that is blind to the underlying hardware, thus allowing a comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits. Although the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future. PMID:28325879

Complex Instruction Set Quantum Computing

NASA Astrophysics Data System (ADS)

Sanders, G. D.; Kim, K. W.; Holton, W. C.

1998-03-01

In proposed quantum computers, electromagnetic pulses are used to implement logic gates on quantum bits (qubits). Gates are unitary transformations applied to coherent qubit wavefunctions and a universal computer can be created using a minimal set of gates. By applying many elementary gates in sequence, desired quantum computations can be performed. This reduced instruction set approach to quantum computing (RISC QC) is characterized by serial application of a few basic pulse shapes and a long coherence time. However, the unitary matrix of the overall computation is ultimately a unitary matrix of the same size as any of the elementary matrices. This suggests that we might replace a sequence of reduced instructions with a single complex instruction using an optimally taylored pulse. We refer to this approach as complex instruction set quantum computing (CISC QC). One trades the requirement for long coherence times for the ability to design and generate potentially more complex pulses. We consider a model system of coupled qubits interacting through nearest neighbor coupling and show that CISC QC can reduce the time required to perform quantum computations.

CONSORT: Effects of adding adefovirdipivoxil to peginterferon alfa-2a at different time points on HBeAg-positivepatients: A prospective, randomized study.

PubMed

Zhang, Ka; Cao, Hong; Liang, Jiayi; Shu, Xin; Sun, Haixia; Li, Gang; Xu, Qihuan

2016-08-01

The aims of this study were to compare the efficacy and safety of the addition of adefovir dipivoxil (ADV) (started at different time points) to pegylated interferon alpha-2a (PEG-INF-α2a) and PEG-INF-α2a monotherapy. This prospective, randomized study sought to evaluate the safety and efficacy of the combination of PEG-INF-α2a and ADV at different time points.120 patients were randomized into groups that received PEG-INF-α2a as monotherapy (group A) or in combination with ADV started at week 0 (group B), 12 (group C), or 24 (group D). All patients were followed for 48 weeks. Efficacy and safety analyses were performed. Patients in group a received 135 μg of PEG-INF-α2a by subcutaneous injection once weekly for 48 weeks. Patients in the ADV add-on group received 135 μg of PEG-INF-α2a subcutaneously once weekly and received 10 mg of ADV administered once daily for 48 weeks. HBV DNA, HBsAg, HBeAg, and hepatitis B e antibody levels were determined. Responses were determined at week 12 (ADV add-on), the end of treatment for PEG-INF-α2a (48weeks) and ADV (EOT) and at the end of 96 weeks of follow-up (EOF). The rate of HBV DNA loss were higher in the combination groups than group A at the week 12, week 48, the EOT and EOF (P < 0.05). The rates of HBeAg seroconversion and HBsAg loss were similar among the treatment groups (P>0.05). The alanineaminotransferase (ALT) normalization rate was higher in the combination group than group A only at the EOT (P = 0.007). By the EOF, the patients with ADV added at week 12 achieved higher rates of HBV DNA loss (71.9%), HBeAg seroconversion (50.0%), HBsAg loss (15.6%), and ALT normalization (78.1%). PEG-INF-α2a plus ADV combination therapy is safe and superior to PEG-INF-α2amonotherapyfor decreasing serum HBV DNA and normalizing the ALT level but has no significant impact on the rate of HBeAg seroconversion and HBsAg loss. Adding ADV at week 12 may be an optimal combination strategy.

Quantum Error Correction

NASA Astrophysics Data System (ADS)

Lidar, Daniel A.; Brun, Todd A.

2013-09-01

Prologue; Preface; Part I. Background: 1. Introduction to decoherence and noise in open quantum systems Daniel Lidar and Todd Brun; 2. Introduction to quantum error correction Dave Bacon; 3. Introduction to decoherence-free subspaces and noiseless subsystems Daniel Lidar; 4. Introduction to quantum dynamical decoupling Lorenza Viola; 5. Introduction to quantum fault tolerance Panos Aliferis; Part II. Generalized Approaches to Quantum Error Correction: 6. Operator quantum error correction David Kribs and David Poulin; 7. Entanglement-assisted quantum error-correcting codes Todd Brun and Min-Hsiu Hsieh; 8. Continuous-time quantum error correction Ognyan Oreshkov; Part III. Advanced Quantum Codes: 9. Quantum convolutional codes Mark Wilde; 10. Non-additive quantum codes Markus Grassl and Martin Rötteler; 11. Iterative quantum coding systems David Poulin; 12. Algebraic quantum coding theory Andreas Klappenecker; 13. Optimization-based quantum error correction Andrew Fletcher; Part IV. Advanced Dynamical Decoupling: 14. High order dynamical decoupling Zhen-Yu Wang and Ren-Bao Liu; 15. Combinatorial approaches to dynamical decoupling Martin Rötteler and Pawel Wocjan; Part V. Alternative Quantum Computation Approaches: 16. Holonomic quantum computation Paolo Zanardi; 17. Fault tolerance for holonomic quantum computation Ognyan Oreshkov, Todd Brun and Daniel Lidar; 18. Fault tolerant measurement-based quantum computing Debbie Leung; Part VI. Topological Methods: 19. Topological codes Héctor Bombín; 20. Fault tolerant topological cluster state quantum computing Austin Fowler and Kovid Goyal; Part VII. Applications and Implementations: 21. Experimental quantum error correction Dave Bacon; 22. Experimental dynamical decoupling Lorenza Viola; 23. Architectures Jacob Taylor; 24. Error correction in quantum communication Mark Wilde; Part VIII. Critical Evaluation of Fault Tolerance: 25. Hamiltonian methods in QEC and fault tolerance Eduardo Novais, Eduardo Mucciolo and Harold Baranger; 26. Critique of fault-tolerant quantum information processing Robert Alicki; References; Index.

Simple proof of equivalence between adiabatic quantum computation and the circuit model.

PubMed

Mizel, Ari; Lidar, Daniel A; Mitchell, Morgan

2007-08-17

We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The amount of time needed is evaluated by computing the gap. We show that the procedure is computationally efficient.

Layered Architectures for Quantum Computers and Quantum Repeaters

NASA Astrophysics Data System (ADS)

Jones, Nathan C.

This chapter examines how to organize quantum computers and repeaters using a systematic framework known as layered architecture, where machine control is organized in layers associated with specialized tasks. The framework is flexible and could be used for analysis and comparison of quantum information systems. To demonstrate the design principles in practice, we develop architectures for quantum computers and quantum repeaters based on optically controlled quantum dots, showing how a myriad of technologies must operate synchronously to achieve fault-tolerance. Optical control makes information processing in this system very fast, scalable to large problem sizes, and extendable to quantum communication.

Radio-frequency measurement in semiconductor quantum computation

NASA Astrophysics Data System (ADS)

Han, TianYi; Chen, MingBo; Cao, Gang; Li, HaiOu; Xiao, Ming; Guo, GuoPing

2017-05-01

Semiconductor quantum dots have attracted wide interest for the potential realization of quantum computation. To realize efficient quantum computation, fast manipulation and the corresponding readout are necessary. In the past few decades, considerable progress of quantum manipulation has been achieved experimentally. To meet the requirements of high-speed readout, radio-frequency (RF) measurement has been developed in recent years, such as RF-QPC (radio-frequency quantum point contact) and RF-DGS (radio-frequency dispersive gate sensor). Here we specifically demonstrate the principle of the radio-frequency reflectometry, then review the development and applications of RF measurement, which provides a feasible way to achieve high-bandwidth readout in quantum coherent control and also enriches the methods to study these artificial mesoscopic quantum systems. Finally, we prospect the future usage of radio-frequency reflectometry in scaling-up of the quantum computing models.

Magnetic resonance force microscopy quantum computer with tellurium donors in silicon.

PubMed

Berman, G P; Doolen, G D; Hammel, P C; Tsifrinovich, V I

2001-03-26

We propose a magnetic resonance force microscopy (MRFM)-based nuclear spin quantum computer using tellurium impurities in silicon. This approach to quantum computing combines well-developed silicon technology and expected advances in MRFM. Our proposal does not use electrostatic gates to realize quantum logic operations.

SGT1 is required in PcINF1/SRC2-1 induced pepper defense response by interacting with SRC2-1

PubMed Central

Liu, Zhi-qin; Liu, Yan-yan; Shi, Lan-ping; Yang, Sheng; Shen, Lei; Yu, Huan-xin; Wang, Rong-zhang; Wen, Jia-yu; Tang, Qian; Hussain, Ansar; Khan, Muhammad Ifnan; Hu, Jiong; Liu, Cai-ling; Zhang, Yang-wen; Cheng, Wei; He, Shui-lin

2016-01-01

PcINF1 was previously found to induce pepper defense response by interacting with SRC2-1, but the underlying mechanism remains uninvestigated. Herein, we describe the involvement of SGT1 in the PcINF1/SRC2-1-induced immunity. SGT1 was observed to be up-regulated by Phytophthora capsici inoculation and synergistically transient overexpression of PcINF1/SRC2-1 in pepper plants. SGT1-silencing compromised HR cell death, blocked H2O2 accumulation, and downregulated HR-associated and hormones-dependent marker genes’ expression triggered by PcINF1/SRC2-1 co-overexpression. The interaction between SRC2-1 and SGT1 was found by the yeast two hybrid system and was further confirmed by bimolecular fluorescence complementation and co-immunoprecipitation analyses. The SGT1/SRC2-1 interaction was enhanced by transient overexpression of PcINF1 and Phytophthora capsici inoculation, and SGT1-silencing attenuated PcINF1/SRC2-1 interaction. Additionally, by modulating subcellular localizations of SRC2-1, SGT1, and the interacting complex of SGT1/SRC2-1, it was revealed that exclusive nuclear targeting of the SGT1/SRC2-1 complex blocks immunity triggered by formation of SGT1/SRC2-1, and a translocation of the SGT1/SRC2-1 complex from the plasma membrane and cytoplasm to the nuclei upon the inoculation of P. capsici. Our data demonstrate that the SGT1/SRC2-1 interaction, and its nucleocytoplasmic partitioning, is involved in pepper’s immunity against P. capsici, thus providing a molecular link between Ca2+ signaling associated SRC2-1 and SGT1-mediated defense signaling. PMID:26898479

A prospective randomized study of Chop versus Chop plus alpha-2B interferon in patients with intermediate and high grade non-Hodgkin's lymphoma: the International Oncology Study Group NHL1 Study .

PubMed

Giles, F J; Shan, J; Advani, S H; Akan, H; Aydogdu, I; Aziz, Z; Azim, H A; Bapsy, P P; Buyukkececi, F; Chaimongkol, B; Chen, P M; Cheong, S K; Ferhanoglu, B; Hamza, R; Khalid, H M; Intragumtornchai, T; Kim, S W; Kim, S Y; Koc, H; Kumar, L; Kumar, R; Lei, K I; Lekhakula, A; Muthalib, A; Patel, M; Poovalingam, V P; Prayoonwiwat, W; Rana, F; Reksodiputro, A H; Ruff, P; Sagar, T G; Schwarer, A P; Song, H S; Suh, C W; Suharti, C; Supindiman, I; Tee, G Y; Thamprasit, T; Villalon, A H; Wickham, N R; Wong, J E; Yalcin, A; Jootar, S

2000-12-01

The addition of a brief alpha interferon regimen to each CHOP induction cycle, plus one year of alpha interferon thrice weekly maintenance therapy, has no early effect on response rates or survival in patients with Intermediate or High grade cell NHL. The CHOP (Cyclophosphamide, Adriamycin. Vincristine, Prednisone) regimen is the most widely used first-line therapy for patients with Intermediate or High Grade (IG/HG) non-Hodgkin's lymphoma (NHL). Alpha 2b interferon (INF) enhances response rates and improves survival in low-grade NHL. The International Oncology Study Group (IOSG) conducted a prospective randomized study comparing CHOP alone or combined with INF in patients with IG/HG-NHL. The primary study aim was to compare the objective response rates in these patient cohorts. Patients with a confirmed diagnosis of measurable NHL of International Working Formulation (IWF) groups D to H histology were randomized to receive CHOP alone or CHOP with 5Mu INF s.c. for 5 days on days 22 to 26 of each 28 day cycle with INF 5 million units (Mu) given three times per week subcutaneously for 52 weeks in those patients who responded to CHOP plus INF. The overall response rates were equivalent in both groups: CHOP alone (214 patients) 81% (complete 55%, partial 26%); CHOP plus INF (221 patients) 80% (complete 54%, partial 26%). At 36 months, the actuarial survival rate was equivalent in both groups. There is no apparent early advantage in terms of response or survival conferred by adding the study INF regimen to CHOP therapy for patients with IG/HG-NHL.

The INF (Intermediate-Range Nuclear Forces) Controversy: A Confluence of Foreign and Domestic Interests.

DTIC Science & Technology

1986-09-01

AD-R175 303 THE INF (INTERMEDIRTE-RANSE NUCLEAR FORCES) 1/2 CONTROVERSY: A CONFLUENCE OF FOREIGN AND DOMESTIC INTERESTS(U) NAVAL POSTGRADUATE SCHOOL...on reverse if necessary and identify by block number) F:ELD I GROUP SUB-GROUP INF (Intermediate-Range Nuclear Forces, NATO, European Nuclear Capability...the United Kingdom, and several non- nuclear members of 14ATO are examined and analyzed. The analysis is concerned with alliance and transnational

Early diagnosis of tuberculosis using an INF-gamma assay in a child with HIV-1 infection and a very low CD4 count.

PubMed

Spyridis, Nikos; Chakraborty, Rana; Sharland, Mike; Heath, Paul T

2007-01-01

An 11-y-old girl diagnosed with HIV-1, presented with prolonged pyrexia and a non-reactive tuberculin skin test. An INF-gamma assay (ELISpot) was positive and led to administration of tuberculosis treatment. Positive cultures for Mycobacterium tuberculosis followed 6 weeks later. INF-gamma assays should be considered as first line investigations in HIV-1 infected subjects when TB is a diagnostic possibility.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Andrianov, S N; Moiseev, S A

We propose a scheme of a quantum computer based on nanophotonic elements: two buses in the form of nanowaveguide resonators, two nanosized units of multiatom multiqubit quantum memory and a set of nanoprocessors in the form of photonic quantum transistors, each containing a pair of nanowaveguide ring resonators coupled via a quantum dot. The operation modes of nanoprocessor photonic quantum transistors are theoretically studied and the execution of main logical operations by means of them is demonstrated. We also discuss the prospects of the proposed nanophotonic quantum computer for operating in high-speed optical fibre networks. (quantum computations)

Inverted formin 2 in focal adhesions promotes dorsal stress fiber and fibrillar adhesion formation to drive extracellular matrix assembly

PubMed Central

Skau, Colleen T.; Plotnikov, Sergey V.; Doyle, Andrew D.; Waterman, Clare M.

2015-01-01

Actin filaments and integrin-based focal adhesions (FAs) form integrated systems that mediate dynamic cell interactions with their environment or other cells during migration, the immune response, and tissue morphogenesis. How adhesion-associated actin structures obtain their functional specificity is unclear. Here we show that the formin-family actin nucleator, inverted formin 2 (INF2), localizes specifically to FAs and dorsal stress fibers (SFs) in fibroblasts. High-resolution fluorescence microscopy and manipulation of INF2 levels in cells indicate that INF2 plays a critical role at the SF–FA junction by promoting actin polymerization via free barbed end generation and centripetal elongation of an FA-associated actin bundle to form dorsal SF. INF2 assembles into FAs during maturation rather than during their initial generation, and once there, acts to promote rapid FA elongation and maturation into tensin-containing fibrillar FAs in the cell center. We show that INF2 is required for fibroblasts to organize fibronectin into matrix fibers and ultimately 3D matrices. Collectively our results indicate an important role for the formin INF2 in specifying the function of fibrillar FAs through its ability to generate dorsal SFs. Thus, dorsal SFs and fibrillar FAs form a specific class of integrated adhesion-associated actin structure in fibroblasts that mediates generation and remodeling of ECM. PMID:25918420

Beyond Moore's law: towards competitive quantum devices

NASA Astrophysics Data System (ADS)

Troyer, Matthias

2015-05-01

A century after the invention of quantum theory and fifty years after Bell's inequality we see the first quantum devices emerge as products that aim to be competitive with the best classical computing devices. While a universal quantum computer of non-trivial size is still out of reach there exist a number commercial and experimental devices: quantum random number generators, quantum simulators and quantum annealers. In this colloquium I will present some of these devices and validation tests we performed on them. Quantum random number generators use the inherent randomness in quantum measurements to produce true random numbers, unlike classical pseudorandom number generators which are inherently deterministic. Optical lattice emulators use ultracold atomic gases in optical lattices to mimic typical models of condensed matter physics. In my talk I will focus especially on the devices built by Canadian company D-Wave systems, which are special purpose quantum simulators for solving hard classical optimization problems. I will review the controversy around the quantum nature of these devices and will compare them to state of the art classical algorithms. I will end with an outlook towards universal quantum computing and end with the question: which important problems that are intractable even for post-exa-scale classical computers could we expect to solve once we have a universal quantum computer?

Quantum simulation of quantum field theory using continuous variables

DOE PAGES

Marshall, Kevin; Pooser, Raphael C.; Siopsis, George; ...

2015-12-14

Much progress has been made in the field of quantum computing using continuous variables over the last couple of years. This includes the generation of extremely large entangled cluster states (10,000 modes, in fact) as well as a fault tolerant architecture. This has lead to the point that continuous-variable quantum computing can indeed be thought of as a viable alternative for universal quantum computing. With that in mind, we present a new algorithm for continuous-variable quantum computers which gives an exponential speedup over the best known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonicmore » quantum field theory, a problem that is known to be hard using a classical computer. Thus, we give an experimental implementation based on cluster states that is feasible with today's technology.« less

Quantum simulation of quantum field theory using continuous variables

DOE Office of Scientific and Technical Information (OSTI.GOV)

Marshall, Kevin; Pooser, Raphael C.; Siopsis, George

Much progress has been made in the field of quantum computing using continuous variables over the last couple of years. This includes the generation of extremely large entangled cluster states (10,000 modes, in fact) as well as a fault tolerant architecture. This has lead to the point that continuous-variable quantum computing can indeed be thought of as a viable alternative for universal quantum computing. With that in mind, we present a new algorithm for continuous-variable quantum computers which gives an exponential speedup over the best known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonicmore » quantum field theory, a problem that is known to be hard using a classical computer. Thus, we give an experimental implementation based on cluster states that is feasible with today's technology.« less

Gate sequence for continuous variable one-way quantum computation

PubMed Central

Su, Xiaolong; Hao, Shuhong; Deng, Xiaowei; Ma, Lingyu; Wang, Meihong; Jia, Xiaojun; Xie, Changde; Peng, Kunchi

2013-01-01

Measurement-based one-way quantum computation using cluster states as resources provides an efficient model to perform computation and information processing of quantum codes. Arbitrary Gaussian quantum computation can be implemented sufficiently by long single-mode and two-mode gate sequences. However, continuous variable gate sequences have not been realized so far due to an absence of cluster states larger than four submodes. Here we present the first continuous variable gate sequence consisting of a single-mode squeezing gate and a two-mode controlled-phase gate based on a six-mode cluster state. The quantum property of this gate sequence is confirmed by the fidelities and the quantum entanglement of two output modes, which depend on both the squeezing and controlled-phase gates. The experiment demonstrates the feasibility of implementing Gaussian quantum computation by means of accessible gate sequences.

Quantum Computer Games: Quantum Minesweeper

ERIC Educational Resources Information Center

Gordon, Michal; Gordon, Goren

2010-01-01

The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical…

Pseudorandom Number Generators for Mobile Devices: An Examination and Attempt to Improve Randomness

DTIC Science & Technology

2013-09-01

Notes in Computer Science (LNCS), Vol. 4341), (Hanoi, Vietnam: Springer, 2006), 260–270. 36 Simon R. Blackburn , “The Linear Complexity of the Self... Blackburn , Simon R. ‘The Linear Complexity of the Self-Shrinking Generator.” IEEE Trans. Inf. Theory, 45 (September 1999). Blum, Leonore, Manuel...afloat when the waters have been rough! xv THIS PAGE INTENTIONALLY LEFT BLANK xvi I. INTRODUCTION When the average man thinks about war and

49 CFR 176.2 - Definitions.

Code of Federal Regulations, 2012 CFR

2012-10-01

..., spillage, or other accident. INF cargo means packaged irradiated nuclear fuel, plutonium or high-level... Irradiated Nuclear Fuel, Plutonium and High-Level Radioactive Wastes on Board Ships” (INF Code) contained in...

Search for a Heavy Neutrino and Right-Handed W of the Left-Right Symmetric Model with Cms Detector

NASA Astrophysics Data System (ADS)

Tlisov, Danila

2013-11-01

This work describes the first search for signals from the production of right-handed WR bosons and heavy neutrinos Nℓ (ℓ = e, μ), that arise naturally in the left-right symmetric extension to the Standard Model, with the CMS Experiment at the LHC using the 7 TeV pp collision data collected in 2010 and 2011 corresponding to an integrated luminosity of 240 pb-1. No excess over expectations from Standard Model processes is observed. For models with exact left-right symmetry (the same coupling in the left and right sectors) we exclude the region in the two-dimensional parameter space that extends to (MWR, MNℓ) = (1700 GeV, 600 GeV).

MedEx/J: A One-Scan Simple and Fast NLP Tool for Japanese Clinical Texts.

PubMed

Aramaki, Eiji; Yano, Ken; Wakamiya, Shoko

2017-01-01

Because of recent replacement of physical documents with electronic medical records (EMR), the importance of information processing in the medical field has increased. In light of this trend, we have been developing MedEx/J, which retrieves important Japanese language information from medical reports. MedEx/J executes two tasks simultaneously: (1) term extraction, and (2) positive and negative event classification. We designate this approach as a one-scan approach, providing simplicity of systems and reasonable accuracy. MedEx/J performance on the two tasks is described herein: (1) term extraction (Fβ = 1 = 0.87) and (2) positive-negative classification (Fβ = 1 = 0.63). This paper also presents discussion and explains remaining issues in the medical natural language processing field.

Toward a superconducting quantum computer. Harnessing macroscopic quantum coherence.

PubMed

Tsai, Jaw-Shen

2010-01-01

Intensive research on the construction of superconducting quantum computers has produced numerous important achievements. The quantum bit (qubit), based on the Josephson junction, is at the heart of this research. This macroscopic system has the ability to control quantum coherence. This article reviews the current state of quantum computing as well as its history, and discusses its future. Although progress has been rapid, the field remains beset with unsolved issues, and there are still many new research opportunities open to physicists and engineers.

Novel Image Encryption based on Quantum Walks

PubMed Central

Yang, Yu-Guang; Pan, Qing-Xiang; Sun, Si-Jia; Xu, Peng

2015-01-01

Quantum computation has achieved a tremendous success during the last decades. In this paper, we investigate the potential application of a famous quantum computation model, i.e., quantum walks (QW) in image encryption. It is found that QW can serve as an excellent key generator thanks to its inherent nonlinear chaotic dynamic behavior. Furthermore, we construct a novel QW-based image encryption algorithm. Simulations and performance comparisons show that the proposal is secure enough for image encryption and outperforms prior works. It also opens the door towards introducing quantum computation into image encryption and promotes the convergence between quantum computation and image processing. PMID:25586889

Characterizing quantum supremacy in near-term devices

NASA Astrophysics Data System (ADS)

Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N.; Babbush, Ryan; Ding, Nan; Jiang, Zhang; Bremner, Michael J.; Martinis, John M.; Neven, Hartmut

2018-06-01

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of supercomputers. Such a demonstration of what is referred to as quantum supremacy requires a reliable evaluation of the resources required to solve tasks with classical approaches. Here, we propose the task of sampling from the output distribution of random quantum circuits as a demonstration of quantum supremacy. We extend previous results in computational complexity to argue that this sampling task must take exponential time in a classical computer. We introduce cross-entropy benchmarking to obtain the experimental fidelity of complex multiqubit dynamics. This can be estimated and extrapolated to give a success metric for a quantum supremacy demonstration. We study the computational cost of relevant classical algorithms and conclude that quantum supremacy can be achieved with circuits in a two-dimensional lattice of 7 × 7 qubits and around 40 clock cycles. This requires an error rate of around 0.5% for two-qubit gates (0.05% for one-qubit gates), and it would demonstrate the basic building blocks for a fault-tolerant quantum computer.

STIC: Photonic Quantum Computation through Cavity Assisted Interaction

DTIC Science & Technology

2007-12-28

PRA ; available as quant-ph/06060791. Report for the grant “Photonic Quantum Computation through Cavity Assisted Interaction” from DTO Luming Duan...cavity •B. Wang, L.-M. Duan, PRA 72 (in press, 2005) Single-photon source Photonic Quantum Computation through Cavity-Assisted Interaction H. Jeff Kimble...interaction [Duan, Wang, Kimble, PRA 05] • “Investigate more efficient methods for combating noise in photonic quantum computation ” • Partial progress

Robust Quantum Computing using Molecules with Switchable Dipole

DTIC Science & Technology

2010-06-15

REPORT Robust quantum computing using molecules with switchable dipole 14. ABSTRACT 16. SECURITY CLASSIFICATION OF: Of the many systems studied to...Research Office P.O. Box 12211 Research Triangle Park, NC 27709-2211 15. SUBJECT TERMS Ultracold polar molecules, quantum computing , phase gates...From - To) 30-Aug-2006 Standard Form 298 (Rev 8/98) Prescribed by ANSI Std. Z39.18 - 31-Aug-2009 Robust quantum computing using molecules with

Trapped-Ion Quantum Logic with Global Radiation Fields.

PubMed

Weidt, S; Randall, J; Webster, S C; Lake, K; Webb, A E; Cohen, I; Navickas, T; Lekitsch, B; Retzker, A; Hensinger, W K

2016-11-25

Trapped ions are a promising tool for building a large-scale quantum computer. However, the number of required radiation fields for the realization of quantum gates in any proposed ion-based architecture scales with the number of ions within the quantum computer, posing a major obstacle when imagining a device with millions of ions. Here, we present a fundamentally different approach for trapped-ion quantum computing where this detrimental scaling vanishes. The method is based on individually controlled voltages applied to each logic gate location to facilitate the actual gate operation analogous to a traditional transistor architecture within a classical computer processor. To demonstrate the key principle of this approach we implement a versatile quantum gate method based on long-wavelength radiation and use this method to generate a maximally entangled state of two quantum engineered clock qubits with fidelity 0.985(12). This quantum gate also constitutes a simple-to-implement tool for quantum metrology, sensing, and simulation.

Quantum Computing and Second Quantization

DOE PAGES

Makaruk, Hanna Ewa

2017-02-10

Quantum computers are by their nature many particle quantum systems. Both the many-particle arrangement and being quantum are necessary for the existence of the entangled states, which are responsible for the parallelism of the quantum computers. Second quantization is a very important approximate method of describing such systems. This lecture will present the general idea of the second quantization, and discuss shortly some of the most important formulations of second quantization.

Quantum Computing and Second Quantization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Makaruk, Hanna Ewa

Quantum computers are by their nature many particle quantum systems. Both the many-particle arrangement and being quantum are necessary for the existence of the entangled states, which are responsible for the parallelism of the quantum computers. Second quantization is a very important approximate method of describing such systems. This lecture will present the general idea of the second quantization, and discuss shortly some of the most important formulations of second quantization.

Numerical characteristics of quantum computer simulation

NASA Astrophysics Data System (ADS)

Chernyavskiy, A.; Khamitov, K.; Teplov, A.; Voevodin, V.; Voevodin, Vl.

2016-12-01

The simulation of quantum circuits is significantly important for the implementation of quantum information technologies. The main difficulty of such modeling is the exponential growth of dimensionality, thus the usage of modern high-performance parallel computations is relevant. As it is well known, arbitrary quantum computation in circuit model can be done by only single- and two-qubit gates, and we analyze the computational structure and properties of the simulation of such gates. We investigate the fact that the unique properties of quantum nature lead to the computational properties of the considered algorithms: the quantum parallelism make the simulation of quantum gates highly parallel, and on the other hand, quantum entanglement leads to the problem of computational locality during simulation. We use the methodology of the AlgoWiki project (algowiki-project.org) to analyze the algorithm. This methodology consists of theoretical (sequential and parallel complexity, macro structure, and visual informational graph) and experimental (locality and memory access, scalability and more specific dynamic characteristics) parts. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia). We show that the simulation of quantum gates is a good base for the research and testing of the development methods for data intense parallel software, and considered methodology of the analysis can be successfully used for the improvement of the algorithms in quantum information science.

Tribrid Inflation in Supergravity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Antusch, Stefan; Dutta, Koushik; Kostka, Philipp M.

2010-02-10

We propose a novel class of F-term hybrid inflation models in supergravity (SUGRA) where the eta-problem is resolved using either a Heisenberg symmetry or a shift symmetry of the Kaehler potential. In addition to the inflaton and the waterfall field, this class (referred to as tribrid inflation) contains a third 'driving' field which contributes the large vacuum energy during inflation by its F-term. In contrast to the 'standard' hybrid scenario, it has several attractive features due to the property of vanishing inflationary superpotential (W{sub inf} = 0) during inflation. While the symmetries of the Kaehler potential ensure a flat inflatonmore » potential at tree-level, quantum corrections induced by symmetry breaking terms in the superpotential generate a slope of the potential and lead to a spectral tilt consistent with recent WMAP observations.« less

Experimental Blind Quantum Computing for a Classical Client.

PubMed

Huang, He-Liang; Zhao, Qi; Ma, Xiongfeng; Liu, Chang; Su, Zu-En; Wang, Xi-Lin; Li, Li; Liu, Nai-Le; Sanders, Barry C; Lu, Chao-Yang; Pan, Jian-Wei

2017-08-04

To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our demonstration shows the feasibility of completely classical clients and thus is a key milestone towards secure cloud quantum computing.

Experimental Blind Quantum Computing for a Classical Client

NASA Astrophysics Data System (ADS)

Huang, He-Liang; Zhao, Qi; Ma, Xiongfeng; Liu, Chang; Su, Zu-En; Wang, Xi-Lin; Li, Li; Liu, Nai-Le; Sanders, Barry C.; Lu, Chao-Yang; Pan, Jian-Wei

2017-08-01

To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our demonstration shows the feasibility of completely classical clients and thus is a key milestone towards secure cloud quantum computing.

Mathematical Theory of Generalized Duality Quantum Computers Acting on Vector-States

NASA Astrophysics Data System (ADS)

Cao, Huai-Xin; Long, Gui-Lu; Guo, Zhi-Hua; Chen, Zheng-Li

2013-06-01

Following the idea of duality quantum computation, a generalized duality quantum computer (GDQC) acting on vector-states is defined as a tuple consisting of a generalized quantum wave divider (GQWD) and a finite number of unitary operators as well as a generalized quantum wave combiner (GQWC). It is proved that the GQWD and GQWC of a GDQC are an isometry and a co-isometry, respectively, and mutually dual. It is also proved that every GDQC gives a contraction, called a generalized duality quantum gate (GDQG). A classification of GDQCs is given and the properties of GDQGs are discussed. Some applications are obtained, including two orthogonal duality quantum computer algorithms for unsorted database search and an understanding of the Mach-Zehnder interferometer.

Semiquantum key distribution with secure delegated quantum computation

PubMed Central

Li, Qin; Chan, Wai Hong; Zhang, Shengyu

2016-01-01

Semiquantum key distribution allows a quantum party to share a random key with a “classical” party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who only needs the quantum ability to access quantum channels, by securely delegating quantum computation to a quantum server. We show the proposed protocol is robust even when the delegated quantum server is a powerful adversary, and is experimentally feasible with current technology. As one party of our protocol is the most quantum-resource efficient, it can be more practical and significantly widen the applicability scope of quantum key distribution. PMID:26813384

Parallel Photonic Quantum Computation Assisted by Quantum Dots in One-Side Optical Microcavities

PubMed Central

Luo, Ming-Xing; Wang, Xiaojun

2014-01-01

Universal quantum logic gates are important elements for a quantum computer. In contrast to previous constructions on one degree of freedom (DOF) of quantum systems, we investigate the possibility of parallel quantum computations dependent on two DOFs of photon systems. We construct deterministic hyper-controlled-not (hyper-CNOT) gates operating on the spatial-mode and the polarization DOFs of two-photon or one-photon systems by exploring the giant optical circular birefringence induced by quantum-dot spins in one-sided optical microcavities. These hyper-CNOT gates show that the quantum states of two DOFs can be viewed as independent qubits without requiring auxiliary DOFs in theory. This result can reduce the quantum resources by half for quantum applications with large qubit systems, such as the quantum Shor algorithm. PMID:25030424

Parallel photonic quantum computation assisted by quantum dots in one-side optical microcavities.

PubMed

Luo, Ming-Xing; Wang, Xiaojun

2014-07-17

Universal quantum logic gates are important elements for a quantum computer. In contrast to previous constructions on one degree of freedom (DOF) of quantum systems, we investigate the possibility of parallel quantum computations dependent on two DOFs of photon systems. We construct deterministic hyper-controlled-not (hyper-CNOT) gates operating on the spatial-mode and the polarization DOFs of two-photon or one-photon systems by exploring the giant optical circular birefringence induced by quantum-dot spins in one-sided optical microcavities. These hyper-CNOT gates show that the quantum states of two DOFs can be viewed as independent qubits without requiring auxiliary DOFs in theory. This result can reduce the quantum resources by half for quantum applications with large qubit systems, such as the quantum Shor algorithm.

Napoleon’s Cavalry: A Key Element to Decisive Victory

DTIC Science & Technology

2002-05-31

known for their “ panache , daring, and gallantry.”26 Napoleon’s cavalry enjoyed their effectiveness on the battlefield until 1813 when two important...thus rendering the Prussians helpless and in no position to bargain with the victor . Napoleon’s military victory, largely due to his pursuit, had...1813. Imperial Guard 30,000 Inf 8000 Cav 202 Guns II Corps Victor 17,241 Inf 55 Guns III Corps Souham 13,034 Inf 1065 Cav 61 Guns IV Corps Bertrand

Acausal measurement-based quantum computing

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki

2014-07-01

In measurement-based quantum computing, there is a natural "causal cone" among qubits of the resource state, since the measurement angle on a qubit has to depend on previous measurement results in order to correct the effect of by-product operators. If we respect the no-signaling principle, by-product operators cannot be avoided. Here we study the possibility of acausal measurement-based quantum computing by using the process matrix framework [Oreshkov, Costa, and Brukner, Nat. Commun. 3, 1092 (2012), 10.1038/ncomms2076]. We construct a resource process matrix for acausal measurement-based quantum computing restricting local operations to projective measurements. The resource process matrix is an analog of the resource state of the standard causal measurement-based quantum computing. We find that if we restrict local operations to projective measurements the resource process matrix is (up to a normalization factor and trivial ancilla qubits) equivalent to the decorated graph state created from the graph state of the corresponding causal measurement-based quantum computing. We also show that it is possible to consider a causal game whose causal inequality is violated by acausal measurement-based quantum computing.

Performing quantum computing experiments in the cloud

NASA Astrophysics Data System (ADS)

Devitt, Simon J.

2016-09-01

Quantum computing technology has reached a second renaissance in the past five years. Increased interest from both the private and public sector combined with extraordinary theoretical and experimental progress has solidified this technology as a major advancement in the 21st century. As anticipated my many, some of the first realizations of quantum computing technology has occured over the cloud, with users logging onto dedicated hardware over the classical internet. Recently, IBM has released the Quantum Experience, which allows users to access a five-qubit quantum processor. In this paper we take advantage of this online availability of actual quantum hardware and present four quantum information experiments. We utilize the IBM chip to realize protocols in quantum error correction, quantum arithmetic, quantum graph theory, and fault-tolerant quantum computation by accessing the device remotely through the cloud. While the results are subject to significant noise, the correct results are returned from the chip. This demonstrates the power of experimental groups opening up their technology to a wider audience and will hopefully allow for the next stage of development in quantum information technology.

Greenberger-Horne-Zeilinger states-based blind quantum computation with entanglement concentration.

PubMed

Zhang, Xiaoqian; Weng, Jian; Lu, Wei; Li, Xiaochun; Luo, Weiqi; Tan, Xiaoqing

2017-09-11

In blind quantum computation (BQC) protocol, the quantum computability of servers are complicated and powerful, while the clients are not. It is still a challenge for clients to delegate quantum computation to servers and keep the clients' inputs, outputs and algorithms private. Unfortunately, quantum channel noise is unavoidable in the practical transmission. In this paper, a novel BQC protocol based on maximally entangled Greenberger-Horne-Zeilinger (GHZ) states is proposed which doesn't need a trusted center. The protocol includes a client and two servers, where the client only needs to own quantum channels with two servers who have full-advantage quantum computers. Two servers perform entanglement concentration used to remove the noise, where the success probability can almost reach 100% in theory. But they learn nothing in the process of concentration because of the no-signaling principle, so this BQC protocol is secure and feasible.

From transistor to trapped-ion computers for quantum chemistry.

PubMed

Yung, M-H; Casanova, J; Mezzacapo, A; McClean, J; Lamata, L; Aspuru-Guzik, A; Solano, E

2014-01-07

Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology.

From transistor to trapped-ion computers for quantum chemistry

PubMed Central

Yung, M.-H.; Casanova, J.; Mezzacapo, A.; McClean, J.; Lamata, L.; Aspuru-Guzik, A.; Solano, E.

2014-01-01

Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology. PMID:24395054

Protecting Information

NASA Astrophysics Data System (ADS)

Loepp, Susan; Wootters, William K.

2006-09-01

For many everyday transmissions, it is essential to protect digital information from noise or eavesdropping. This undergraduate introduction to error correction and cryptography is unique in devoting several chapters to quantum cryptography and quantum computing, thus providing a context in which ideas from mathematics and physics meet. By covering such topics as Shor's quantum factoring algorithm, this text informs the reader about current thinking in quantum information theory and encourages an appreciation of the connections between mathematics and science.Of particular interest are the potential impacts of quantum physics:(i) a quantum computer, if built, could crack our currently used public-key cryptosystems; and (ii) quantum cryptography promises to provide an alternative to these cryptosystems, basing its security on the laws of nature rather than on computational complexity. No prior knowledge of quantum mechanics is assumed, but students should have a basic knowledge of complex numbers, vectors, and matrices. Accessible to readers familiar with matrix algebra, vector spaces and complex numbers First undergraduate text to cover cryptography, error-correction, and quantum computation together Features exercises designed to enhance understanding, including a number of computational problems, available from www.cambridge.org/9780521534765

Universal measurement-based quantum computation in two-dimensional symmetry-protected topological phases

NASA Astrophysics Data System (ADS)

Wei, Tzu-Chieh; Huang, Ching-Yu

2017-09-01

Recent progress in the characterization of gapped quantum phases has also triggered the search for a universal resource for quantum computation in symmetric gapped phases. Prior works in one dimension suggest that it is a feature more common than previously thought, in that nontrivial one-dimensional symmetry-protected topological (SPT) phases provide quantum computational power characterized by the algebraic structure defining these phases. Progress in two and higher dimensions so far has been limited to special fixed points. Here we provide two families of two-dimensional Z2 symmetric wave functions such that there exists a finite region of the parameter in the SPT phases that supports universal quantum computation. The quantum computational power appears to lose its universality at the boundary between the SPT and the symmetry-breaking phases.

Towards quantum chemistry on a quantum computer.

PubMed

Lanyon, B P; Whitfield, J D; Gillett, G G; Goggin, M E; Almeida, M P; Kassal, I; Biamonte, J D; Mohseni, M; Powell, B J; Barbieri, M; Aspuru-Guzik, A; White, A G

2010-02-01

Exact first-principles calculations of molecular properties are currently intractable because their computational cost grows exponentially with both the number of atoms and basis set size. A solution is to move to a radically different model of computing by building a quantum computer, which is a device that uses quantum systems themselves to store and process data. Here we report the application of the latest photonic quantum computer technology to calculate properties of the smallest molecular system: the hydrogen molecule in a minimal basis. We calculate the complete energy spectrum to 20 bits of precision and discuss how the technique can be expanded to solve large-scale chemical problems that lie beyond the reach of modern supercomputers. These results represent an early practical step toward a powerful tool with a broad range of quantum-chemical applications.

Surface Segregation Energies of BCC Binaries from Ab Initio and Quantum Approximate Calculations

NASA Technical Reports Server (NTRS)

Good, Brian S.

2003-01-01

We compare dilute-limit segregation energies for selected BCC transition metal binaries computed using ab initio and quantum approximate energy method. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent parameterization. Quantum approximate segregation energies are computed with and without atomistic relaxation. The ab initio calculations are performed without relaxation for the most part, but predicted relaxations from quantum approximate calculations are used in selected cases to compute approximate relaxed ab initio segregation energies. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with other quantum approximate and ab initio theoretical work, and available experimental results.

Universal Quantum Computing with Arbitrary Continuous-Variable Encoding.

PubMed

Lau, Hoi-Kwan; Plenio, Martin B

2016-09-02

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap tests. Our formalism inherits the advantages that the quantum information is decoupled from collective noise, and logical qubits with different encodings can be brought to interact without decoding. We also propose a possible implementation of the required operations by using interactions that are available in a variety of continuous-variable systems. Our work separates the "hardware" problem of engineering quantum-computing-universal interactions, from the "software" problem of designing encodings for specific purposes. The development of quantum computer architecture could hence be simplified.

Universal Quantum Computing with Arbitrary Continuous-Variable Encoding

NASA Astrophysics Data System (ADS)

Lau, Hoi-Kwan; Plenio, Martin B.

2016-09-01

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap tests. Our formalism inherits the advantages that the quantum information is decoupled from collective noise, and logical qubits with different encodings can be brought to interact without decoding. We also propose a possible implementation of the required operations by using interactions that are available in a variety of continuous-variable systems. Our work separates the "hardware" problem of engineering quantum-computing-universal interactions, from the "software" problem of designing encodings for specific purposes. The development of quantum computer architecture could hence be simplified.

Two-Dimensional Arrays of Neutral Atom Quantum Gates

DTIC Science & Technology

2012-10-20

Box 12211 Research Triangle Park, NC 27709-2211 15. SUBJECT TERMS quantum computing , Rydberg atoms, entanglement Mark Saffman University of...Nature Physics, (01 2009): 0. doi: 10.1038/nphys1178 10/19/2012 9.00 K. Mølmer, M. Saffman. Scaling the neutral-atom Rydberg gate quantum computer by...Saffman, E. Brion, K. Mølmer. Error Correction in Ensemble Registers for Quantum Repeaters and Quantum Computers , Physical Review Letters, (3 2008): 0

QUANTUM COMPUTING: Quantum Entangled Bits Step Closer to IT.

PubMed

Zeilinger, A

2000-07-21

In contrast to today's computers, quantum computers and information technologies may in future be able to store and transmit information not only in the state "0" or "1," but also in superpositions of the two; information will then be stored and transmitted in entangled quantum states. Zeilinger discusses recent advances toward using this principle for quantum cryptography and highlights studies into the entanglement (or controlled superposition) of several photons, atoms, or ions.

Integrated Visible Photonics for Trapped-Ion Quantum Computing

DTIC Science & Technology

2017-06-10

necessarily reflect the views of the Department of Defense. Abstract- A scalable trapped-ion-based quantum - computing architecture requires the... Quantum Computing Dave Kharas, Cheryl Sorace-Agaskar, Suraj Bramhavar, William Loh, Jeremy M. Sage, Paul W. Juodawlkis, and John...coherence times, strong coulomb interactions, and optical addressability, hold great promise for implementation of practical quantum information

Algorithms Bridging Quantum Computation and Chemistry

NASA Astrophysics Data System (ADS)

McClean, Jarrod Ryan

The design of new materials and chemicals derived entirely from computation has long been a goal of computational chemistry, and the governing equation whose solution would permit this dream is known. Unfortunately, the exact solution to this equation has been far too expensive and clever approximations fail in critical situations. Quantum computers offer a novel solution to this problem. In this work, we develop not only new algorithms to use quantum computers to study hard problems in chemistry, but also explore how such algorithms can help us to better understand and improve our traditional approaches. In particular, we first introduce a new method, the variational quantum eigensolver, which is designed to maximally utilize the quantum resources available in a device to solve chemical problems. We apply this method in a real quantum photonic device in the lab to study the dissociation of the helium hydride (HeH+) molecule. We also enhance this methodology with architecture specific optimizations on ion trap computers and show how linear-scaling techniques from traditional quantum chemistry can be used to improve the outlook of similar algorithms on quantum computers. We then show how studying quantum algorithms such as these can be used to understand and enhance the development of classical algorithms. In particular we use a tool from adiabatic quantum computation, Feynman's Clock, to develop a new discrete time variational principle and further establish a connection between real-time quantum dynamics and ground state eigenvalue problems. We use these tools to develop two novel parallel-in-time quantum algorithms that outperform competitive algorithms as well as offer new insights into the connection between the fermion sign problem of ground states and the dynamical sign problem of quantum dynamics. Finally we use insights gained in the study of quantum circuits to explore a general notion of sparsity in many-body quantum systems. In particular we use developments from the field of compressed sensing to find compact representations of ground states. As an application we study electronic systems and find solutions dramatically more compact than traditional configuration interaction expansions, offering hope to extend this methodology to challenging systems in chemical and material design.

Models of optical quantum computing

NASA Astrophysics Data System (ADS)

Krovi, Hari

2017-03-01

I review some work on models of quantum computing, optical implementations of these models, as well as the associated computational power. In particular, we discuss the circuit model and cluster state implementations using quantum optics with various encodings such as dual rail encoding, Gottesman-Kitaev-Preskill encoding, and coherent state encoding. Then we discuss intermediate models of optical computing such as boson sampling and its variants. Finally, we review some recent work in optical implementations of adiabatic quantum computing and analog optical computing. We also provide a brief description of the relevant aspects from complexity theory needed to understand the results surveyed.

On the 'principle of the quantumness', the quantumness of Relativity, and the computational grand-unification

DOE Office of Scientific and Technical Information (OSTI.GOV)

D'Ariano, Giacomo Mauro

2010-05-04

I will argue that the proposal of establishing operational foundations of Quantum Theory should have top-priority, and that the Lucien Hardy's program on Quantum Gravity should be paralleled by an analogous program on Quantum Field Theory (QFT), which needs to be reformulated, notwithstanding its experimental success. In this paper, after reviewing recently suggested operational 'principles of the quantumness', I address the problem on whether Quantum Theory and Special Relativity are unrelated theories, or instead, if the one implies the other. I show how Special Relativity can be indeed derived from causality of Quantum Theory, within the computational paradigm 'the universemore » is a huge quantum computer', reformulating QFT as a Quantum-Computational Field Theory (QCFT). In QCFT Special Relativity emerges from the fabric of the computational network, which also naturally embeds gauge invariance. In this scheme even the quantization rule and the Planck constant can in principle be derived as emergent from the underlying causal tapestry of space-time. In this way Quantum Theory remains the only theory operating the huge computer of the universe.Is the computational paradigm only a speculative tautology (theory as simulation of reality), or does it have a scientific value? The answer will come from Occam's razor, depending on the mathematical simplicity of QCFT. Here I will just start scratching the surface of QCFT, analyzing simple field theories, including Dirac's. The number of problems and unmotivated recipes that plague QFT strongly motivates us to undertake the QCFT project, since QCFT makes all such problems manifest, and forces a re-foundation of QFT.« less

Ancilla-driven quantum computation for qudits and continuous variables

NASA Astrophysics Data System (ADS)

Proctor, Timothy; Giulian, Melissa; Korolkova, Natalia; Andersson, Erika; Kendon, Viv

2017-05-01

Although qubits are the leading candidate for the basic elements in a quantum computer, there are also a range of reasons to consider using higher-dimensional qudits or quantum continuous variables (QCVs). In this paper, we use a general "quantum variable" formalism to propose a method of quantum computation in which ancillas are used to mediate gates on a well-isolated "quantum memory" register and which may be applied to the setting of qubits, qudits (for d >2 ), or QCVs. More specifically, we present a model in which universal quantum computation may be implemented on a register using only repeated applications of a single fixed two-body ancilla-register interaction gate, ancillas prepared in a single state, and local measurements of these ancillas. In order to maintain determinism in the computation, adaptive measurements via a classical feed forward of measurement outcomes are used, with the method similar to that in measurement-based quantum computation (MBQC). We show that our model has the same hybrid quantum-classical processing advantages as MBQC, including the power to implement any Clifford circuit in essentially one layer of quantum computation. In some physical settings, high-quality measurements of the ancillas may be highly challenging or not possible, and hence we also present a globally unitary model which replaces the need for measurements of the ancillas with the requirement for ancillas to be prepared in states from a fixed orthonormal basis. Finally, we discuss settings in which these models may be of practical interest.

Research on Quantum Authentication Methods for the Secure Access Control Among Three Elements of Cloud Computing

NASA Astrophysics Data System (ADS)

Dong, Yumin; Xiao, Shufen; Ma, Hongyang; Chen, Libo

2016-12-01

Cloud computing and big data have become the developing engine of current information technology (IT) as a result of the rapid development of IT. However, security protection has become increasingly important for cloud computing and big data, and has become a problem that must be solved to develop cloud computing. The theft of identity authentication information remains a serious threat to the security of cloud computing. In this process, attackers intrude into cloud computing services through identity authentication information, thereby threatening the security of data from multiple perspectives. Therefore, this study proposes a model for cloud computing protection and management based on quantum authentication, introduces the principle of quantum authentication, and deduces the quantum authentication process. In theory, quantum authentication technology can be applied in cloud computing for security protection. This technology cannot be cloned; thus, it is more secure and reliable than classical methods.

Digitized adiabatic quantum computing with a superconducting circuit.

PubMed

Barends, R; Shabani, A; Lamata, L; Kelly, J; Mezzacapo, A; Las Heras, U; Babbush, R; Fowler, A G; Campbell, B; Chen, Yu; Chen, Z; Chiaro, B; Dunsworth, A; Jeffrey, E; Lucero, E; Megrant, A; Mutus, J Y; Neeley, M; Neill, C; O'Malley, P J J; Quintana, C; Roushan, P; Sank, D; Vainsencher, A; Wenner, J; White, T C; Solano, E; Neven, H; Martinis, John M

2016-06-09

Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.

Quantum market games: implementing tactics via measurements

NASA Astrophysics Data System (ADS)

Pakula, I.; Piotrowski, E. W.; Sladkowski, J.

2006-02-01

A major development in applying quantum mechanical formalism to various fields has been made during the last few years. Quantum counterparts of Game Theory, Economy, as well as diverse approaches to Quantum Information Theory have been found and currently are being explored. Using connections between Quantum Game Theory and Quantum Computations, an application of the universality of a measurement based computation in Quantum Market Theory is presented.

INF and IAEA: A comparative analysis of verification strategy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Scheinman, L.; Kratzer, M.

1992-07-01

This is the final report of a study on the relevance and possible lessons of Intermediate Range Nuclear Force (INF) verification to the International Atomic Energy Agency (IAEA) international safeguards activities.

Benchmarking gate-based quantum computers

NASA Astrophysics Data System (ADS)

Michielsen, Kristel; Nocon, Madita; Willsch, Dennis; Jin, Fengping; Lippert, Thomas; De Raedt, Hans

2017-11-01

With the advent of public access to small gate-based quantum processors, it becomes necessary to develop a benchmarking methodology such that independent researchers can validate the operation of these processors. We explore the usefulness of a number of simple quantum circuits as benchmarks for gate-based quantum computing devices and show that circuits performing identity operations are very simple, scalable and sensitive to gate errors and are therefore very well suited for this task. We illustrate the procedure by presenting benchmark results for the IBM Quantum Experience, a cloud-based platform for gate-based quantum computing.

Studies of the 4-JET Rate and of Moments of Event Shape Observables Using Jade Data

NASA Astrophysics Data System (ADS)

Kluth, S.

2005-04-01

Data from e+e- annihilation into hadrons collected by the JADE experiment at centre-of-mass energies between 14 and 44 GeV were used to study the 4-jet rate using the Durham algorithm as well as the first five moments of event shape observables. The data were compared with NLO QCD predictions, augmented by resummed NLLA calculations for the 4-jet rate, in order to extract values of the strong coupling constant αS. The preliminary results are αS(MZ0) = 0.1169 ± 0.0026 (4-jet rate) and αS(MZ0) = 0.1286 ± 0.0072 (moments) consistent with the world average value. For some of the higher moments systematic deficiencies of the QCD predictions are observed.

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

NASA Astrophysics Data System (ADS)

Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

2016-01-01

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

PubMed Central

Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

2016-01-01

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information. PMID:26823196

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption.

PubMed

Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

2016-01-29

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.

Development and calibration of the shielded measurement system for fissile contents measurements on irradiated nuclear fuel in dry storage.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mosby, W. R.; Jensen, B. A.

2002-05-31

In recent years there has been a trend towards storage of Irradiated Nuclear Fuel (INF) in dry conditions rather than in underwater environments. At the same time, the Department of Energy (DOE) has begun encouraging custodians of INF to perform measurements on INF for which no recent fissile contents measurement data exists. INF, in the form of spent fuel from Experimental Breeder Reactor 2 (EBR-II), has been stored in close-fitting, dry underground storage locations at the Radioactive Scrap and Waste Facility (RSWF) at Argonne National Laboratory-West (ANL-W) for many years. In Fiscal Year 2000, funding was obtained from the DOEmore » Office of Safeguards and Security Technology Development Program to develop and prepare for deployment a Shielded Measurement System (SMS) to perform fissile content measurements on INF stored in the RSWF. The SMS is equipped to lift an INF item out of its storage location, perform scanning neutron coincidence and high-resolution gamma-ray measurements, and restore the item to its storage location. The neutron and gamma-ray measurement results are compared to predictions based on isotope depletion and Monte Carlo neutral-particle transport models to provide confirmation of the accuracy of the models and hence of the fissile material contents of the item as calculated by the same models. This paper describes the SMS and discusses the results of the first calibration and validation measurements performed with the SMS.« less

Procedural Quantum Programming

NASA Astrophysics Data System (ADS)

Ömer, Bernhard

2002-09-01

While classical computing science has developed a variety of methods and programming languages around the concept of the universal computer, the typical description of quantum algorithms still uses a purely mathematical, non-constructive formalism which makes no difference between a hydrogen atom and a quantum computer. This paper investigates, how the concept of procedural programming languages, the most widely used classical formalism for describing and implementing algorithms, can be adopted to the field of quantum computing, and how non-classical features like the reversibility of unitary transformations, the non-observability of quantum states or the lack of copy and erase operations can be reflected semantically. It introduces the key concepts of procedural quantum programming (hybrid target architecture, operator hierarchy, quantum data types, memory management, etc.) and presents the experimental language QCL, which implements these principles.

The Quantum Human Computer (QHC) Hypothesis

ERIC Educational Resources Information Center

Salmani-Nodoushan, Mohammad Ali

2008-01-01

This article attempts to suggest the existence of a human computer called Quantum Human Computer (QHC) on the basis of an analogy between human beings and computers. To date, there are two types of computers: Binary and Quantum. The former operates on the basis of binary logic where an object is said to exist in either of the two states of 1 and…

Performance Models for Split-execution Computing Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S; McCaskey, Alex; Schrock, Jonathan

Split-execution computing leverages the capabilities of multiple computational models to solve problems, but splitting program execution across different computational models incurs costs associated with the translation between domains. We analyze the performance of a split-execution computing system developed from conventional and quantum processing units (QPUs) by using behavioral models that track resource usage. We focus on asymmetric processing models built using conventional CPUs and a family of special-purpose QPUs that employ quantum computing principles. Our performance models account for the translation of a classical optimization problem into the physical representation required by the quantum processor while also accounting for hardwaremore » limitations and conventional processor speed and memory. We conclude that the bottleneck in this split-execution computing system lies at the quantum-classical interface and that the primary time cost is independent of quantum processor behavior.« less

QM Automata: A New Class of Restricted Quantum Membrane Automata.

PubMed

Giannakis, Konstantinos; Singh, Alexandros; Kastampolidou, Kalliopi; Papalitsas, Christos; Andronikos, Theodore

2017-01-01

The term "Unconventional Computing" describes the use of non-standard methods and models in computing. It is a recently established field, with many interesting and promising results. In this work we combine notions from quantum computing with aspects of membrane computing to define what we call QM automata. Specifically, we introduce a variant of quantum membrane automata that operate in accordance with the principles of quantum computing. We explore the functionality and capabilities of the QM automata through indicative examples. Finally we suggest future directions for research on QM automata.

Secure Multiparty Quantum Computation for Summation and Multiplication.

PubMed

Shi, Run-hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2016-01-21

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.

Secure Multiparty Quantum Computation for Summation and Multiplication

PubMed Central

Shi, Run-hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2016-01-01

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics. PMID:26792197

Experimental quantum computing to solve systems of linear equations.

PubMed

Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei

2013-06-07

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.

Multi-party Semi-quantum Key Agreement with Delegating Quantum Computation

NASA Astrophysics Data System (ADS)

Liu, Wen-Jie; Chen, Zhen-Yu; Ji, Sai; Wang, Hai-Bin; Zhang, Jun

2017-10-01

A multi-party semi-quantum key agreement (SQKA) protocol based on delegating quantum computation (DQC) model is proposed by taking Bell states as quantum resources. In the proposed protocol, the participants only need the ability of accessing quantum channel and preparing single photons {|0〉, |1〉, |+〉, |-〉}, while the complicated quantum operations, such as the unitary operations and Bell measurement, will be delegated to the remote quantum center. Compared with previous quantum key agreement protocols, this client-server model is more feasible in the early days of the emergence of quantum computers. In order to prevent the attacks from outside eavesdroppers, inner participants and quantum center, two single photon sequences are randomly inserted into Bell states: the first sequence is used to perform the quantum channel detection, while the second is applied to disorder the positions of message qubits, which guarantees the security of the protocol.

Adiabatic Quantum Computation: Coherent Control Back Action.

PubMed

Goswami, Debabrata

2006-11-22

Though attractive from scalability aspects, optical approaches to quantum computing are highly prone to decoherence and rapid population loss due to nonradiative processes such as vibrational redistribution. We show that such effects can be reduced by adiabatic coherent control, in which quantum interference between multiple excitation pathways is used to cancel coupling to the unwanted, non-radiative channels. We focus on experimentally demonstrated adiabatic controlled population transfer experiments wherein the details on the coherence aspects are yet to be explored theoretically but are important for quantum computation. Such quantum computing schemes also form a back-action connection to coherent control developments.

Enhanced fault-tolerant quantum computing in d-level systems.

PubMed

Campbell, Earl T

2014-12-05

Error-correcting codes protect quantum information and form the basis of fault-tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transversal non-Clifford gate. Codes with the desired property are presented for d-level qudit systems with prime d. The codes use n=d-1 qudits and can detect up to ∼d/3 errors. We quantify the performance of these codes for one approach to quantum computation known as magic-state distillation. Unlike prior work, we find performance is always enhanced by increasing d.

Heats of Segregation of BCC Binaries from Ab Initio and Quantum Approximate Calculations

NASA Technical Reports Server (NTRS)

Good, Brian S.

2003-01-01

We compare dilute-limit segregation energies for selected BCC transition metal binaries computed using ab initio and quantum approximate energy methods. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent parameters. Quantum approximate segregation energies are computed with and without atomistic relaxation. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with full-potential quantum calculations and with available experimental results.

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Shi, Ronghua; Ding, Wanting; Shi, Jinjing

2018-03-01

A novel arbitrated quantum signature (AQS) scheme is proposed motivated by the Hamiltonian algorithm (HA) and blind quantum computation (BQC). The generation and verification of signature algorithm is designed based on HA, which enables the scheme to rely less on computational complexity. It is unnecessary to recover original messages when verifying signatures since the blind quantum computation is applied, which can improve the simplicity and operability of our scheme. It is proved that the scheme can be deployed securely, and the extended AQS has some extensive applications in E-payment system, E-government, E-business, etc.

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Shi, Ronghua; Ding, Wanting; Shi, Jinjing

2018-07-01

A novel arbitrated quantum signature (AQS) scheme is proposed motivated by the Hamiltonian algorithm (HA) and blind quantum computation (BQC). The generation and verification of signature algorithm is designed based on HA, which enables the scheme to rely less on computational complexity. It is unnecessary to recover original messages when verifying signatures since the blind quantum computation is applied, which can improve the simplicity and operability of our scheme. It is proved that the scheme can be deployed securely, and the extended AQS has some extensive applications in E-payment system, E-government, E-business, etc.

An Integrated Development Environment for Adiabatic Quantum Programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S; McCaskey, Alex; Bennink, Ryan S

2014-01-01

Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware raises the question of how well quantum programs perform. Benchmarking behavior is challenging since the multiple steps to synthesize an adiabatic quantum program are highly tunable. We present an adiabatic quantum programming environment called JADE that provides control over all the steps taken during program development. JADE captures the workflow needed to rigorously benchmark performance while also allowing a variety of problem types, programming techniques, and processor configurations. We have also integrated JADE with a quantum simulation enginemore » that enables program profiling using numerical calculation. The computational engine supports plug-ins for simulation methodologies tailored to various metrics and computing resources. We present the design, integration, and deployment of JADE and discuss its use for benchmarking adiabatic quantum programs.« less

Defects in Quantum Computers

DOE PAGES

Gardas, Bartłomiej; Dziarmaga, Jacek; Zurek, Wojciech H.; ...

2018-03-14

The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we propose such a test based on an exactly solvable many body system–the quantum Ising chain in transverse field–and implement it on the D-Wave machine. An ideal adiabatic quench of the quantum Ising chain should lead to an ordered broken symmetry ground state with all spins aligned in the same direction. An actual quench can be imperfect due to decoherence, noise, flaws inmore » the implemented Hamiltonian, or simply too fast to be adiabatic. Imperfections result in topological defects: Spins change orientation, kinks punctuating ordered sections of the chain. Therefore, the number of such defects quantifies the extent by which the quantum computer misses the ground state, and is imperfect.« less

Exploiting Quantum Resonance to Solve Combinatorial Problems

NASA Technical Reports Server (NTRS)

Zak, Michail; Fijany, Amir

2006-01-01

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

Defects in Quantum Computers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gardas, Bartłomiej; Dziarmaga, Jacek; Zurek, Wojciech H.

The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we propose such a test based on an exactly solvable many body system–the quantum Ising chain in transverse field–and implement it on the D-Wave machine. An ideal adiabatic quench of the quantum Ising chain should lead to an ordered broken symmetry ground state with all spins aligned in the same direction. An actual quench can be imperfect due to decoherence, noise, flaws inmore » the implemented Hamiltonian, or simply too fast to be adiabatic. Imperfections result in topological defects: Spins change orientation, kinks punctuating ordered sections of the chain. Therefore, the number of such defects quantifies the extent by which the quantum computer misses the ground state, and is imperfect.« less

Quantum and classical dynamics in adiabatic computation

NASA Astrophysics Data System (ADS)

Crowley, P. J. D.; Äńurić, T.; Vinci, W.; Warburton, P. A.; Green, A. G.

2014-10-01

Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialized state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible. Moreover, a judicious choice of final Hamiltonian whose ground state encodes the solution to a problem allows adiabatic transport to be used for universal quantum computation. However, the dephasing effects of the environment limit the quantum correlations that an open system can support and degrade the power of such adiabatic computation. We quantify this effect by allowing the system to evolve over a restricted set of quantum states, providing a link between physically inspired classical optimization algorithms and quantum adiabatic optimization. This perspective allows us to develop benchmarks to bound the quantum correlations harnessed by an adiabatic computation. We apply these to the D-Wave Vesuvius machine with revealing—though inconclusive—results.

Quantum Computing since Democritus

NASA Astrophysics Data System (ADS)

Aaronson, Scott

2013-03-01

1. Atoms and the void; 2. Sets; 3. Gödel, Turing, and friends; 4. Minds and machines; 5. Paleocomplexity; 6. P, NP, and friends; 7. Randomness; 8. Crypto; 9. Quantum; 10. Quantum computing; 11. Penrose; 12. Decoherence and hidden variables; 13. Proofs; 14. How big are quantum states?; 15. Skepticism of quantum computing; 16. Learning; 17. Interactive proofs and more; 18. Fun with the Anthropic Principle; 19. Free will; 20. Time travel; 21. Cosmology and complexity; 22. Ask me anything.

Quantum computing with incoherent resources and quantum jumps.

PubMed

Santos, M F; Cunha, M Terra; Chaves, R; Carvalho, A R R

2012-04-27

Spontaneous emission and the inelastic scattering of photons are two natural processes usually associated with decoherence and the reduction in the capacity to process quantum information. Here we show that, when suitably detected, these photons are sufficient to build all the fundamental blocks needed to perform quantum computation in the emitting qubits while protecting them from deleterious dissipative effects. We exemplify this by showing how to efficiently prepare graph states for the implementation of measurement-based quantum computation.

Optimal subsystem approach to multi-qubit quantum state discrimination and experimental investigation

NASA Astrophysics Data System (ADS)

Xue, ShiChuan; Wu, JunJie; Xu, Ping; Yang, XueJun

2018-02-01

Quantum computing is a significant computing capability which is superior to classical computing because of its superposition feature. Distinguishing several quantum states from quantum algorithm outputs is often a vital computational task. In most cases, the quantum states tend to be non-orthogonal due to superposition; quantum mechanics has proved that perfect outcomes could not be achieved by measurements, forcing repetitive measurement. Hence, it is important to determine the optimum measuring method which requires fewer repetitions and a lower error rate. However, extending current measurement approaches mainly aiming at quantum cryptography to multi-qubit situations for quantum computing confronts challenges, such as conducting global operations which has considerable costs in the experimental realm. Therefore, in this study, we have proposed an optimum subsystem method to avoid these difficulties. We have provided an analysis of the comparison between the reduced subsystem method and the global minimum error method for two-qubit problems; the conclusions have been verified experimentally. The results showed that the subsystem method could effectively discriminate non-orthogonal two-qubit states, such as separable states, entangled pure states, and mixed states; the cost of the experimental process had been significantly reduced, in most circumstances, with acceptable error rate. We believe the optimal subsystem method is the most valuable and promising approach for multi-qubit quantum computing applications.

Introduction to Quantum Intelligence

NASA Technical Reports Server (NTRS)

Zak, Michail

1996-01-01

An impact of ideas associated with the concept of a hypothetical quantum computer upon classical computing is analyzed. Two fundamental properties of quantum computing: direct simulations of probabilities, and influence between different branches of probabilistic scenarios, as well as their classical versions, are discussed.

Safety Evaluation of Turmeric Polysaccharide Extract: Assessment of Mutagenicity and Acute Oral Toxicity

PubMed Central

Velusami, Chandrasekaran Chinampudur; Boddapati, Srinivasa Rao; Hongasandra Srinivasa, Srikanth; Richard, Edwin Jothie; Balasubramanian, Murali

2013-01-01

Curcuma longa Linn. (Zingiberaceae) commonly known as turmeric has long been used for centuries as a spice and household remedy. The present study was carried out to assess the possible mutagenic potential and acute oral toxicity of polysaccharide extract of turmeric rhizome (NR-INF-02) using standard tests. The standard battery of in vitro genotoxicity tests, bacterial reverse mutation test (BRMT), chromosome aberration (CA), and micronucleus (MN) tests were employed to assess the possible mutagenic activity of NR-INF-02 (Turmacin). The results showed no mutagenic effect with NR-INF-02 up to a dose of 5000 µg/mL in BRMT. The results on CA and MN tests revealed the non clastogenic activity of NR-INF-02 in a dose range of 250.36 to 2500 µg/mL with and without metabolic activation (S9). In acute oral toxicity study, NR-INF-02 was found to be safe up to 5 g/kg body weight in Wistar rats. Overall, results indicated that polysaccharide extract of C. longa was found to be genotoxically safe and also exhibited maximum tolerable dose of more than 5 g/kg rat body weight. PMID:24455673

Duality quantum algorithm efficiently simulates open quantum systems

PubMed Central

Wei, Shi-Jie; Ruan, Dong; Long, Gui-Lu

2016-01-01

Because of inevitable coupling with the environment, nearly all practical quantum systems are open system, where the evolution is not necessarily unitary. In this paper, we propose a duality quantum algorithm for simulating Hamiltonian evolution of an open quantum system. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality quantum algorithm, the time evolution of the open quantum system is realized by using Kraus operators which is naturally implemented in duality quantum computer. This duality quantum algorithm has two distinct advantages compared to existing quantum simulation algorithms with unitary evolution operations. Firstly, the query complexity of the algorithm is O(d3) in contrast to O(d4) in existing unitary simulation algorithm, where d is the dimension of the open quantum system. Secondly, By using a truncated Taylor series of the evolution operators, this duality quantum algorithm provides an exponential improvement in precision compared with previous unitary simulation algorithm. PMID:27464855

ProjectQ Software Framework

NASA Astrophysics Data System (ADS)

Steiger, Damian S.; Haener, Thomas; Troyer, Matthias

Quantum computers promise to transform our notions of computation by offering a completely new paradigm. A high level quantum programming language and optimizing compilers are essential components to achieve scalable quantum computation. In order to address this, we introduce the ProjectQ software framework - an open source effort to support both theorists and experimentalists by providing intuitive tools to implement and run quantum algorithms. Here, we present our ProjectQ quantum compiler, which compiles a quantum algorithm from our high-level Python-embedded language down to low-level quantum gates available on the target system. We demonstrate how this compiler can be used to control actual hardware and to run high-performance simulations.

Continuous-variable quantum computing in optical time-frequency modes using quantum memories.

PubMed

Humphreys, Peter C; Kolthammer, W Steven; Nunn, Joshua; Barbieri, Marco; Datta, Animesh; Walmsley, Ian A

2014-09-26

We develop a scheme for time-frequency encoded continuous-variable cluster-state quantum computing using quantum memories. In particular, we propose a method to produce, manipulate, and measure two-dimensional cluster states in a single spatial mode by exploiting the intrinsic time-frequency selectivity of Raman quantum memories. Time-frequency encoding enables the scheme to be extremely compact, requiring a number of memories that are a linear function of only the number of different frequencies in which the computational state is encoded, independent of its temporal duration. We therefore show that quantum memories can be a powerful component for scalable photonic quantum information processing architectures.

INF and IAEA: A comparative analysis of verification strategy. [Final report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Scheinman, L.; Kratzer, M.

1992-07-01

This is the final report of a study on the relevance and possible lessons of Intermediate Range Nuclear Force (INF) verification to the International Atomic Energy Agency (IAEA) international safeguards activities.

Superadiabatic holonomic quantum computation in cavity QED

NASA Astrophysics Data System (ADS)

Liu, Bao-Jie; Huang, Zhen-Hua; Xue, Zheng-Yuan; Zhang, Xin-Ding

2017-06-01

Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition requires that the process be very slow and thus limits its application in quantum computation, where quantum gates are preferred to be fast due to the limited coherent times of the quantum systems. Here, we propose a feasible scheme to implement universal holonomic quantum computation based on non-Abelian geometric phases with superadiabatic quantum control, where the adiabatic manipulation is sped up while retaining its robustness against errors in the timing control. Consolidating the advantages of both strategies, our proposal is thus both robust and fast. The cavity QED system is adopted as a typical example to illustrate the merits where the proposed scheme can be realized in a tripod configuration by appropriately controlling the pulse shapes and their relative strength. To demonstrate the distinct performance of our proposal, we also compare our scheme with the conventional adiabatic strategy.

Towards topological quantum computer

NASA Astrophysics Data System (ADS)

Melnikov, D.; Mironov, A.; Mironov, S.; Morozov, A.; Morozov, An.

2018-01-01

Quantum R-matrices, the entangling deformations of non-entangling (classical) permutations, provide a distinguished basis in the space of unitary evolutions and, consequently, a natural choice for a minimal set of basic operations (universal gates) for quantum computation. Yet they play a special role in group theory, integrable systems and modern theory of non-perturbative calculations in quantum field and string theory. Despite recent developments in those fields the idea of topological quantum computing and use of R-matrices, in particular, practically reduce to reinterpretation of standard sets of quantum gates, and subsequently algorithms, in terms of available topological ones. In this paper we summarize a modern view on quantum R-matrix calculus and propose to look at the R-matrices acting in the space of irreducible representations, which are unitary for the real-valued couplings in Chern-Simons theory, as the fundamental set of universal gates for topological quantum computer. Such an approach calls for a more thorough investigation of the relation between topological invariants of knots and quantum algorithms.

Quantum robots plus environments.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benioff, P.

1998-07-23

A quantum robot is a mobile quantum system, including an on board quantum computer and needed ancillary systems, that interacts with an environment of quantum systems. Quantum robots carry out tasks whose goals include making specified changes in the state of the environment or carrying out measurements on the environment. The environments considered so far, oracles, data bases, and quantum registers, are seen to be special cases of environments considered here. It is also seen that a quantum robot should include a quantum computer and cannot be simply a multistate head. A model of quantum robots and their interactions ismore » discussed in which each task, as a sequence of alternating computation and action phases,is described by a unitary single time step operator T {approx} T{sub a} + T{sub c} (discrete space and time are assumed). The overall system dynamics is described as a sum over paths of completed computation (T{sub c}) and action (T{sub a}) phases. A simple example of a task, measuring the distance between the quantum robot and a particle on a 1D lattice with quantum phase path dispersion present, is analyzed. A decision diagram for the task is presented and analyzed.« less

Senate and INF ratification

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jones, D.T.

1992-11-16

The Intermediate-Range Nuclear Forces (INF) Treaty represented one of the first major accomplishments of the post-cold war era. In contrast to all arms control agreements which preceded it, INF resulted in the elimination of a whole category of weapons systems. The author describes and analyzes many issues which impinged on the Senate ratification process and stimulated intense political debate. In addition to national and international security questions, these issues involved constitutional, political, jurisdictional, and bureaucratic factors. The author concludes with lessons and recommendations for more expeditious ratification for future agreements.

Statistical Analysis to Develop a Three-Dimensional Surface Model of a Midsize-Male Foot

DTIC Science & Technology

2013-10-31

alignment  of  the  landmarks  was  conducted  to  remove  differences  in   posture,  particularly   rotation  about  the...edge of long underwear cuff at midline of ankle 59 9 CuffInfEdge_MalleolusLateral Interior edge of long underwear cuff superior to lateral malleolus...60 0 CuffInfEdge_AnkleMidline_Posterior Posterior-inferior edge of long underwear cuff at midline of ankle 61 1 CuffInfEdge_MalleolusMedial Interior

Control aspects of quantum computing using pure and mixed states.

PubMed

Schulte-Herbrüggen, Thomas; Marx, Raimund; Fahmy, Amr; Kauffman, Louis; Lomonaco, Samuel; Khaneja, Navin; Glaser, Steffen J

2012-10-13

Steering quantum dynamics such that the target states solve classically hard problems is paramount to quantum simulation and computation. And beyond, quantum control is also essential to pave the way to quantum technologies. Here, important control techniques are reviewed and presented in a unified frame covering quantum computational gate synthesis and spectroscopic state transfer alike. We emphasize that it does not matter whether the quantum states of interest are pure or not. While pure states underly the design of quantum circuits, ensemble mixtures of quantum states can be exploited in a more recent class of algorithms: it is illustrated by characterizing the Jones polynomial in order to distinguish between different (classes of) knots. Further applications include Josephson elements, cavity grids, ion traps and nitrogen vacancy centres in scenarios of closed as well as open quantum systems.

Control aspects of quantum computing using pure and mixed states

PubMed Central

Schulte-Herbrüggen, Thomas; Marx, Raimund; Fahmy, Amr; Kauffman, Louis; Lomonaco, Samuel; Khaneja, Navin; Glaser, Steffen J.

2012-01-01

Steering quantum dynamics such that the target states solve classically hard problems is paramount to quantum simulation and computation. And beyond, quantum control is also essential to pave the way to quantum technologies. Here, important control techniques are reviewed and presented in a unified frame covering quantum computational gate synthesis and spectroscopic state transfer alike. We emphasize that it does not matter whether the quantum states of interest are pure or not. While pure states underly the design of quantum circuits, ensemble mixtures of quantum states can be exploited in a more recent class of algorithms: it is illustrated by characterizing the Jones polynomial in order to distinguish between different (classes of) knots. Further applications include Josephson elements, cavity grids, ion traps and nitrogen vacancy centres in scenarios of closed as well as open quantum systems. PMID:22946034

Quantum computer games: quantum minesweeper

NASA Astrophysics Data System (ADS)

Gordon, Michal; Gordon, Goren

2010-07-01

The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical minesweeper the goal of the game is to discover all the mines laid out on a board without triggering them, in the quantum version there are several classical boards in superposition. The goal is to know the exact quantum state, i.e. the precise layout of all the mines in all the superposed classical boards. The player can perform three types of measurement: a classical measurement that probabilistically collapses the superposition; a quantum interaction-free measurement that can detect a mine without triggering it; and an entanglement measurement that provides non-local information. The application of the concepts taught by quantum minesweeper to one-way quantum computing are also presented.

Counterfactual quantum computation through quantum interrogation

NASA Astrophysics Data System (ADS)

Hosten, Onur; Rakher, Matthew T.; Barreiro, Julio T.; Peters, Nicholas A.; Kwiat, Paul G.

2006-02-01

The logic underlying the coherent nature of quantum information processing often deviates from intuitive reasoning, leading to surprising effects. Counterfactual computation constitutes a striking example: the potential outcome of a quantum computation can be inferred, even if the computer is not run. Relying on similar arguments to interaction-free measurements (or quantum interrogation), counterfactual computation is accomplished by putting the computer in a superposition of `running' and `not running' states, and then interfering the two histories. Conditional on the as-yet-unknown outcome of the computation, it is sometimes possible to counterfactually infer information about the solution. Here we demonstrate counterfactual computation, implementing Grover's search algorithm with an all-optical approach. It was believed that the overall probability of such counterfactual inference is intrinsically limited, so that it could not perform better on average than random guesses. However, using a novel `chained' version of the quantum Zeno effect, we show how to boost the counterfactual inference probability to unity, thereby beating the random guessing limit. Our methods are general and apply to any physical system, as illustrated by a discussion of trapped-ion systems. Finally, we briefly show that, in certain circumstances, counterfactual computation can eliminate errors induced by decoherence.

Universal Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Fitzsimons, Joseph; Kashefi, Elham

2012-02-01

Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's inputs, outputs and computation remain private. Recently we proposed a universal unconditionally secure BQC scheme, based on the conceptual framework of the measurement-based quantum computing model, where the client only needs to be able to prepare single qubits in separable states randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. Here we present a refinement of the scheme which vastly expands the class of quantum circuits which can be directly implemented as a blind computation, by introducing a new class of resource states which we term dotted-complete graph states and expanding the set of single qubit states the client is required to prepare. These two modifications significantly simplify the overall protocol and remove the previously present restriction that only nearest-neighbor circuits could be implemented as blind computations directly. As an added benefit, the refined protocol admits a substantially more intuitive and simplified verification mechanism, allowing the correctness of a blind computation to be verified with arbitrarily small probability of error.

Toward a superconducting quantum computer

PubMed Central

Tsai, Jaw-Shen

2010-01-01

Intensive research on the construction of superconducting quantum computers has produced numerous important achievements. The quantum bit (qubit), based on the Josephson junction, is at the heart of this research. This macroscopic system has the ability to control quantum coherence. This article reviews the current state of quantum computing as well as its history, and discusses its future. Although progress has been rapid, the field remains beset with unsolved issues, and there are still many new research opportunities open to physicists and engineers. PMID:20431256

A review on quantum search algorithms

NASA Astrophysics Data System (ADS)

Giri, Pulak Ranjan; Korepin, Vladimir E.

2017-12-01

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms, etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover's quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.

Ramsey numbers and adiabatic quantum computing.

PubMed

Gaitan, Frank; Clark, Lane

2012-01-06

The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers R(m,n) with m, n≥3, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers R(m,n). We show how the computation of R(m,n) can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution. We numerically simulate this adiabatic quantum algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(2,s) for 5≤s≤7. We then discuss the algorithm's experimental implementation, and close by showing that Ramsey number computation belongs to the quantum complexity class quantum Merlin Arthur.

Large-scale frequency- and time-domain quantum entanglement over the optical frequency comb (Conference Presentation)

NASA Astrophysics Data System (ADS)

Pfister, Olivier

2017-05-01

When it comes to practical quantum computing, the two main challenges are circumventing decoherence (devastating quantum errors due to interactions with the environmental bath) and achieving scalability (as many qubits as needed for a real-life, game-changing computation). We show that using, in lieu of qubits, the "qumodes" represented by the resonant fields of the quantum optical frequency comb of an optical parametric oscillator allows one to create bona fide, large scale quantum computing processors, pre-entangled in a cluster state. We detail our recent demonstration of 60-qumode entanglement (out of an estimated 3000) and present an extension to combining this frequency-tagged with time-tagged entanglement, in order to generate an arbitrarily large, universal quantum computing processor.

Cookery method and endpoint temperature can affect the Warner-Bratzler shear force, cooking loss, and internal cooked color of beef semimembranosus and infraspinatus steaks.

PubMed

Yancey, J W S; Apple, J K; Wharton, M D

2016-10-01

Steaks from USDA Select inside rounds (Exp. 1) and shoulder clods (Exp. 2) were used to test the interactive effect of cookery method and endpoint temperature on Warner-Bratzler shear force (WBSF) and internal cooked color. Pairs of 2.5-cm-thick semimembranosus (SM) or infraspinatus (INF) steaks ( = 360/muscle) were cut from each subprimal, labeled, vacuum packaged, and frozen at -30°C in the dark for approximately 60 d before being cooked to 65.5, 71.1, or 76.6°C using 1) a forced-air convection oven (FAC); 2) a forced-air impingement oven (IMP); 3) a gas-fired, open-hearth charbroiler (CHAR); 4) an electric countertop griddle (GRID); or 5) a clam-shell grill (CLAM). Thawed steaks were cooked to their assigned endpoint temperature × cookery method combination, and, after a 5-min cooling period, steaks were weighed to calculate cooking loss percentage and subsequently sliced perpendicular to the cut surface to measure instrumental cooked color. Then, 6 cores were removed for measurement of WBSF. Cooking losses of SM steaks increased ( < 0.05) with each increase in endpoint temperature, whereas INF steaks cooked on a CHAR had the greatest ( < 0.05) cooking losses and cooking INF steaks with the GRID and the CLAM resulted in lesser ( < 0.05) cooking losses than cooking with the FAC and the IMP. Cooking SM steaks on the CHAR resulted in greater ( < 0.05) WBSF values than all other cookery methods when cooked to 65.5 and 76.6°C and greater ( < 0.05) WBSF values than those cooked on the FAC, GRID, and CLAM when cooked to 71.1°C. Shear force values were greater ( < 0.05) for INF steaks cooked to 71.1 and 76.6°C than those cooked to 65.5°C, but INF WBSF values were similar ( = 0.55) among cookery methods. At 65.5°C, FAC-cooked SM steaks were redder ( < 0.05) than those cooked with the GRID and the IMP and, at 71.1°C, CLAM-cooked SM steaks were redder ( < 0.05) than FAC- and IMP-cooked SM steaks; however, a* values were similar ( > 0.05) among cookery methods when cooked to 76.6°C. Redness did not ( > 0.05) differ among INF steaks cooked to 65.5 and 71.1°C with the FAC and the CHAR, whereas internal color of INF steaks cooked in the IMP and the FAC was redder ( < 0.05) than that of INF steaks cooked with the CLAM and the GRID to 76.6°C. Results suggest that endpoint temperature has a greater impact on cooking properties of SM and INF steaks than cookery method, yet it is apparent that internal cooked color of INF and SM steaks react differently to some cookery method-endpoint temperature combinations.

Ancilla-driven quantum computation for qudits and continuous variables

DOE PAGES

Proctor, Timothy; Giulian, Melissa; Korolkova, Natalia; ...

2017-05-10

Although qubits are the leading candidate for the basic elements in a quantum computer, there are also a range of reasons to consider using higher-dimensional qudits or quantum continuous variables (QCVs). In this paper, we use a general “quantum variable” formalism to propose a method of quantum computation in which ancillas are used to mediate gates on a well-isolated “quantum memory” register and which may be applied to the setting of qubits, qudits (for d>2), or QCVs. More specifically, we present a model in which universal quantum computation may be implemented on a register using only repeated applications of amore » single fixed two-body ancilla-register interaction gate, ancillas prepared in a single state, and local measurements of these ancillas. In order to maintain determinism in the computation, adaptive measurements via a classical feed forward of measurement outcomes are used, with the method similar to that in measurement-based quantum computation (MBQC). We show that our model has the same hybrid quantum-classical processing advantages as MBQC, including the power to implement any Clifford circuit in essentially one layer of quantum computation. In some physical settings, high-quality measurements of the ancillas may be highly challenging or not possible, and hence we also present a globally unitary model which replaces the need for measurements of the ancillas with the requirement for ancillas to be prepared in states from a fixed orthonormal basis. In conclusion, we discuss settings in which these models may be of practical interest.« less

Novel INF2 mutations in an Italian cohort of patients with focal segmental glomerulosclerosis, renal failure and Charcot-Marie-Tooth neuropathy.

PubMed

Caridi, Gianluca; Lugani, Francesca; Dagnino, Monica; Gigante, Maddalena; Iolascon, Achille; Falco, Mariateresa; Graziano, Claudio; Benetti, Elisa; Dugo, Mauro; Del Prete, Dorella; Granata, Antonio; Borracelli, Donella; Moggia, Elisabetta; Quaglia, Marco; Rinaldi, Rita; Gesualdo, Loreto; Ghiggeri, Gian Marco

2014-09-01

Mutations of INF2 represent the major cause of familial autosomal dominant (AD) focal segmental glomerulosclerosis (FSGS). A few patients present neurological symptoms of Charcot-Marie-Tooth (CMT) disease but the prevalence of the association has not been assessed yet. We screened 28 families with AD FSGS and identified 8 INF2 mutations in 9 families (32 patients overall), 3 of which were new. Mutations were in all cases localized in the diaphanous-inhibitory domain (DID) of the protein. Clinical features associated with INF2 mutations in our patient cohort included mild proteinuria (1.55 g/L; range 1-2.5) and haematuria as a unique symptom that was recognized at a median age of 21.75 years (range 8-30). Eighteen patients developed end-stage renal disease during their third decade of life; 12 patients presented a creatinine range between 1.2 and 1.5 mg/dL and 2 were healthy at 45 and 54 years of age. CMT was diagnosed in four cases (12.5%); one of these patients presented an already known mutation on exon 2 of INF2, whereas the other patients presented the same mutation on exon 4, a region that was not previously associated with CMT. We confirmed the high incidence of INF2 mutations in families with AD FSGS. The clinical phenotype was mild at the onset of the disease, but evolution to ESRD was frequent. The incidence of CMT has, for the first time, been calculated here to be 12.5% of mutation carriers. Our findings support INF2 gene analysis in families in which renal failure and/or neuro-sensorial defects are inherited following an AD model. © The Author 2014. Published by Oxford University Press on behalf of ERA-EDTA. All rights reserved.

Effect of ginseng polysaccharides and dendritic cells on the balance of Th1/Th2 T helper cells in patients with non-small cell lung cancer.

PubMed

Ma, Junjie; Liu, Huiping; Wang, Xiaolong

2014-12-01

To investigate the effect of thorascopic administration.of ginseng polysaccharides (GPS) plus dendritic cells (DC) on T helper cell type 1/T helper cell type 2 (Th1/Th2) balance in patients with non-small cell lung cancer (NSCLC). A total of 96 NSCLC patients were divided evenly into two groups. The control group was treated with DCs alone and the treatment group was treated with DCs plus GPS. After DCs and GPS were administered thoracoscopically, once a week, 4 times for 30 days, the patients' quality of life was measured with the Functional Assessment of Cancer Treatment-Lung (FACT-L) questionnaire before and after treatment. Serum interferon-γ (INF-γ), interleukin-4 (IL-4), IL-2 and IL-5 were examined before and after treatments. The level of Th1 cytokines (INF-γ, IL-2) and the ratio of Th1/Th2 cytokines (INF-γ/IL-4, IL-2/ IL-5) increased in both treatment groups, while Th2 cytokines (IL-4, IL-5) and FACT-L scores decreased (P < 0.01). Furthermore, after treatment Th1 cytokines (INF-γ, IL-2) and the ratio of Th1/Th2 cytokines (INF-γ/IL-4, IL-2/IL-5) were higher in the DCs + GPS group than in the control group (P < 0.05). Conversely, FACT-L scores and Th2 cytokines (IL-4, IL-5) were higher in the control group than in the DCs + GPS group (P < 0.05). The treatment regime of DCs plus GPS had a greater effect on NSCLC patients' immune function as compared with DCs alone. This was evident by increased expression of Th1 cytokines (INF-γ, IL-2) and the ratio of Th1/Th2 (INF-γ/IL-4, IL-2/IL-5), as well as by decreased FACT-L scores and the expression of Th2 cytokines (IL-4, IL-5).

Interferon-alpha in chronic myeloid leukemia revisited: a long-term retrospective study in Central and Northern Moravia.

PubMed

Faber, Edgar; Kuba, Adam; Zapletalova, Jana; Divoka, Martina; Rohon, Peter; Holzerova, Milena; Jarosova, Marie; Indrak, Karel

2013-09-01

We assessed the long-term outcome of consecutive patients in the chronic phase of chronic myeloid leukemia (CML) treated with interferon-alpha (INF-α) in Central and Northern Moravia between 1989 and 2006. A retrospective study focused on the response, prognostic factors and side-effects of INF-α. 118 patients (67 males and 51 females, median age 50 years; range 18-71) were analyzed. The median follow-up was 82.6 months (12.4-212.6). Thirty-six patients (30.5%) achieved major cytogenetic response (CyR) in median of 18.3 months (3.7-47.3) and maintained it for a median of 64.0 months (7.0-176.0). Sixty-one patients treated with INF-α for more than 12 months had an overall survival (OS) of 137.0 months (95% CI 117.6-156.4). Eighteen (29.5%) achieved complete CyR (CCyR). 109 patients discontinued the treatment with INF-α because of hematologic or cytogenetic resistance in 53 (48.7%), progression of CML in 31 (28.4%) and intolerance to INF-α in 17 (15.6%) patients. The percentage of peripheral blasts, leukocyte count (>50x10(9)/L), splenomegaly, anemia (Hgb≤110 g/L) and Sokal score had statistical impact on the OS in univariate assessment but only the Sokal score remained significant in multivariate analysis. Additional cytogenetic abnormalities at diagnosis were associated with poor prognosis. In most patients, treatment with INF-α had to be stopped because of a failure to induce response, progression of CML or side-effects but nearly one third of patients treated at least for one year had a long-term benefit from INF-α. The best prognosis was associated with achievement of CCyR and negativity of BCR-ABL in nested RT-PCR.

Washout of heme-containing proteins dramatically improves tetrazolium-based infarct staining.

PubMed

Pitts, Kelly R; Stiko, Ann; Buetow, Bernard; Lott, Fred; Guo, Ping; Virca, Duke; Toombs, Christopher F

2007-01-01

Methods to determine infarct size following ischemia-reperfusion injury include gross staining with triphenyltetrazolium chloride (TTC) and perfusion of colored dyes to demarcate the non-ischemic zone. Infarcted tissue (INF) can typically appear a mottled tan to brownish color, making a border between INF and TTC-positive tissue difficult to discern. Previous work in our lab indicated that following TTC staining, prolonged washing of thick sections dramatically sharpened this boundary. Adult rats underwent 30 min ischemia via LAD ligation and reperfusion/recovery over 24 h. Hearts were then harvested, thick-sectioned, and stained with TTC. Stained sections were stored in PBS at 4 degrees C for up to 3 weeks. Histology on thin sections from infarcted hearts fixed directly after harvest revealed extensive hemorrhage within the INF. However, this hemorrhage is washed out when hearts are stored in PBS for 3 weeks. SDS-PAGE of PBS samples taken at 1, 2, and 3 weeks showed a low molecular weight band appearing over time. Peptide sequencing revealed the presence of several proteins including the heme-containing proteins (HCPs) hemoglobin, cytochrome c, and myoglobin. The loss of HCPs from thick sections to PBS corresponded with the blanching of the previously mottled INF within each section. HPLC analysis of these samples confirmed the loss of HCPs contributes to INF whitening. Further, analysis of infarct size values derived from heart slices with or without HCPs showed a significant decrease in measurement error when values were derived from slices without HCPs. These data suggest that HCPs in the heart tissue contribute to the non-uniform and discolored appearance of the INF, and that washout of these proteins produces an INF more easily distinguished from neighboring non-infarcted tissue. This method greatly reduces the error associated with infarct measurements and improves the analysis of the effects of drug treatments and other interventions designed to impact ischemia reperfusion injury.

Deutsch, Toffoli, and cnot Gates via Rydberg Blockade of Neutral Atoms

NASA Astrophysics Data System (ADS)

Shi, Xiao-Feng

2018-05-01

Universal quantum gates and quantum error correction (QEC) lie at the heart of quantum-information science. Large-scale quantum computing depends on a universal set of quantum gates, in which some gates may be easily carried out, while others are restricted to certain physical systems. There is a unique three-qubit quantum gate called the Deutsch gate [D (θ )], from which a circuit can be constructed so that any feasible quantum computing is attainable. We design an easily realizable D (θ ) by using the Rydberg blockade of neutral atoms, where θ can be tuned to any value in [0 ,π ] by adjusting the strengths of external control fields. Using similar protocols, we further show that both the Toffoli and controlled-not gates can be achieved with only three laser pulses. The Toffoli gate, being universal for classical reversible computing, is also useful for QEC, which plays an important role in quantum communication and fault-tolerant quantum computation. The possibility and speed of realizing these gates shed light on the study of quantum information with neutral atoms.

Black hole based quantum computing in labs and in the sky

NASA Astrophysics Data System (ADS)

Dvali, Gia; Panchenko, Mischa

2016-08-01

Analyzing some well established facts, we give a model-independent parameterization of black hole quantum computing in terms of a set of macro and micro quantities and their relations. These include the relations between the extraordinarily-small energy gap of black hole qubits and important time-scales of information-processing, such as, scrambling time and Page's time. We then show, confirming and extending previous results, that other systems of nature with identical quantum informatics features are attractive Bose-Einstein systems at the critical point of quantum phase transition. Here we establish a complete isomorphy between the quantum computational properties of these two systems. In particular, we show that the quantum hair of a critical condensate is strikingly similar to the quantum hair of a black hole. Irrespectively whether one takes the similarity between the two systems as a remarkable coincidence or as a sign of a deeper underlying connection, the following is evident. Black holes are not unique in their way of quantum information processing and we can manufacture black hole based quantum computers in labs by taking advantage of quantum criticality.

Nonlinear optics quantum computing with circuit QED.

PubMed

Adhikari, Prabin; Hafezi, Mohammad; Taylor, J M

2013-02-08

One approach to quantum information processing is to use photons as quantum bits and rely on linear optical elements for most operations. However, some optical nonlinearity is necessary to enable universal quantum computing. Here, we suggest a circuit-QED approach to nonlinear optics quantum computing in the microwave regime, including a deterministic two-photon phase gate. Our specific example uses a hybrid quantum system comprising a LC resonator coupled to a superconducting flux qubit to implement a nonlinear coupling. Compared to the self-Kerr nonlinearity, we find that our approach has improved tolerance to noise in the qubit while maintaining fast operation.

Complex systems and health behavior change: insights from cognitive science.

PubMed

Orr, Mark G; Plaut, David C

2014-05-01

To provide proof-of-concept that quantum health behavior can be instantiated as a computational model that is informed by cognitive science, the Theory of Reasoned Action, and quantum health behavior theory. We conducted a synthetic review of the intersection of quantum health behavior change and cognitive science. We conducted simulations, using a computational model of quantum health behavior (a constraint satisfaction artificial neural network) and tested whether the model exhibited quantum-like behavior. The model exhibited clear signs of quantum-like behavior. Quantum health behavior can be conceptualized as constraint satisfaction: a mitigation between current behavioral state and the social contexts in which it operates. We outlined implications for moving forward with computational models of both quantum health behavior and health behavior in general.

Flexible response and the INF (Intermediate-range Nuclear Force) Treaty: what next. Study project

DOE Office of Scientific and Technical Information (OSTI.GOV)

Williams, H.A.

1988-03-14

The prospect of the Intermediate-range Nuclear Force (INF) Treaty led the former Supreme Allied Commander, Europe, GEN Bernard Rogers, to claim that NATO would lose weapons vital to the Alliance's defense when Pershing II (PII) and Ground-Launched Cruise Missiles (GLCM) were withdrawn from Europe. Nuclear weapons and the NATO strategy of flexible response are inseparably dependent upon each other. GEN Rogers' comments focus directly on the capability which PII and GLCM provided NATO to strike Soviet territory in event of conflict and if such an escalatory step was deemed necessary. Various sources were researched to determine if the INF Treatymore » will cripple the flexible response strategy; while it should not, certain changes in NATO's approach to defense are suggested. Specifically, conventional and nuclear improvements, the latter within the terms of the INF Treaty, are suggested, as are conventional force reduction negotiations and the Europeanization of NATO.« less

NATO without INF (Intermediate-Range Nuclear Forces). Research report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Modlin, S.L.

1988-05-01

This paper was written in the Winter 1987-1988, during the time of the signing of the Intermediate-range Nuclear Forces (INF) signed in Washington, D.C. on 8 December 1987. The paper was written to look ahead to the implications that the treaty, assuming congressional ratification without major change, would have on NATO. Discussed are the historical background of NATO and U.S. national interests in maintaining a balance of power in Europe. NATO strategies of massive retaliation, mutual assured destruction and flexible response are surveyed with respect to the political and military decisions to deploy, and negotiate the removal of INF frommore » Europe. The paper addresses the dual-track decision and the results leading to the INF treaty. The implications of the treaty are then discussed, with a renewed look at U.S. national interests, and suggestions for future U.S. involvement with NATO are provided.« less

Emission beyond 4  μm and mid-infrared lasing in a dysprosium-doped indium fluoride (InF3) fiber.

PubMed

Majewski, Matthew R; Woodward, Robert I; Carreé, Jean-Yves; Poulain, Samuel; Poulain, Marcel; Jackson, Stuart D

2018-04-15

Optical emission from rare-earth-doped fluoride fibers has thus far been limited to less than 4 μm. We extend emission beyond this limit by employing an indium fluoride (InF 3 ) glass fiber as the host, which exhibits an increased infrared transparency over commonly used zirconium fluoride (ZBLAN). Near-infrared pumping of a dysprosium-doped InF 3 fiber results in broad emission centered around 4.3 μm, representing the longest emission yet achieved from a fluoride fiber. The first laser emission in an InF 3 fiber is also demonstrated from the 3 μm dysprosium transition. Finally, a frequency domain excited state lifetime measurement comparison between fluoride hosts suggests that multiphonon effects are significantly reduced in indium fluoride fiber, paving the way to more efficient, longer wavelength lasers compared to ZBLAN fibers.

Quantum ring-polymer contraction method: Including nuclear quantum effects at no additional computational cost in comparison to ab initio molecular dynamics

NASA Astrophysics Data System (ADS)

John, Christopher; Spura, Thomas; Habershon, Scott; Kühne, Thomas D.

2016-04-01

We present a simple and accurate computational method which facilitates ab initio path-integral molecular dynamics simulations, where the quantum-mechanical nature of the nuclei is explicitly taken into account, at essentially no additional computational cost in comparison to the corresponding calculation using classical nuclei. The predictive power of the proposed quantum ring-polymer contraction method is demonstrated by computing various static and dynamic properties of liquid water at ambient conditions using density functional theory. This development will enable routine inclusion of nuclear quantum effects in ab initio molecular dynamics simulations of condensed-phase systems.

Computational quantum-classical boundary of noisy commuting quantum circuits

PubMed Central

Fujii, Keisuke; Tamate, Shuhei

2016-01-01

It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region. PMID:27189039

Computational quantum-classical boundary of noisy commuting quantum circuits.

PubMed

Fujii, Keisuke; Tamate, Shuhei

2016-05-18

It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.

Computational quantum-classical boundary of noisy commuting quantum circuits

NASA Astrophysics Data System (ADS)

Fujii, Keisuke; Tamate, Shuhei

2016-05-01

It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.

Quantum Information Theory - an Invitation

NASA Astrophysics Data System (ADS)

Werner, Reinhard F.

Quantum information and quantum computers have received a lot of public attention recently. Quantum computers have been advertised as a kind of warp drive for computing, and indeed the promise of the algorithms of Shor and Grover is to perform computations which are extremely hard or even provably impossible on any merely ``classical'' computer.In this article I shall give an account of the basic concepts of quantum information theory is given, staying as much as possible in the area of general agreement.The article is divided into two parts. The first (up to the end of Sect. 2.5) is mostly in plain English, centered around the exploration of what can or cannot be done with quantum systems as information carriers. The second part, Sect. 2.6, then gives a description of the mathematical structures and of some of the tools needed to develop the theory.

No-go theorem for passive single-rail linear optical quantum computing.

PubMed

Wu, Lian-Ao; Walther, Philip; Lidar, Daniel A

2013-01-01

Photonic quantum systems are among the most promising architectures for quantum computers. It is well known that for dual-rail photons effective non-linearities and near-deterministic non-trivial two-qubit gates can be achieved via the measurement process and by introducing ancillary photons. While in principle this opens a legitimate path to scalable linear optical quantum computing, the technical requirements are still very challenging and thus other optical encodings are being actively investigated. One of the alternatives is to use single-rail encoded photons, where entangled states can be deterministically generated. Here we prove that even for such systems universal optical quantum computing using only passive optical elements such as beam splitters and phase shifters is not possible. This no-go theorem proves that photon bunching cannot be passively suppressed even when extra ancilla modes and arbitrary number of photons are used. Our result provides useful guidance for the design of optical quantum computers.

Non-unitary probabilistic quantum computing

NASA Technical Reports Server (NTRS)

Gingrich, Robert M.; Williams, Colin P.

2004-01-01

We present a method for designing quantum circuits that perform non-unitary quantum computations on n-qubit states probabilistically, and give analytic expressions for the success probability and fidelity.

MHC class I, beta2 microglobulin, and the INF-gamma receptor are upregulated in aged motoneurons.

PubMed

Edström, Erik; Kullberg, Susanna; Ming, Yu; Zheng, Huaiyu; Ulfhake, Brun

2004-12-15

During aging, spinal cord motoneurons show characteristic changes including the loss of afferent boutons, a selective process that associates with gliosis and behavioral motor impairment. Evidence suggests that the major histocompatibility complex Class I (MHC I) system may be involved in synaptic plasticity of neurons during development and regeneration. In search of a mechanism governing senescent changes in synaptic connectivity, we report evidence for increased expression of MHC I and beta2 microglobulin (beta2M) in motoneurons and glial-like profiles of 30-month-old rats. The regulatory signal(s) for MHC I expression in normal neurons remains unresolved but among tentative molecules are cytokines such as interferon-gamma (INF-gamma) and tumor necrosis factor alpha (TNF-alpha). Interestingly, aged motoneurons, overlapping with those showing increased levels of MHC I, contained increased levels of INF-gamma receptor message. INF-gamma mRNA was detected at low levels in most (8/9) of the aged spinal cords but only infrequently (2/9) in young adult spinal cords; however, the cellular localization of INF-gamma mRNA could not be determined. Our data also indicates that TNF-alpha is upregulated in the senescent spinal cord but that TNF-alpha immunoreactive protein does not associate with motoneurons. We report evidence for an increased expression of MHC I and beta2M in senescent spinal motoneurons and discuss the possibility that this regulation associates with INF-gamma or changes in neurotrophin signaling and neuron activity in senescence. (c) 2004 Wiley-Liss, Inc.

Quantum Analog Computing

NASA Technical Reports Server (NTRS)

Zak, M.

1998-01-01

Quantum analog computing is based upon similarity between mathematical formalism of quantum mechanics and phenomena to be computed. It exploits a dynamical convergence of several competing phenomena to an attractor which can represent an externum of a function, an image, a solution to a system of ODE, or a stochastic process.

Quantum phases with differing computational power.

PubMed

Cui, Jian; Gu, Mile; Kwek, Leong Chuan; Santos, Marcelo França; Fan, Heng; Vedral, Vlatko

2012-05-01

The observation that concepts from quantum information has generated many alternative indicators of quantum phase transitions hints that quantum phase transitions possess operational significance with respect to the processing of quantum information. Yet, studies on whether such transitions lead to quantum phases that differ in their capacity to process information remain limited. Here we show that there exist quantum phase transitions that cause a distinct qualitative change in our ability to simulate certain quantum systems under perturbation of an external field by local operations and classical communication. In particular, we show that in certain quantum phases of the XY model, adiabatic perturbations of the external magnetic field can be simulated by local spin operations, whereas the resulting effect within other phases results in coherent non-local interactions. We discuss the potential implications to adiabatic quantum computation, where a computational advantage exists only when adiabatic perturbation results in coherent multi-body interactions.

Majorana-Based Fermionic Quantum Computation.

PubMed

O'Brien, T E; Rożek, P; Akhmerov, A R

2018-06-01

Because Majorana zero modes store quantum information nonlocally, they are protected from noise, and have been proposed as a building block for a quantum computer. We show how to use the same protection from noise to implement universal fermionic quantum computation. Our architecture requires only two Majorana modes to encode a fermionic quantum degree of freedom, compared to alternative implementations which require a minimum of four Majorana modes for a spin quantum degree of freedom. The fermionic degrees of freedom support both unitary coupled cluster variational quantum eigensolver and quantum phase estimation algorithms, proposed for quantum chemistry simulations. Because we avoid the Jordan-Wigner transformation, our scheme has a lower overhead for implementing both of these algorithms, allowing for simulation of the Trotterized Hubbard Hamiltonian in O(1) time per unitary step. We finally demonstrate magic state distillation in our fermionic architecture, giving a universal set of topologically protected fermionic quantum gates.

Majorana-Based Fermionic Quantum Computation

NASA Astrophysics Data System (ADS)

O'Brien, T. E.; RoŻek, P.; Akhmerov, A. R.

2018-06-01

Because Majorana zero modes store quantum information nonlocally, they are protected from noise, and have been proposed as a building block for a quantum computer. We show how to use the same protection from noise to implement universal fermionic quantum computation. Our architecture requires only two Majorana modes to encode a fermionic quantum degree of freedom, compared to alternative implementations which require a minimum of four Majorana modes for a spin quantum degree of freedom. The fermionic degrees of freedom support both unitary coupled cluster variational quantum eigensolver and quantum phase estimation algorithms, proposed for quantum chemistry simulations. Because we avoid the Jordan-Wigner transformation, our scheme has a lower overhead for implementing both of these algorithms, allowing for simulation of the Trotterized Hubbard Hamiltonian in O (1 ) time per unitary step. We finally demonstrate magic state distillation in our fermionic architecture, giving a universal set of topologically protected fermionic quantum gates.

Iterated Gate Teleportation and Blind Quantum Computation.

PubMed

Pérez-Delgado, Carlos A; Fitzsimons, Joseph F

2015-06-05

Blind quantum computation allows a user to delegate a computation to an untrusted server while keeping the computation hidden. A number of recent works have sought to establish bounds on the communication requirements necessary to implement blind computation, and a bound based on the no-programming theorem of Nielsen and Chuang has emerged as a natural limiting factor. Here we show that this constraint only holds in limited scenarios, and show how to overcome it using a novel method of iterated gate teleportations. This technique enables drastic reductions in the communication required for distributed quantum protocols, extending beyond the blind computation setting. Applied to blind quantum computation, this technique offers significant efficiency improvements, and in some scenarios offers an exponential reduction in communication requirements.

Estimation of residential fine particulate matter infiltration in Shanghai, China.

PubMed

Zhou, Xiaodan; Cai, Jing; Zhao, Yan; Chen, Renjie; Wang, Cuicui; Zhao, Ang; Yang, Changyuan; Li, Huichu; Liu, Suixin; Cao, Junji; Kan, Haidong; Xu, Huihui

2018-02-01

Ambient concentrations of fine particulate matter (PM 2.5 ) concentration is often used as an exposure surrogate to estimate PM 2.5 health effects in epidemiological studies. Ignoring the potential variations in the amount of outdoor PM 2.5 infiltrating into indoor environments will cause exposure misclassification, especially when people spend most of their time indoors. As it is not feasible to measure the PM 2.5 infiltration factor (F inf ) for each individual residence, we aimed to build models for residential PM 2.5 F inf prediction and to evaluate seasonal F inf variations among residences. We repeated collected paired indoor and outdoor PM 2.5 filter samples for 7 continuous days in each of the three seasons (hot, cold and transitional seasons) from 48 typical homes of Shanghai, China. PM 2.5 -bound sulfur on the filters was measured by X-ray fluorescence for PM 2.5 F inf calculation. We then used stepwise-multiple linear regression to construct season-specific models with climatic variables and questionnaire-based predictors. All models were evaluated by the coefficient of determination (R 2 ) and root mean square error (RMSE) from a leave-one-out-cross-validation (LOOCV). The 7-day mean (±SD) of PM 2.5 F inf across all observations was 0.83 (±0.18). F inf was found higher and more varied in transitional season (12-25 °C) than hot (>25 °C) and cold (<12 °C) seasons. Air conditioning use and meteorological factors were the most important predictors during hot and cold seasons; Floor of residence and building age were the best transitional season predictors. The models predicted 60.0%-68.4% of the variance in 7-day averages of F inf , The LOOCV analysis showed an R 2 of 0.52 and an RMSE of 0.11. Our finding of large variation in residential PM 2.5 F inf between seasons and across residences within season indicated the important source of outdoor-generated PM 2.5 exposure heterogeneity in epidemiologic studies. Our models based on readily available data may potentially improve the accuracy of estimates of the health effects of PM 2.5 exposure. Copyright © 2017 Elsevier Ltd. All rights reserved.

Tumor aggressiveness and patient outcome in cancer of the pancreas assessed by dynamic 18F-FDG PET/CT.

PubMed

Epelbaum, Ron; Frenkel, Alex; Haddad, Riad; Sikorski, Natalia; Strauss, Ludwig G; Israel, Ora; Dimitrakopoulou-Strauss, Antonia

2013-01-01

This study aimed to assess the role of a quantitative dynamic PET model in pancreatic cancer as a potential index of tumor aggressiveness and predictor of survival. Seventy-one patients with (18)F-FDG-avid adenocarcinoma of the pancreas before treatment were recruited, including 27 with localized tumors (11 underwent pancreatectomy, and 16 had localized nonresectable tumors) and 44 with metastatic disease. Dynamic (18)F-FDG PET images were acquired over a 60-min period, followed by a whole-body PET/CT study. Quantitative data measurements were based on a 2-compartment model, and the following variables were calculated: VB (fractional blood volume in target area), K(1) and k(2) (kinetic membrane transport parameters), k(3) and k(4) (intracellular (18)F-FDG phosphorylation and dephosphorylation parameters, respectively), and (18)F-FDG INF (global (18)F-FDG influx). The single significant variable for overall survival (OS) in patients with localized disease was (18)F-FDG INF. Patients with a high (18)F-FDG INF (>0.033 min(-1)) had a median OS of 6 and 5 mo for nonresectable and resected tumors, respectively, versus 15 and 19 mo for a low (18)F-FDG INF in nonresectable and resected tumors, respectively (P < 0.04). In metastatic disease, multivariate analysis found VB, K(1), and k(3) to be significant variables for OS (P < 0.043, <0.031, and <0.009, respectively). Prognostic factors for OS in the entire group of patients that were significant at multivariate analysis were stage of disease, VB, K(1), and (18)F-FDG INF (P < 0.00035, <0.03, <0.024, and <0.008, respectively). Median OS for all patients with a high (18)F-FDG INF, low VB, and high K(1) was 3 mo, as opposed to 14 mo in patients with a low (18)F-FDG INF, high VB, and low K(1) (P < 0.021), irrespective of stage and resectability. Quantitative (18)F-FDG kinetic parameters measured by dynamic PET in newly diagnosed pancreatic cancer correlated with the aggressiveness of disease. The (18)F-FDG INF was the single most significant variable for OS in patients with localized disease, whether resectable or not.

Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm

NASA Astrophysics Data System (ADS)

Huang, He-Liang; Goswami, Ashutosh K.; Bao, Wan-Su; Panigrahi, Prasanta K.

2018-06-01

Quantum algorithms can be used to efficiently solve certain classically intractable problems by exploiting quantum parallelism. However, the effectiveness of quantum entanglement in quantum computing remains a question of debate. This study presents a new quantum algorithm that shows entanglement could provide advantages over both classical algorithms and quantum algo- rithms without entanglement. Experiments are implemented to demonstrate the proposed algorithm using superconducting qubits. Results show the viability of the algorithm and suggest that entanglement is essential in obtaining quantum speedup for certain problems in quantum computing. The study provides reliable and clear guidance for developing useful quantum algorithms.

Entangling qubits by Heisenberg spin exchange and anyon braiding

NASA Astrophysics Data System (ADS)

Zeuch, Daniel

As the discovery of quantum mechanics signified a revolution in the world of physics more than one century ago, the notion of a quantum computer in 1981 marked the beginning of a drastic change of our understanding of information and computability. In a quantum computer, information is stored using quantum bits, or qubits, which are described by a quantum-mechanical superposition of the quantum states 0 and 1. Computation then proceeds by acting with unitary operations on these qubits. These operations are referred to as quantum logic gates, in analogy to classical computation where bits are acted on by classical logic gates. In order to perform universal quantum computation it is, in principle, sufficient to carry out single-qubit gates and two-qubit gates, where the former act on individual qubits and the latter, acting on two qubits, are used to entangle qubits with each other. The present thesis is divided into two main parts. In the first, we are concerned with spin-based quantum computation. In a spin-based quantum computer, qubits are encoded into the Hilbert space spanned by spin-1/2 particles, such as electron spins trapped in semiconductor quantum dots. For a suitable qubit encoding, turning on-and-off, or "pulsing,'' the isotropic Heisenberg exchange Hamiltonian JSi · Sj allows for universal quantum computation and it is this scheme, known as exchange-only quantum computation, which we focus on. In the second part of this thesis, we consider a topological quantum computer in which qubits are encoded using so-called Fibonacci anyons, exotic quasiparticle excitations that obey non-Abelian statistics, and which may emerge in certain two-dimensional topological systems such as fractional quantum-Hall states. Quantum gates can then be carried out by moving these particles around one another, a process that can be viewed as braiding their 2+1 dimensional worldlines. The subject of the present thesis is the development and theoretical understanding of procedures used for entangling qubits. We begin by presenting analytical constructions of pulse sequences which can be used to carry out two-qubit gates that are locally equivalent to a controlled-PHASE gate. The corresponding phase can be arbitrarily chosen, and for one particular choice this gate is equivalent to controlled-NOT. While the constructions of these sequences are relatively lengthy and cumbersome, we further provide a straightforward and intuitive derivation of the shortest known two-qubit pulse sequence for carrying out a controlled-NOT gate. This derivation is carried out completely analytically through a novel "elevation'' of a simple three-spin pulse sequence to a more complicated five-spin pulse sequence. In the case of topological quantum computation with Fibonacci anyons, we present a new method for constructing entangling two-qubit braids. Our construction is based on an iterative procedure, established by Reichardt, which can be used to systematically generate braids whose corresponding operations quickly converge towards an operation that has a diagonal matrix representation in a particular natural basis. After describing this iteration procedure we show how the resulting braids can be used in two explicit constructions for two-qubit braids. Compared to two-qubit braids that can be found using other methods, the braids generated here are among the most efficient and can be obtained straightforwardly without computational overhead.

Computation in generalised probabilisitic theories

NASA Astrophysics Data System (ADS)

Lee, Ciarán M.; Barrett, Jonathan

2015-08-01

From the general difficulty of simulating quantum systems using classical systems, and in particular the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation is that {{BQP}}\\subseteq {{AWPP}}, where {{AWPP}} is a classical complexity class (known to be included in {{PP}}, hence {{PSPACE}}). This work investigates limits on computational power that are imposed by simple physical, or information theoretic, principles. To this end, we define a circuit-based model of computation in a class of operationally-defined theories more general than quantum theory, and ask: what is the minimal set of physical assumptions under which the above inclusions still hold? We show that given only an assumption of tomographic locality (roughly, that multipartite states and transformations can be characterized by local measurements), efficient computations are contained in {{AWPP}}. This inclusion still holds even without assuming a basic notion of causality (where the notion is, roughly, that probabilities for outcomes cannot depend on future measurement choices). Following Aaronson, we extend the computational model by allowing post-selection on measurement outcomes. Aaronson showed that the corresponding quantum complexity class, {{PostBQP}}, is equal to {{PP}}. Given only the assumption of tomographic locality, the inclusion in {{PP}} still holds for post-selected computation in general theories. Hence in a world with post-selection, quantum theory is optimal for computation in the space of all operational theories. We then consider whether one can obtain relativized complexity results for general theories. It is not obvious how to define a sensible notion of a computational oracle in the general framework that reduces to the standard notion in the quantum case. Nevertheless, it is possible to define computation relative to a ‘classical oracle’. Then, we show there exists a classical oracle relative to which efficient computation in any theory satisfying the causality assumption does not include {{NP}}.

Experimental quantum computing without entanglement.

PubMed

Lanyon, B P; Barbieri, M; Almeida, M P; White, A G

2008-11-14

Deterministic quantum computation with one pure qubit (DQC1) is an efficient model of computation that uses highly mixed states. Unlike pure-state models, its power is not derived from the generation of a large amount of entanglement. Instead it has been proposed that other nonclassical correlations are responsible for the computational speedup, and that these can be captured by the quantum discord. In this Letter we implement DQC1 in an all-optical architecture, and experimentally observe the generated correlations. We find no entanglement, but large amounts of quantum discord-except in three cases where an efficient classical simulation is always possible. Our results show that even fully separable, highly mixed, states can contain intrinsically quantum mechanical correlations and that these could offer a valuable resource for quantum information technologies.

Materials Frontiers to Empower Quantum Computing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Taylor, Antoinette Jane; Sarrao, John Louis; Richardson, Christopher

This is an exciting time at the nexus of quantum computing and materials research. The materials frontiers described in this report represent a significant advance in electronic materials and our understanding of the interactions between the local material and a manufactured quantum state. Simultaneously, directed efforts to solve materials issues related to quantum computing provide an opportunity to control and probe the fundamental arrangement of matter that will impact all electronic materials. An opportunity exists to extend our understanding of materials functionality from electronic-grade to quantum-grade by achieving a predictive understanding of noise and decoherence in qubits and their originsmore » in materials defects and environmental coupling. Realizing this vision systematically and predictively will be transformative for quantum computing and will represent a qualitative step forward in materials prediction and control.« less

A Blueprint for Demonstrating Quantum Supremacy with Superconducting Qubits

NASA Technical Reports Server (NTRS)

Kechedzhi, Kostyantyn

2018-01-01

Long coherence times and high fidelity control recently achieved in scalable superconducting circuits paved the way for the growing number of experimental studies of many-qubit quantum coherent phenomena in these devices. Albeit full implementation of quantum error correction and fault tolerant quantum computation remains a challenge the near term pre-error correction devices could allow new fundamental experiments despite inevitable accumulation of errors. One such open question foundational for quantum computing is achieving the so called quantum supremacy, an experimental demonstration of a computational task that takes polynomial time on the quantum computer whereas the best classical algorithm would require exponential time and/or resources. It is possible to formulate such a task for a quantum computer consisting of less than a 100 qubits. The computational task we consider is to provide approximate samples from a non-trivial quantum distribution. This is a generalization for the case of superconducting circuits of ideas behind boson sampling protocol for quantum optics introduced by Arkhipov and Aaronson. In this presentation we discuss a proof-of-principle demonstration of such a sampling task on a 9-qubit chain of superconducting gmon qubits developed by Google. We discuss theoretical analysis of the driven evolution of the device resulting in output approximating samples from a uniform distribution in the Hilbert space, a quantum chaotic state. We analyze quantum chaotic characteristics of the output of the circuit and the time required to generate a sufficiently complex quantum distribution. We demonstrate that the classical simulation of the sampling output requires exponential resources by connecting the task of calculating the output amplitudes to the sign problem of the Quantum Monte Carlo method. We also discuss the detailed theoretical modeling required to achieve high fidelity control and calibration of the multi-qubit unitary evolution in the device. We use a novel cross-entropy statistical metric as a figure of merit to verify the output and calibrate the device controls. Finally, we demonstrate the statistics of the wave function amplitudes generated on the 9-gmon chain and verify the quantum chaotic nature of the generated quantum distribution. This verifies the implementation of the quantum supremacy protocol.

Simulation of n-qubit quantum systems. I. Quantum registers and quantum gates

NASA Astrophysics Data System (ADS)

Radtke, T.; Fritzsche, S.

2005-12-01

During recent years, quantum computations and the study of n-qubit quantum systems have attracted a lot of interest, both in theory and experiment. Apart from the promise of performing quantum computations, however, these investigations also revealed a great deal of difficulties which still need to be solved in practice. In quantum computing, unitary and non-unitary quantum operations act on a given set of qubits to form (entangled) states, in which the information is encoded by the overall system often referred to as quantum registers. To facilitate the simulation of such n-qubit quantum systems, we present the FEYNMAN program to provide all necessary tools in order to define and to deal with quantum registers and quantum operations. Although the present version of the program is restricted to unitary transformations, it equally supports—whenever possible—the representation of the quantum registers both, in terms of their state vectors and density matrices. In addition to the composition of two or more quantum registers, moreover, the program also supports their decomposition into various parts by applying the partial trace operation and the concept of the reduced density matrix. Using an interactive design within the framework of MAPLE, therefore, we expect the FEYNMAN program to be helpful not only for teaching the basic elements of quantum computing but also for studying their physical realization in the future. Program summaryTitle of program:FEYNMAN Catalogue number:ADWE Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWE Program obtainable from:CPC Program Library, Queen's University of Belfast, N. Ireland Licensing provisions:None Computers for which the program is designed:All computers with a license of the computer algebra system MAPLE [Maple is a registered trademark of Waterlo Maple Inc.] Operating systems or monitors under which the program has been tested:Linux, MS Windows XP Programming language used:MAPLE 9.5 (but should be compatible with 9.0 and 8.0, too) Memory and time required to execute with typical data:Storage and time requirements critically depend on the number of qubits, n, in the quantum registers due to the exponential increase of the associated Hilbert space. In particular, complex algebraic operations may require large amounts of memory even for small qubit numbers. However, most of the standard commands (see Section 4 for simple examples) react promptly for up to five qubits on a normal single-processor machine ( ⩾1GHz with 512 MB memory) and use less than 10 MB memory. No. of lines in distributed program, including test data, etc.: 8864 No. of bytes in distributed program, including test data, etc.: 493 182 Distribution format: tar.gz Nature of the physical problem:During the last decade, quantum computing has been found to provide a revolutionary new form of computation. The algorithms by Shor [P.W. Shor, SIAM J. Sci. Statist. Comput. 26 (1997) 1484] and Grover [L.K. Grover, Phys. Rev. Lett. 79 (1997) 325. [2

Research on Electrically Driven Single Photon Emitter by Diamond for Quantum Cryptography

DTIC Science & Technology

2015-03-24

by diamond for quantum cryptography 5a. CONTRACT NUMBER FA2386-14-1-4037 5b. GRANT NUMBE R Grant 14IOA093_144037 5c. PROGRAM ELEMENT...emerged as a highly competitive platform for applications in quantum cryptography , quantum computing, spintronics, and sensing or metrology...15. SUBJECT TERMS Diamond LED, Nitrogen Vacancy Complex, Quantum Computing, Quantum Cryptography , Single Spin Single Photon 16. SECURITY

Teleportation-based realization of an optical quantum two-qubit entangling gate

PubMed Central

Gao, Wei-Bo; Goebel, Alexander M.; Lu, Chao-Yang; Dai, Han-Ning; Wagenknecht, Claudia; Zhang, Qiang; Zhao, Bo; Peng, Cheng-Zhi; Chen, Zeng-Bing; Chen, Yu-Ao; Pan, Jian-Wei

2010-01-01

In recent years, there has been heightened interest in quantum teleportation, which allows for the transfer of unknown quantum states over arbitrary distances. Quantum teleportation not only serves as an essential ingredient in long-distance quantum communication, but also provides enabling technologies for practical quantum computation. Of particular interest is the scheme proposed by D. Gottesman and I. L. Chuang [(1999) Nature 402:390–393], showing that quantum gates can be implemented by teleporting qubits with the help of some special entangled states. Therefore, the construction of a quantum computer can be simply based on some multiparticle entangled states, Bell-state measurements, and single-qubit operations. The feasibility of this scheme relaxes experimental constraints on realizing universal quantum computation. Using two different methods, we demonstrate the smallest nontrivial module in such a scheme—a teleportation-based quantum entangling gate for two different photonic qubits. One uses a high-fidelity six-photon interferometer to realize controlled-NOT gates, and the other uses four-photon hyperentanglement to realize controlled-Phase gates. The results clearly demonstrate the working principles and the entangling capability of the gates. Our experiment represents an important step toward the realization of practical quantum computers and could lead to many further applications in linear optics quantum information processing. PMID:21098305

Teleportation-based realization of an optical quantum two-qubit entangling gate.

PubMed

Gao, Wei-Bo; Goebel, Alexander M; Lu, Chao-Yang; Dai, Han-Ning; Wagenknecht, Claudia; Zhang, Qiang; Zhao, Bo; Peng, Cheng-Zhi; Chen, Zeng-Bing; Chen, Yu-Ao; Pan, Jian-Wei

2010-12-07

In recent years, there has been heightened interest in quantum teleportation, which allows for the transfer of unknown quantum states over arbitrary distances. Quantum teleportation not only serves as an essential ingredient in long-distance quantum communication, but also provides enabling technologies for practical quantum computation. Of particular interest is the scheme proposed by D. Gottesman and I. L. Chuang [(1999) Nature 402:390-393], showing that quantum gates can be implemented by teleporting qubits with the help of some special entangled states. Therefore, the construction of a quantum computer can be simply based on some multiparticle entangled states, Bell-state measurements, and single-qubit operations. The feasibility of this scheme relaxes experimental constraints on realizing universal quantum computation. Using two different methods, we demonstrate the smallest nontrivial module in such a scheme--a teleportation-based quantum entangling gate for two different photonic qubits. One uses a high-fidelity six-photon interferometer to realize controlled-NOT gates, and the other uses four-photon hyperentanglement to realize controlled-Phase gates. The results clearly demonstrate the working principles and the entangling capability of the gates. Our experiment represents an important step toward the realization of practical quantum computers and could lead to many further applications in linear optics quantum information processing.

Permutation importance: a corrected feature importance measure.

PubMed

Altmann, André; Toloşi, Laura; Sander, Oliver; Lengauer, Thomas

2010-05-15

In life sciences, interpretability of machine learning models is as important as their prediction accuracy. Linear models are probably the most frequently used methods for assessing feature relevance, despite their relative inflexibility. However, in the past years effective estimators of feature relevance have been derived for highly complex or non-parametric models such as support vector machines and RandomForest (RF) models. Recently, it has been observed that RF models are biased in such a way that categorical variables with a large number of categories are preferred. In this work, we introduce a heuristic for normalizing feature importance measures that can correct the feature importance bias. The method is based on repeated permutations of the outcome vector for estimating the distribution of measured importance for each variable in a non-informative setting. The P-value of the observed importance provides a corrected measure of feature importance. We apply our method to simulated data and demonstrate that (i) non-informative predictors do not receive significant P-values, (ii) informative variables can successfully be recovered among non-informative variables and (iii) P-values computed with permutation importance (PIMP) are very helpful for deciding the significance of variables, and therefore improve model interpretability. Furthermore, PIMP was used to correct RF-based importance measures for two real-world case studies. We propose an improved RF model that uses the significant variables with respect to the PIMP measure and show that its prediction accuracy is superior to that of other existing models. R code for the method presented in this article is available at http://www.mpi-inf.mpg.de/ approximately altmann/download/PIMP.R CONTACT: altmann@mpi-inf.mpg.de, laura.tolosi@mpi-inf.mpg.de Supplementary data are available at Bioinformatics online.

Experimental magic state distillation for fault-tolerant quantum computing.

PubMed

Souza, Alexandre M; Zhang, Jingfu; Ryan, Colm A; Laflamme, Raymond

2011-01-25

Any physical quantum device for quantum information processing (QIP) is subject to errors in implementation. In order to be reliable and efficient, quantum computers will need error-correcting or error-avoiding methods. Fault-tolerance achieved through quantum error correction will be an integral part of quantum computers. Of the many methods that have been discovered to implement it, a highly successful approach has been to use transversal gates and specific initial states. A critical element for its implementation is the availability of high-fidelity initial states, such as |0〉 and the 'magic state'. Here, we report an experiment, performed in a nuclear magnetic resonance (NMR) quantum processor, showing sufficient quantum control to improve the fidelity of imperfect initial magic states by distilling five of them into one with higher fidelity.

Quasi-one-dimensional quantum anomalous Hall systems as new platforms for scalable topological quantum computation

NASA Astrophysics Data System (ADS)

Chen, Chui-Zhen; Xie, Ying-Ming; Liu, Jie; Lee, Patrick A.; Law, K. T.

2018-03-01

Quantum anomalous Hall insulator/superconductor heterostructures emerged as a competitive platform to realize topological superconductors with chiral Majorana edge states as shown in recent experiments [He et al. Science 357, 294 (2017), 10.1126/science.aag2792]. However, chiral Majorana modes, being extended, cannot be used for topological quantum computation. In this work, we show that quasi-one-dimensional quantum anomalous Hall structures exhibit a large topological regime (much larger than the two-dimensional case) which supports localized Majorana zero energy modes. The non-Abelian properties of a cross-shaped quantum anomalous Hall junction is shown explicitly by time-dependent calculations. We believe that the proposed quasi-one-dimensional quantum anomalous Hall structures can be easily fabricated for scalable topological quantum computation.

The Brain Is both Neurocomputer and Quantum Computer

ERIC Educational Resources Information Center

Hameroff, Stuart R.

2007-01-01

In their article, "Is the Brain a Quantum Computer,?" Litt, Eliasmith, Kroon, Weinstein, and Thagard (2006) criticize the Penrose-Hameroff "Orch OR" quantum computational model of consciousness, arguing instead for neurocomputation as an explanation for mental phenomena. Here I clarify and defend Orch OR, show how Orch OR and neurocomputation are…

Effect of local minima on adiabatic quantum optimization.

PubMed

Amin, M H S

2008-04-04

We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that, for problems that have an exponentially large number of local minima close to the global minimum, the gap becomes exponentially small making the computation time exponentially long. The quantum advantage of adiabatic quantum computation may then be accessed only via the local adiabatic evolution, which requires phase coherence throughout the evolution and knowledge of the spectrum. Such problems, therefore, are not suitable for adiabatic quantum computation.

Multi-server blind quantum computation over collective-noise channels

NASA Astrophysics Data System (ADS)

Xiao, Min; Liu, Lin; Song, Xiuli

2018-03-01

Blind quantum computation (BQC) enables ordinary clients to securely outsource their computation task to costly quantum servers. Besides two essential properties, namely correctness and blindness, practical BQC protocols also should make clients as classical as possible and tolerate faults from nonideal quantum channel. In this paper, using logical Bell states as quantum resource, we propose multi-server BQC protocols over collective-dephasing noise channel and collective-rotation noise channel, respectively. The proposed protocols permit completely or almost classical client, meet the correctness and blindness requirements of BQC protocol, and are typically practical BQC protocols.

Complexity of the Quantum Adiabatic Algorithm

NASA Technical Reports Server (NTRS)

Hen, Itay

2013-01-01

The Quantum Adiabatic Algorithm (QAA) has been proposed as a mechanism for efficiently solving optimization problems on a quantum computer. Since adiabatic computation is analog in nature and does not require the design and use of quantum gates, it can be thought of as a simpler and perhaps more profound method for performing quantum computations that might also be easier to implement experimentally. While these features have generated substantial research in QAA, to date there is still a lack of solid evidence that the algorithm can outperform classical optimization algorithms.

Quantum computational complexity, Einstein's equations and accelerated expansion of the Universe

NASA Astrophysics Data System (ADS)

Ge, Xian-Hui; Wang, Bin

2018-02-01

We study the relation between quantum computational complexity and general relativity. The quantum computational complexity is proposed to be quantified by the shortest length of geodesic quantum curves. We examine the complexity/volume duality in a geodesic causal ball in the framework of Fermi normal coordinates and derive the full non-linear Einstein equation. Using insights from the complexity/action duality, we argue that the accelerated expansion of the universe could be driven by the quantum complexity and free from coincidence and fine-tunning problems.

Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder

NASA Astrophysics Data System (ADS)

Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian

2018-04-01

Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.

Hidden Statistics Approach to Quantum Simulations

NASA Technical Reports Server (NTRS)

Zak, Michail

2010-01-01

Recent advances in quantum information theory have inspired an explosion of interest in new quantum algorithms for solving hard computational (quantum and non-quantum) problems. The basic principle of quantum computation is that the quantum properties can be used to represent structure data, and that quantum mechanisms can be devised and built to perform operations with this data. Three basic non-classical properties of quantum mechanics superposition, entanglement, and direct-product decomposability were main reasons for optimism about capabilities of quantum computers that promised simultaneous processing of large massifs of highly correlated data. Unfortunately, these advantages of quantum mechanics came with a high price. One major problem is keeping the components of the computer in a coherent state, as the slightest interaction with the external world would cause the system to decohere. That is why the hardware implementation of a quantum computer is still unsolved. The basic idea of this work is to create a new kind of dynamical system that would preserve the main three properties of quantum physics superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. In other words, such a system would reinforce the advantages and minimize limitations of both quantum and classical aspects. Based upon a concept of hidden statistics, a new kind of dynamical system for simulation of Schroedinger equation is proposed. The system represents a modified Madelung version of Schroedinger equation. It preserves superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for simulating quantum systems. The model includes a transitional component of quantum potential (that has been overlooked in previous treatment of the Madelung equation). The role of the transitional potential is to provide a jump from a deterministic state to a random state with prescribed probability density. This jump is triggered by blowup instability due to violation of Lipschitz condition generated by the quantum potential. As a result, the dynamics attains quantum properties on a classical scale. The model can be implemented physically as an analog VLSI-based (very-large-scale integration-based) computer, or numerically on a digital computer. This work opens a way of developing fundamentally new algorithms for quantum simulations of exponentially complex problems that expand NASA capabilities in conducting space activities. It has been illustrated that the complexity of simulations of particle interaction can be reduced from an exponential one to a polynomial one.

An Algebraic Approach to the Eigenstates of the Calogero Model

NASA Astrophysics Data System (ADS)

Ujino, Hideaki

2002-11-01

An algebraic treatment of the eigenstates of the (AN-1-) Calogero model is presented, which provides an algebraic construction of the nonsymmetric orthogonal eigenvectors, symmetrization, antisymmetrization and calculation of square norms in a unified way.

Heats of Segregation of BCC Binaries from ab Initio and Quantum Approximate Calculations

NASA Technical Reports Server (NTRS)

Good, Brian S.

2004-01-01

We compare dilute-limit heats of segregation for selected BCC transition metal binaries computed using ab initio and quantum approximate energy methods. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent LMTO-based parameters. Quantum approximate segregation energies are computed with and without atomistic relaxation, while the ab initio calculations are performed without relaxation. Results are discussed within the context of a segregation model driven by strain and bond-breaking effects. We compare our results with full-potential quantum calculations and with available experimental results.

Universal quantum computation with little entanglement.

PubMed

Van den Nest, Maarten

2013-02-08

We show that universal quantum computation can be achieved in the standard pure-state circuit model while the entanglement entropy of every bipartition is small in each step of the computation. The entanglement entropy required for large-scale quantum computation even tends to zero. Moreover we show that the same conclusion applies to many entanglement measures commonly used in the literature. This includes e.g., the geometric measure, localizable entanglement, multipartite concurrence, squashed entanglement, witness-based measures, and more generally any entanglement measure which is continuous in a certain natural sense. These results demonstrate that many entanglement measures are unsuitable tools to assess the power of quantum computers.

Quantum Algorithms and Protocols

NASA Astrophysics Data System (ADS)

Divincenzo, David

2001-06-01

Quantum Computing is better than classical computing, but not just because it speeds up some computations. Some of the best known quantum algorithms, like Grover's, may well have their most interesting applications in settings that involve the combination of computation and communication. Thus, Grover speeds up the appointment scheduling problem by reducing the amount of communication needed between two parties who want to find a common free slot on their calendars. I will review various other applications of this sort that are being explored. Other distributed computing protocols are required to have other attributes like obliviousness and privacy; I will discuss our recent applications involving quantum data hiding.

Quantum wavepacket ab initio molecular dynamics: an approach for computing dynamically averaged vibrational spectra including critical nuclear quantum effects.

PubMed

Sumner, Isaiah; Iyengar, Srinivasan S

2007-10-18

We have introduced a computational methodology to study vibrational spectroscopy in clusters inclusive of critical nuclear quantum effects. This approach is based on the recently developed quantum wavepacket ab initio molecular dynamics method that combines quantum wavepacket dynamics with ab initio molecular dynamics. The computational efficiency of the dynamical procedure is drastically improved (by several orders of magnitude) through the utilization of wavelet-based techniques combined with the previously introduced time-dependent deterministic sampling procedure measure to achieve stable, picosecond length, quantum-classical dynamics of electrons and nuclei in clusters. The dynamical information is employed to construct a novel cumulative flux/velocity correlation function, where the wavepacket flux from the quantized particle is combined with classical nuclear velocities to obtain the vibrational density of states. The approach is demonstrated by computing the vibrational density of states of [Cl-H-Cl]-, inclusive of critical quantum nuclear effects, and our results are in good agreement with experiment. A general hierarchical procedure is also provided, based on electronic structure harmonic frequencies, classical ab initio molecular dynamics, computation of nuclear quantum-mechanical eigenstates, and employing quantum wavepacket ab initio dynamics to understand vibrational spectroscopy in hydrogen-bonded clusters that display large degrees of anharmonicities.

Comprehensive Materials and Morphologies Study of Ion Traps (COMMIT) for Scalable Quantum Computation

DTIC Science & Technology

2012-04-21

the photoelectric effect. The typical shortest wavelengths needed for ion traps range from 194 nm for Hg+ to 493 nm for Ba +, corresponding to 6.4-2.5...REPORT Comprehensive Materials and Morphologies Study of Ion Traps (COMMIT) for scalable Quantum Computation - Final Report 14. ABSTRACT 16. SECURITY...CLASSIFICATION OF: Trapped ion systems, are extremely promising for large-scale quantum computation, but face a vexing problem, with motional quantum

Geometry of Quantum Computation with Qudits

PubMed Central

Luo, Ming-Xing; Chen, Xiu-Bo; Yang, Yi-Xian; Wang, Xiaojun

2014-01-01

The circuit complexity of quantum qubit system evolution as a primitive problem in quantum computation has been discussed widely. We investigate this problem in terms of qudit system. Using the Riemannian geometry the optimal quantum circuits are equivalent to the geodetic evolutions in specially curved parametrization of SU(dn). And the quantum circuit complexity is explicitly dependent of controllable approximation error bound. PMID:24509710

One-loop quantum gravity repulsion in the early Universe.

PubMed

Broda, Bogusław

2011-03-11

Perturbative quantum gravity formalism is applied to compute the lowest order corrections to the classical spatially flat cosmological Friedmann-Lemaître-Robertson-Walker solution (for the radiation). The presented approach is analogous to the approach applied to compute quantum corrections to the Coulomb potential in electrodynamics, or rather to the approach applied to compute quantum corrections to the Schwarzschild solution in gravity. In the framework of the standard perturbative quantum gravity, it is shown that the corrections to the classical deceleration, coming from the one-loop graviton vacuum polarization (self-energy), have (UV cutoff free) opposite to the classical repulsive properties which are not negligible in the very early Universe. The repulsive "quantum forces" resemble those known from loop quantum cosmology.

Novel systems and methods for quantum communication, quantum computation, and quantum simulation

NASA Astrophysics Data System (ADS)

Gorshkov, Alexey Vyacheslavovich

Precise control over quantum systems can enable the realization of fascinating applications such as powerful computers, secure communication devices, and simulators that can elucidate the physics of complex condensed matter systems. However, the fragility of quantum effects makes it very difficult to harness the power of quantum mechanics. In this thesis, we present novel systems and tools for gaining fundamental insights into the complex quantum world and for bringing practical applications of quantum mechanics closer to reality. We first optimize and show equivalence between a wide range of techniques for storage of photons in atomic ensembles. We describe experiments demonstrating the potential of our optimization algorithms for quantum communication and computation applications. Next, we combine the technique of photon storage with strong atom-atom interactions to propose a robust protocol for implementing the two-qubit photonic phase gate, which is an important ingredient in many quantum computation and communication tasks. In contrast to photon storage, many quantum computation and simulation applications require individual addressing of closely-spaced atoms, ions, quantum dots, or solid state defects. To meet this requirement, we propose a method for coherent optical far-field manipulation of quantum systems with a resolution that is not limited by the wavelength of radiation. While alkali atoms are currently the system of choice for photon storage and many other applications, we develop new methods for quantum information processing and quantum simulation with ultracold alkaline-earth atoms in optical lattices. We show how multiple qubits can be encoded in individual alkaline-earth atoms and harnessed for quantum computing and precision measurements applications. We also demonstrate that alkaline-earth atoms can be used to simulate highly symmetric systems exhibiting spin-orbital interactions and capable of providing valuable insights into strongly correlated physics of transition metal oxides, heavy fermion materials, and spin liquid phases. While ultracold atoms typically exhibit only short-range interactions, numerous exotic phenomena and practical applications require long-range interactions, which can be achieved with ultracold polar molecules. We demonstrate the possibility to engineer a repulsive interaction between polar molecules, which allows for the suppression of inelastic collisions, efficient evaporative cooling, and the creation of novel phases of polar molecules.

Quantum Chess: Making Quantum Phenomena Accessible

NASA Astrophysics Data System (ADS)

Cantwell, Christopher

Quantum phenomena have remained largely inaccessible to the general public. There tends to be a scare factor associated with the word ``Quantum''. This is in large part due to the alien nature of phenomena such as superposition and entanglement. However, Quantum Computing is a very active area of research and one day we will have games that run on those quantum computers. Quantum phenomena such as superposition and entanglement will seem as normal as gravity. Is it possible to create such games today? Can we make games that are built on top of a realistic quantum simulation and introduce players of any background to quantum concepts in a fun and mentally stimulating way? One of the difficulties with any quantum simulation run on a classical computer is that the Hilbert space grows exponentially, making simulations of an appreciable size physically impossible due largely to memory restrictions. Here we will discuss the conception and development of Quantum Chess, and how to overcome some of the difficulties faced. We can then ask the question, ``What's next?'' What are some of the difficulties Quantum Chess still faces, and what is the future of quantum games?

Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states

DOE Office of Scientific and Technical Information (OSTI.GOV)

McClean, Jarrod R.; Kimchi-Schwartz, Mollie E.; Carter, Jonathan

Using quantum devices supported by classical computational resources is a promising approach to quantum-enabled computation. One powerful example of such a hybrid quantum-classical approach optimized for classically intractable eigenvalue problems is the variational quantum eigensolver, built to utilize quantum resources for the solution of eigenvalue problems and optimizations with minimal coherence time requirements by leveraging classical computational resources. These algorithms have been placed as leaders among the candidates for the first to achieve supremacy over classical computation. Here, we provide evidence for the conjecture that variational approaches can automatically suppress even nonsystematic decoherence errors by introducing an exactly solvable channelmore » model of variational state preparation. Moreover, we develop a more general hierarchy of measurement and classical computation that allows one to obtain increasingly accurate solutions by leveraging additional measurements and classical resources. In conclusion, we demonstrate numerically on a sample electronic system that this method both allows for the accurate determination of excited electronic states as well as reduces the impact of decoherence, without using any additional quantum coherence time or formal error-correction codes.« less

Implementation and characterization of active feed-forward for deterministic linear optics quantum computing

NASA Astrophysics Data System (ADS)

Böhi, P.; Prevedel, R.; Jennewein, T.; Stefanov, A.; Tiefenbacher, F.; Zeilinger, A.

2007-12-01

In general, quantum computer architectures which are based on the dynamical evolution of quantum states, also require the processing of classical information, obtained by measurements of the actual qubits that make up the computer. This classical processing involves fast, active adaptation of subsequent measurements and real-time error correction (feed-forward), so that quantum gates and algorithms can be executed in a deterministic and hence error-free fashion. This is also true in the linear optical regime, where the quantum information is stored in the polarization state of photons. The adaptation of the photon’s polarization can be achieved in a very fast manner by employing electro-optical modulators, which change the polarization of a trespassing photon upon appliance of a high voltage. In this paper we discuss techniques for implementing fast, active feed-forward at the single photon level and we present their application in the context of photonic quantum computing. This includes the working principles and the characterization of the EOMs as well as a description of the switching logics, both of which allow quantum computation at an unprecedented speed.

Regression relation for pure quantum states and its implications for efficient computing.

PubMed

Elsayed, Tarek A; Fine, Boris V

2013-02-15

We obtain a modified version of the Onsager regression relation for the expectation values of quantum-mechanical operators in pure quantum states of isolated many-body quantum systems. We use the insights gained from this relation to show that high-temperature time correlation functions in many-body quantum systems can be controllably computed without complete diagonalization of the Hamiltonians, using instead the direct integration of the Schrödinger equation for randomly sampled pure states. This method is also applicable to quantum quenches and other situations describable by time-dependent many-body Hamiltonians. The method implies exponential reduction of the computer memory requirement in comparison with the complete diagonalization. We illustrate the method by numerically computing infinite-temperature correlation functions for translationally invariant Heisenberg chains of up to 29 spins 1/2. Thereby, we also test the spin diffusion hypothesis and find it in a satisfactory agreement with the numerical results. Both the derivation of the modified regression relation and the justification of the computational method are based on the notion of quantum typicality.

Practical experimental certification of computational quantum gates using a twirling procedure.

PubMed

Moussa, Osama; da Silva, Marcus P; Ryan, Colm A; Laflamme, Raymond

2012-08-17

Because of the technical difficulty of building large quantum computers, it is important to be able to estimate how faithful a given implementation is to an ideal quantum computer. The common approach of completely characterizing the computation process via quantum process tomography requires an exponential amount of resources, and thus is not practical even for relatively small devices. We solve this problem by demonstrating that twirling experiments previously used to characterize the average fidelity of quantum memories efficiently can be easily adapted to estimate the average fidelity of the experimental implementation of important quantum computation processes, such as unitaries in the Clifford group, in a practical and efficient manner with applicability in current quantum devices. Using this procedure, we demonstrate state-of-the-art coherent control of an ensemble of magnetic moments of nuclear spins in a single crystal solid by implementing the encoding operation for a 3-qubit code with only a 1% degradation in average fidelity discounting preparation and measurement errors. We also highlight one of the advances that was instrumental in achieving such high fidelity control.

Quantum rendering

NASA Astrophysics Data System (ADS)

Lanzagorta, Marco O.; Gomez, Richard B.; Uhlmann, Jeffrey K.

2003-08-01

In recent years, computer graphics has emerged as a critical component of the scientific and engineering process, and it is recognized as an important computer science research area. Computer graphics are extensively used for a variety of aerospace and defense training systems and by Hollywood's special effects companies. All these applications require the computer graphics systems to produce high quality renderings of extremely large data sets in short periods of time. Much research has been done in "classical computing" toward the development of efficient methods and techniques to reduce the rendering time required for large datasets. Quantum Computing's unique algorithmic features offer the possibility of speeding up some of the known rendering algorithms currently used in computer graphics. In this paper we discuss possible implementations of quantum rendering algorithms. In particular, we concentrate on the implementation of Grover's quantum search algorithm for Z-buffering, ray-tracing, radiosity, and scene management techniques. We also compare the theoretical performance between the classical and quantum versions of the algorithms.

Research on Quantum Algorithms at the Institute for Quantum Information

DTIC Science & Technology

2009-10-17

accuracy threshold theorem for the one-way quantum computer. Their proof is based on a novel scheme, in which a noisy cluster state in three spatial...detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated...proved quantum threshold theorems for long-range correlated non-Markovian noise, for leakage faults, for the one-way quantum computer, for postselected

Increasing complexity with quantum physics.

PubMed

Anders, Janet; Wiesner, Karoline

2011-09-01

We argue that complex systems science and the rules of quantum physics are intricately related. We discuss a range of quantum phenomena, such as cryptography, computation and quantum phases, and the rules responsible for their complexity. We identify correlations as a central concept connecting quantum information and complex systems science. We present two examples for the power of correlations: using quantum resources to simulate the correlations of a stochastic process and to implement a classically impossible computational task.

Quantum Computer Games: Schrodinger Cat and Hounds

ERIC Educational Resources Information Center

Gordon, Michal; Gordon, Goren

2012-01-01

The quantum computer game "Schrodinger cat and hounds" is the quantum extension of the well-known classical game fox and hounds. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. "Schrodinger cat and hounds" demonstrates the effects of superposition, destructive and constructive interference, measurements and…

Quo vadis: Hydrologic inverse analyses using high-performance computing and a D-Wave quantum annealer

NASA Astrophysics Data System (ADS)

O'Malley, D.; Vesselinov, V. V.

2017-12-01

Classical microprocessors have had a dramatic impact on hydrology for decades, due largely to the exponential growth in computing power predicted by Moore's law. However, this growth is not expected to continue indefinitely and has already begun to slow. Quantum computing is an emerging alternative to classical microprocessors. Here, we demonstrated cutting edge inverse model analyses utilizing some of the best available resources in both worlds: high-performance classical computing and a D-Wave quantum annealer. The classical high-performance computing resources are utilized to build an advanced numerical model that assimilates data from O(10^5) observations, including water levels, drawdowns, and contaminant concentrations. The developed model accurately reproduces the hydrologic conditions at a Los Alamos National Laboratory contamination site, and can be leveraged to inform decision-making about site remediation. We demonstrate the use of a D-Wave 2X quantum annealer to solve hydrologic inverse problems. This work can be seen as an early step in quantum-computational hydrology. We compare and contrast our results with an early inverse approach in classical-computational hydrology that is comparable to the approach we use with quantum annealing. Our results show that quantum annealing can be useful for identifying regions of high and low permeability within an aquifer. While the problems we consider are small-scale compared to the problems that can be solved with modern classical computers, they are large compared to the problems that could be solved with early classical CPUs. Further, the binary nature of the high/low permeability problem makes it well-suited to quantum annealing, but challenging for classical computers.

Quantum computing: In the 'death zone'?

NASA Astrophysics Data System (ADS)

van Dam, Wim

2007-04-01

An event advertised as the first demonstration of a commercial quantum computer raises the question of how far one can go with a 'do not care' attitude towards imperfections, without losing the quantum advantage.

Conclusion.

ERIC Educational Resources Information Center

Johnston, Whittle

1990-01-01

Examines the foreign policy of the Reagan administration. Discusses the critics of the Reagan doctrine, focusing on the criticisms launched against his weapons' policies. Analyzes the policy course of the Intermediate Range Nuclear Forces (INF) Treaty, outlining goals of the administration during the INF negotiations. Contends that Reagan's…

Draft Genome Sequence of Enterococcus hirae Strain INF E1 Isolated from Cultured Milk.

PubMed

Porcellato, Davide; Ostlie, Hilde M; Skeie, Siv B

2014-07-17

Here, we present the draft genome of Enterococcus hirae INF E1, found as a contaminant in cultured milk and studied for its ability to metabolize milk fat globule membrane glycoconjugates. Copyright © 2014 Porcellato et al.

Quantum Computation Using Optically Coupled Quantum Dot Arrays

NASA Technical Reports Server (NTRS)

Pradhan, Prabhakar; Anantram, M. P.; Wang, K. L.; Roychowhury, V. P.; Saini, Subhash (Technical Monitor)

1998-01-01

A solid state model for quantum computation has potential advantages in terms of the ease of fabrication, characterization, and integration. The fundamental requirements for a quantum computer involve the realization of basic processing units (qubits), and a scheme for controlled switching and coupling among the qubits, which enables one to perform controlled operations on qubits. We propose a model for quantum computation based on optically coupled quantum dot arrays, which is computationally similar to the atomic model proposed by Cirac and Zoller. In this model, individual qubits are comprised of two coupled quantum dots, and an array of these basic units is placed in an optical cavity. Switching among the states of the individual units is done by controlled laser pulses via near field interaction using the NSOM technology. Controlled rotations involving two or more qubits are performed via common cavity mode photon. We have calculated critical times, including the spontaneous emission and switching times, and show that they are comparable to the best times projected for other proposed models of quantum computation. We have also shown the feasibility of accessing individual quantum dots using the NSOM technology by calculating the photon density at the tip, and estimating the power necessary to perform the basic controlled operations. We are currently in the process of estimating the decoherence times for this system; however, we have formulated initial arguments which seem to indicate that the decoherence times will be comparable, if not longer, than many other proposed models.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Proctor, Timothy; Giulian, Melissa; Korolkova, Natalia

Although qubits are the leading candidate for the basic elements in a quantum computer, there are also a range of reasons to consider using higher-dimensional qudits or quantum continuous variables (QCVs). In this paper, we use a general “quantum variable” formalism to propose a method of quantum computation in which ancillas are used to mediate gates on a well-isolated “quantum memory” register and which may be applied to the setting of qubits, qudits (for d>2), or QCVs. More specifically, we present a model in which universal quantum computation may be implemented on a register using only repeated applications of amore » single fixed two-body ancilla-register interaction gate, ancillas prepared in a single state, and local measurements of these ancillas. In order to maintain determinism in the computation, adaptive measurements via a classical feed forward of measurement outcomes are used, with the method similar to that in measurement-based quantum computation (MBQC). We show that our model has the same hybrid quantum-classical processing advantages as MBQC, including the power to implement any Clifford circuit in essentially one layer of quantum computation. In some physical settings, high-quality measurements of the ancillas may be highly challenging or not possible, and hence we also present a globally unitary model which replaces the need for measurements of the ancillas with the requirement for ancillas to be prepared in states from a fixed orthonormal basis. In conclusion, we discuss settings in which these models may be of practical interest.« less

Holonomic quantum computation in the presence of decoherence.

PubMed

Fuentes-Guridi, I; Girelli, F; Livine, E

2005-01-21

We present a scheme to study non-Abelian adiabatic holonomies for open Markovian systems. As an application of our framework, we analyze the robustness of holonomic quantum computation against decoherence. We pinpoint the sources of error that must be corrected to achieve a geometric implementation of quantum computation completely resilient to Markovian decoherence.

Hybrid annealing: Coupling a quantum simulator to a classical computer

NASA Astrophysics Data System (ADS)

Graß, Tobias; Lewenstein, Maciej

2017-05-01

Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Annealing strategies, either classical or quantum, explore the configuration space by evolving the system under the influence of thermal or quantum fluctuations. The thermal annealing dynamics can rapidly freeze the system into a low-energy configuration, and it can be simulated well on a classical computer, but it easily gets stuck in local minima. Quantum annealing, on the other hand, can be guaranteed to find the true ground state and can be implemented in modern quantum simulators; however, quantum adiabatic schemes become prohibitively slow in the presence of quasidegeneracies. Here, we propose a strategy which combines ideas from simulated annealing and quantum annealing. In such a hybrid algorithm, the outcome of a quantum simulator is processed on a classical device. While the quantum simulator explores the configuration space by repeatedly applying quantum fluctuations and performing projective measurements, the classical computer evaluates each configuration and enforces a lowering of the energy. We have simulated this algorithm for small instances of the random energy model, showing that it potentially outperforms both simulated thermal annealing and adiabatic quantum annealing. It becomes most efficient for problems involving many quasidegenerate ground states.

Emulation of complex open quantum systems using superconducting qubits

NASA Astrophysics Data System (ADS)

Mostame, Sarah; Huh, Joonsuk; Kreisbeck, Christoph; Kerman, Andrew J.; Fujita, Takatoshi; Eisfeld, Alexander; Aspuru-Guzik, Alán

2017-02-01

With quantum computers being out of reach for now, quantum simulators are alternative devices for efficient and accurate simulation of problems that are challenging to tackle using conventional computers. Quantum simulators are classified into analog and digital, with the possibility of constructing "hybrid" simulators by combining both techniques. Here we focus on analog quantum simulators of open quantum systems and address the limit that they can beat classical computers. In particular, as an example, we discuss simulation of the chlorosome light-harvesting antenna from green sulfur bacteria with over 250 phonon modes coupled to each electronic state. Furthermore, we propose physical setups that can be used to reproduce the quantum dynamics of a standard and multiple-mode Holstein model. The proposed scheme is based on currently available technology of superconducting circuits consist of flux qubits and quantum oscillators.

Open Quantum Walks and Dissipative Quantum Computing

NASA Astrophysics Data System (ADS)

Petruccione, Francesco

2012-02-01

Open Quantum Walks (OQWs) have been recently introduced as quantum Markov chains on graphs [S. Attal, F. Petruccione, C. Sabot, and I. Sinayskiy, E-print: http://hal.archives-ouvertes.fr/hal-00581553/fr/]. The formulation of the OQWs is exclusively based upon the non-unitary dynamics induced by the environment. It will be shown that OQWs are a very useful tool for the formulation of dissipative quantum computing and quantum state preparation. In particular, it will be shown how to implement single qubit gates and the CNOT gate as OQWs on fully connected graphs. Also, OQWS make possible the dissipative quantum state preparation of arbitrary single qubit states and of all two-qubit Bell states. Finally, it will be shown how to reformulate efficiently a discrete time version of dissipative quantum computing in the language of OQWs.

Characterizing and engineering tunable spin functionality inside indium arsenide/gallium arsenide quantum dot molecules

NASA Astrophysics Data System (ADS)

Liu, Weiwen

The continual downsizing of the basic functional units used in the electronics industry has motivated the study of the quantum computation and related topics. To overcome the limitations of classical physics and engineering, some unique quantum mechanical features, especially entanglement and superpositions have begun to be considered as important properties for future bits. Including these quantum mechanical features is attractive because the ability to utilize quantum mechanics can dramatically enhance computational power. Among the various ways of constructing the basic building blocks for quantum computation, we are particularly interested in using spins inside epitaxially grown InAs/GaAs quantum dot molecules as quantum bits (qubits). The ability to design and engineer nanostructures with tailored quantum properties is critical to engineering quantum computers and other novel electro-optical devices and is one of the key challenges for scaling up new ideas for device application. In this thesis, we will focus on how the structure and composition of quantum dot molecules can be used to control spin properties and charge interactions. Tunable spin and charge properties can enable new, more scalable, methods of initializing and manipulating quantum information. In this thesis, we demonstrate one method to enable electric-field tunability of Zeeman splitting for a single electron spin inside a quantum dot molecules by using heterostructure engineering techniques to modify the barrier that separates quantum dots. We describe how these structural changes to the quantum dot molecules also change charge interactions and propose ways to use this effect to enable accurate measurement of coulomb interactions and possibly charge occupancy inside these complicated quantum dot molecules.

Drug-specific risk of tuberculosis in patients with rheumatoid arthritis treated with anti-TNF therapy: results from the British Society for Rheumatology Biologics Register (BSRBR).

PubMed

Dixon, W G; Hyrich, K L; Watson, K D; Lunt, M; Galloway, J; Ustianowski, A; Symmons, D P M

2010-03-01

The risk of tuberculosis (TB) in patients with rheumatoid arthritis (RA) is thought to be increased following anti-tumour necrosis factor (anti-TNF) therapy, with a proposed differential risk between the anti-TNF drugs etanercept (ETA), infliximab (INF) and adalimumab (ADA). To compare directly the risk between drugs, to explore time to event, site of infection and the role of ethnicity. Data from the British Society for Rheumatology Biologics Register (BSRBR), a national prospective observational study, were used to compare TB rates in 10 712 anti-TNF treated patients (3913 ETA, 3295 INF, 3504 ADA) and 3232 patients with active RA treated with traditional disease-modifying antirheumatic drugs. To April 2008, 40 cases of TB were reported, all in the anti-TNF cohort. The rate of TB was higher for the monoclonal antibodies ADA (144 events/100,000 person-years) and INF (136/100,000 person-years) than for ETA (39/100,000 person-years). After adjustment, the incidence rate ratio compared with ETA-treated patients was 3.1 (95% CI 1.0 to 9.5) for INF and 4.2 (1.4 to 12.4) for ADA. The median time to event was lowest for INF (5.5 months) compared with ETA (13.4 months) and ADA (18.5 months). 13/40 cases occurred after stopping treatment. 25/40 (62%) cases were extrapulmonary, of which 11 were disseminated. Patients of non-white ethnicity had a sixfold increased risk of TB compared with white patients treated with anti-TNF therapy. The rate of TB in patients with RA treated with anti-TNF therapy was three- to fourfold higher in patients receiving INF and ADA than in those receiving ETA.

Co-Encapsulating the Fusogenic Peptide INF7 and Molecular Imaging Probes in Liposomes Increases Intracellular Signal and Probe Retention

PubMed Central

Martin, Erik W.; Li, Changqing; Lu, Wuyuan; Kao, Joseph P. Y.

2015-01-01

Liposomes are promising vehicles to deliver diagnostic and therapeutic agents to cells in vivo. After uptake into cells by endocytosis, liposomes are degraded in the endolysosomal system. Consequently, the encapsulated cargo molecules frequently remain sequestered in endosomal compartments; this limits their usefulness in many applications (e.g. gene delivery). To overcome this, various fusogenic peptides have been developed to facilitate delivery of liposomally-encapsulated molecules into the cytosol. One such peptide is the pH-sensitive influenza-derived peptide INF7. Liposomal delivery of imaging agents is an attractive approach for enabling cell imaging and cell tracking in vivo, but can be hampered by inadequate intracellular accumulation and retention of probes caused by exocytosis (and possible degradation) of endosome-entrapped probes. Such signal loss could be minimized by facilitating escape of probe molecules from endolysosomal compartments into the cytosol. We investigated the ability of co-encapsulated INF7 to release liposomally-delivered rhodamine fluorophores into the cytosol after endosomal acidification/maturation. We co-encapsulated INF7 and fluorescent rhodamine derivatives having vastly different transport properties to show that after endocytosis by CV1 cells, the INF7 peptide is activated by acidic endosomal pH and facilitates efficient release of the fluorescent tracers into the cytosol. Furthermore, we show that INF7-facilitated escape from endosomes markedly enhanced retention of tracers that cannot be actively extruded from the cytosol. Minimizing loss of intracellular probes improves cellular imaging by increasing the signal-to-noise ratio of images and lengthening the time window that imaging can be performed. In particular, this will enhance in vivo electron paramagnetic resonance imaging, an emergent magnetic resonance imaging modality requires exogenous paramagnetic imaging agents and is highly promising for cellular and molecular imaging. PMID:25816348

Can pegylated interferon improve the outcome of polycythemia vera patients?

PubMed

Crisà, Elena; Cerrano, Marco; Beggiato, Eloise; Benevolo, Giulia; Lanzarone, Giuseppe; Manzini, Paola Maria; Borchiellini, Alessandra; Riera, Ludovica; Boccadoro, Mario; Ferrero, Dario

2017-01-13

Pegylated interferon (peg-IFN) was proven by phase II trials to be effective in polycythemia vera (PV); however, it is not clear whether it could improve patient outcome compared to hydroxyurea (HU). Here, we present an observational study on 65 PV patients aged 65 years or younger, who received either peg-IFN (30) or HU (35) according to the physician choice. Median follow-up was 75 months. The two cohorts were comparable for patient and disease characteristics. Eighty-seven percent of the patients treated with peg-INF responded, with a CR rate of 70% as compared to 100 and 49% with HU, respectively. Discontinuation rate was similar in the two groups (20% in peg-IFN vs 17% in HU). JAK2 allele burden was monitored in peg-INF arm only, and a reduction was observed in 88% of the patients. No thrombotic events were observed during peg-IFN treatment compared to three on HU. Disease progression to myelofibrosis or acute myeloid leukemia occurred to a patient only in peg-INF, compared to three in HU. Overall, three second malignancies were observed during the study, two in patients who received HU only, and one in a patient largely treated HU who received also peg-IFN for 3 months. Overall survival was significantly better for peg-IFN patients compared to HU, p = 0.027. Our study, albeit limited by small patient and event number and lack of randomization, confirms the efficacy of peg-INF in PV and shows a significant survival advantage for peg-INF-treated patients. Waiting for confirming data from the ongoing phase III trials, our study can support peg-INF as a first-line treatment option for PV, at least for younger patients.

Recent Results on Singularity Strengths

NASA Astrophysics Data System (ADS)

Nolan, Brien

2002-12-01

In this contribution, we review some recent results on strengths of singularities. In a space-time (M,g), let γ[τ0, 0) → M be an incomplete, inextendible causal geodesic, affinely parametrised by τ, tangent ěc k. Let Jτ1 :=set of Jacobi fields along γ, orthogonal to γ and vanishing at time τ1 ≥ τ0 i.e. ěc ξ ∈ J{τ 1 } iff D2ξa = -Rbcdakbkdξc, gabξakb = 0, and ěc ξ (τ 1 ) = 0. Vτ1(τ) := volume element defined by full set of independent elements of Jτ1 (2-dim for null geodesies, 3-dim for time-like); Vτ1 := ∥Vτ1∥. Definition (Tipler 1977): γ terminates in a gravitationally strong singularity if for all 0 > τ1 ≥ τ0, lim infτ→0- Vτ1(τ) = 0. γ... gravitationally weak ... lim infτ→0- Vτ1(τ) > 0. The interpretation is that at a strong singularity, an extended body, e.g. a gravitational wave detector, is crushed to zero volume by the singularity. Tipler's definition does not take account of the possibility that (i) V → ∞ or (ii) V → finite, non-zero value, but with infinite stretching/crushing in orthogonal directions ('spaghettifying singularity'). Extended definition (Nolan 1999): strong if either V → 0,∞ or if for every τ1, there is an element ěc ξ of Jτ1 satisfying ||ěc ξ || -> 0. Otherwise weak. (Ori 2000): singularity is 'deformationally strong' if either (i) it is Tipler-strong or (ii) for every τ1, there is an element ěc ξ of Jτ1 satisfying ||ěc ξ || -> ∞ . Otherwise, deformationally weak...

InfAcrOnt: calculating cross-ontology term similarities using information flow by a random walk.

PubMed

Cheng, Liang; Jiang, Yue; Ju, Hong; Sun, Jie; Peng, Jiajie; Zhou, Meng; Hu, Yang

2018-01-19

Since the establishment of the first biomedical ontology Gene Ontology (GO), the number of biomedical ontology has increased dramatically. Nowadays over 300 ontologies have been built including extensively used Disease Ontology (DO) and Human Phenotype Ontology (HPO). Because of the advantage of identifying novel relationships between terms, calculating similarity between ontology terms is one of the major tasks in this research area. Though similarities between terms within each ontology have been studied with in silico methods, term similarities across different ontologies were not investigated as deeply. The latest method took advantage of gene functional interaction network (GFIN) to explore such inter-ontology similarities of terms. However, it only used gene interactions and failed to make full use of the connectivity among gene nodes of the network. In addition, all existent methods are particularly designed for GO and their performances on the extended ontology community remain unknown. We proposed a method InfAcrOnt to infer similarities between terms across ontologies utilizing the entire GFIN. InfAcrOnt builds a term-gene-gene network which comprised ontology annotations and GFIN, and acquires similarities between terms across ontologies through modeling the information flow within the network by random walk. In our benchmark experiments on sub-ontologies of GO, InfAcrOnt achieves a high average area under the receiver operating characteristic curve (AUC) (0.9322 and 0.9309) and low standard deviations (1.8746e-6 and 3.0977e-6) in both human and yeast benchmark datasets exhibiting superior performance. Meanwhile, comparisons of InfAcrOnt results and prior knowledge on pair-wise DO-HPO terms and pair-wise DO-GO terms show high correlations. The experiment results show that InfAcrOnt significantly improves the performance of inferring similarities between terms across ontologies in benchmark set.

Inhaled methoxyflurane and intranasal fentanyl for prehospital management of visceral pain in an Australian ambulance service.

PubMed

Johnston, Steven; Wilkes, Garry J; Thompson, Jennifer A; Ziman, Mel; Brightwell, Richard

2011-01-01

This study analysed the analgesic effect and changes in vital signs associated with administration of inhaled Methoxyflurane (MTX) and/or intranasal Fentanyl (INF) for prehospital management of visceral pain. A retrospective, observational study reviewing 1024 randomly selected records of patients with presumed visceral pain administered MTX (465), INF (397) or both (162) by the Western Australian Ambulance Service between January 2004 and February 2006. Clinical variables assessed included systolic blood pressure, pulse rate, respiration rate and Glasgow Coma Scale score. Pain was assessed utilising Visual/Verbal Analogue Scale pain scores. Overall effects on vital signs appeared favourable 5 min after use and at hospital arrival with either agent alone or in combination. As sole agents, MTX produced the greatest initial pain scores reduction (2.0 (1.7 to 2.2) vs 1.6 (1.4 to 1.8)) (mean (95% CI), and INF provided greater pain reduction by hospital arrival (3.2 (2.9 to 3.5) vs 2.5 (2.1 to 2.9)). While both agents were effective, INF provided a greater pain score reduction for cardiac (3.0 (2.6 to 3.4) vs 2.3 (1.8 to 2.8)), female (3.4 (2.9 to 4.0) v 2.5 (2.0 to 3.0)) and age 75+ patients (3.2 (2.5 to 3.8) vs 1.8 (1.0 to 2.5)). Combined use of agents was not advantageous. MTX and INF are effective agents for providing visceral pain analgesia in the prehospital setting. While MTX provided a more rapid onset of pain relief, INF provided superior analgesia after subsequent doses and in female, cardiac and older patients.