NP Problem in Quantum Algorithm

In complexity theory, a famous unsolved problem is whether NP is equal to P or not. In this paper, we discuss this aspect in SAT (satisfiability) problem, and it is shown that SAT can be solved in polynomial time by means of a quantum algorithm if the superposition of two orthogonal vectors |0> and |1> prepared is detected physically.     

Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP

When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a communications channel on which it is impossible in principle to eavesdrop without a high probability of being detected. With such a channel, a one-time pad can safely be reused many times as long as no eavesdrop is detected, and, planning ahead, part of the capacity of these uncompromised transmissions can be used to send fresh random bits with which to replace the one-time pad when an eavesdrop finally is detected. Unlike other schemes for stretching a one-time pad, this scheme does not depend on complexity-theoretic assumptions such as the difficulty of factoring.     

Inverse NP Problems

The inverse problem relative to a verifier V of proofs of membership for a NP language is the problem of deciding, given a set π of proofs, whether or not there exists a string x having exactly π as its set of proofs. In this paper, we study the complexity of inverse problems. We develop a new notion of reduction which allows one to compare the complexity of inverse problems. Using this notion, we classify as coNP-complete the inverse problems for the “natural” verifiers of many NP-complete problems. We also show that the inverse complexity of a verifier for a language L cannot be predicted solely from the complexity of L, but rather, is highly dependent upon the choice of verifier used to accept L. In this context, a verifier with a Σ₂ ^p -complete inverse problem is exhibited, giving a new and natural example of a Σ₂ ^p -complete problem.      

新型多分力传感器

介绍一种多分力传感器的新型结构模式,提供了应变片组件的粘贴模式及多种实用电路,并标明实用电阻值参数.新结构能消除分力之间相互干扰,能检测Fx、Fy、Mx、My、Mz 5个分力,精度高,结构简单,制造成本低.     

NP-Creative sets: A new class of creative sets in NP

We obtain a new definition of creativeness for NP, called NP-creativeness. We show that all NP-creative sets are NP-complete and provide strong evidence that all known NP-complete sets are NP-creative. We also show that all NP-creative sets are complete under exponentially honest reductions and contain an infinite NP subset in their complement (in other words, they are not NP-simple). A preliminary version of this paper was presented at the Eleventh Conference on Foundation of Software Technology and Theoretical Computer Science, India.     

A Minimum-Disturbing Quantum State Discriminator

We propose two experimental schemes for quantum state discrimination that achieve the optimal tradeoff between the probability of correct identification and the disturbance on the quantum state. Presented at the 38th Symposium on Mathematical Physics “Quantum Entanglement & Geometry”, Toruń, June 4–7, 2006.     

A Quantum Theory of Consciousness

The relationship between quantum collapse and consciousness is reconsidered under the assumption that quantum collapse is an objective dynamical process. We argue that the conscious observer can have a distinct role from the physical measuring device during the process of quantum collapse owing to the intrinsic nature of consciousness; the conscious observer can know whether he is in a definite state or a quantum superposition of definite states, while the physical measuring device cannot “know”. As a result, the consciousness observer can distinguish the definite states and their quantum superposition, while the physical measuring device without consciousness cannot do. This provides a possible quantum physical method to distinguish man and machine. The new result also implies that consciousness has causal efficacies in the physical world when considering the existence of quantum collapse. Accordingly consciousness is not reducible or emergent, but a new fundamental property of matter. This may establish a quantum basis for panpsychism, and make it be a promising solution to the hard problem of consciousness. Furthermore, it is suggested that a unified theory of matter and consciousness includes two parts: one is the psychophysical principle or corresponding principle between conscious content and matter state, and the other is the complete quantum evolution of matter state, which includes the definite nonlinear evolution element introduced by consciousness and relating to conscious content. Lastly, some experimental schemes are presented to test the proposed quantum theory of consciousness.

An arithmetical characterization of NP

Adleman and Manders (Proc. 17th IEEE Symposium on Foundations of Computer Science, 1976) obtained a near characterization of NP using Diophantine predicates with quantifier bounds. We characterize NP as the class of sets definable by a polynomial predicate preceded by a string of quantifiers where each universal variable has a bound of the form p(|n|) and each existential variable has a bound of the form 2^q(|n|) for input n and polynomials p and q.     

互补MOSFET的脉冲变压器隔离驱动电路设计

随着MOSFET的应用日益广泛,在一些特殊场合常常会使用到互补MOSFET。本文针对互补MOSFET的驱动问题进行了深入讨论,比较了常用的驱动电路,提出了一种针对互补MOSFET设计的新型驱动电路,并通过仿真验证了结果。     

半导体激光器驱动器输出电路的设计

本文提出了半导体激光器驱动器输出电路的设计方案,应用负反馈的原理来实现对输出电流的控制.本文阐述了半导体激光器驱动器输出电路的设计方法以及针对输出电路的仿真结果分析.结果表明驱动器输出电路即恒电流驱动电路的电路设计准确,可确保输出稳定的250mA电流.     

Implementing a Quantum Algorithm with Exchange-Coupled Quantum Dots: A Feasibility Study

We present Monte Carlo wavefunction simulations for quantum computations employing an exchange-coupled array of quantum dots. Employing a combination of experimentally and theoretically available parameters, we find that gate fidelities greater than 98% may be obtained with current experimental and technological capabilities. Application to an encoded 3 qubit (nine physical qubits) Deutsch-Josza computation indicates that the algorithmic fidelity is more a question of the total time to implement the gates than of the physical complexity of those gates. PACS: 81.07.Ta, 02.70.Ss, 03.67.Lx, 03.65.Yz     

Logical Definability of NP Optimization Problems

We investigate here NP optimization problems from a logical definability standpoint. We show that the class of optimization problems whose optima are definable using first-order formulae coincides with the class of polynomially bounded NP optimization problems on finite structures. After this, we analyze the relative expressive power of various classes of optimization problems that arise in this framework. Some of our results show that logical definability has different implications for NP maximization problems than it has for NP minimization problems, in terms of both expressive power and approximation properties.     

Empirical Validation Of A Performance-Based Innovation Process Model: A Case Of ERP

This study argues that models of the innovation process tacitly assume that outcome benefits will automatically ensue from the innovation. We argue that models of the innovation process should include a final stage: performance outcome. We distil the elements of key existing models of the innovation process into a simplified model that links key elements of the process to the ultimate performance impact. We test our simplified model for validity in the context of the introduction of an information system innovation, enterprise resource planning (ERP) systems. The data used for the testing were collected through a cross-sectional survey of a number of Australian organizations. The data were analyzed using partial least squares (PLS) to test the validity of the model. Our findings show that key stages in the innovation process, such as the successful adoption of ERP software, have a critical effect on each other and on output performance. In this study, we have empirically shown the commonly assumed positive nature of the relationship between the various stages of the innovation process. This has previously been supported only by common-sense conjecture and individual examples. Managers can use the simple process model we have developed to prioritize their installation and the management of the information system innovations underpinning the stages defined in the model.     

求列表极小值的量子算法

求列表极小值的算法具有广泛的应用。如果能够找到有效的求列表极小值的量子算法,那就可以找到求列表极大值的量子算法,从而与Grover量子搜索算法、求中值量子算法一起构成一套有效的量子算法体系。这些算法将构成用量子计算求解实际应用问题的核心和基础,并为量子算法的进一步研究提供坚实的基础。该文给出了一个时间复杂度为O(N√)的求列表极小值的量子算法。     

An inductive number-theoretic characterization of NP

It is shown that NP equals the closure of λxyz.z = x*y (* denotes concatenation of numbers in m-adic notation) under ∨, &, (?x)_Py, (?x)_Py, (?x)_?y, explicit transformation and substitution of λxy.x^¦y¦ for a variable, where ¦ denotes m-adic le ngth.     

一种可验证的量子匿名通信方案

提出一种新的消息发送者和接收者同时匿名的经典消息通信方案.方案通过制备量子连续变量纠缠态,在参与者中移动式传输粒子,将1比特经典消息编码在不同的模式中.消息接收者可以计算得到匿名消息,然后通过不同模式的计算结果检验本次通信中的参与者诚实度,从而判断匿名消息是否有效.方案将传输和检测两个过程合并设计在同一轮通信中,通信信号和检测结论基于同一轮通信中的信道编码,可以验证具有自适应特征的参与者(检测过程和通信过程表现不一致的参与者)作弊.除了指数小的概率,发送者和接收者的匿名性和消息的私密性都得到保护.