Search results for "Unitary state"

showing 10 items of 133 documents

Heavy-quark spin symmetry for charmed and strange baryon resonances

2013

We study charmed and strange odd-parity baryon resonances that are generated dynamically by a unitary baryon-meson coupled-channels model which incorporates heavy-quark spin symmetry. This is accomplished by extending the SU(3) Weinberg-Tomozawa chiral Lagrangian to SU(8) spin-flavor symmetry plus a suitable symmetry breaking. The model generates resonances with negative parity from the s-wave interaction of pseudoscalar and vector mesons with 1/2(+) and 3/2(+) baryons in all the isospin, spin, and strange sectors with one, two, and three charm units. Some of our results can be identified with experimental data from several facilities, such as the CLEO, Belle, or BaBar Collaborations, as we…

DYNAMICSQuarkNuclear and High Energy PhysicsParticle physicsCharmNuclear TheoryMesonNuclear TheoryFOS: Physical sciences01 natural sciencesUnitary stateHeavy-quark spin symmetryNuclear Theory (nucl-th)High Energy Physics - Phenomenology (hep-ph)MESON-EXCHANGE0103 physical sciencesSymmetry breakingNuclear Experiment (nucl-ex)010306 general physicsNuclear ExperimentNuclear ExperimentPhysics010308 nuclear & particles physicsDynamically generated baryon resonancesHigh Energy Physics::PhenomenologyFísicaParity (physics)COUPLED-CHANNELBaryonPseudoscalarHigh Energy Physics - PhenomenologyIsospinHigh Energy Physics::Experiment
researchProduct

Unavoidable sets and circular splicing languages

2017

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. They are defined by a finite alphabet A, an initial set I of circular words, and a set R of rules. In this paper, we focus on the still unknown relations between regular languages and circular splicing systems with a finite initial set and a finite set R of rules represented by a pair of letters ( ( 1 , 3 ) -CSSH systems). When R = A × A , it is known that the set of all words corresponding to the splicing language belongs to the class of pure unitary languages, introduced by Ehrenfeucht, Haussler, Rozenberg in 1983. They also provided a characteriza…

Discrete mathematicsClass (set theory)General Computer ScienceRegular languages; Circular splicing systems; Unavoidable sets0102 computer and information sciences02 engineering and technologyRegular languagesCharacterization (mathematics)01 natural sciencesUnitary stateTheoretical Computer ScienceFocus (linguistics)Set (abstract data type)CombinatoricsRegular language010201 computation theory & mathematicsUnavoidable sets0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingFinite setGenerative grammarCircular splicing systemsMathematicsTheoretical Computer Science
researchProduct

On point-irreducible projective lattice geometries

1994

Within the conceptual frame of projective lattice geometry (as introduced in [5]) we are considering the class of all point-irreducible geometries. In the algebraic context these geometries are closely connected with unitary modules over local rings. Besides several synthetic investigations we obtain a lattice-geometric characterization of free left modules over right chain rings which allows a purely lattice-theoretic version in the Artinian case.

Discrete mathematicsClass (set theory)Pure mathematicsLattice (module)Chain (algebraic topology)Local ringContext (language use)Point (geometry)Geometry and TopologyAlgebraic numberUnitary stateMathematicsJournal of Geometry
researchProduct

Nondeterministic Unitary OBDDs

2017

We investigate the width complexity of nondeterministic unitary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically “cheap” functions that are “expensive” for NUOBDDs and vice versa by improving the previous gap. We also present a function for which neither classical nor unitary nondeterminism does help. Moreover, based on our results, we present a width hierarchy for NUOBDDs. Lastly, we provide the bounds on the widths of NUOBDDs for the basic Boolean operations negation, union, and intersection.

Discrete mathematicsHierarchy (mathematics)Intersection (set theory)010102 general mathematics0102 computer and information sciencesFunction (mathematics)Computer Science::Computational Complexity01 natural sciencesUpper and lower boundsUnitary stateNondeterministic algorithmCombinatoricsNegation010201 computation theory & mathematicsBoolean operations in computer-aided design0101 mathematicsMathematics
researchProduct

Error-Free Affine, Unitary, and Probabilistic OBDDs

2018

We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las Vegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results for the automata versions of these models.

Discrete mathematicsQuadratic growthLas vegas010102 general mathematicsProbabilistic logic02 engineering and technologyComputer Science::Computational ComplexityComputer Science::Artificial Intelligence01 natural sciencesUnitary stateAutomatonSuccinctnessComputer Science::Logic in Computer Science0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingAffine transformation0101 mathematicsComputer Science::DatabasesZero errorMathematics
researchProduct

Nonmalleable encryption of quantum information

2008

We introduce the notion of "non-malleability" of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we demand that no controlled modification of the encrypted state can be effected. We show that such a scheme is equivalent to a "unitary 2-design" [Dankert et al.], as opposed to normal encryption which is a unitary 1-design. Our other main results include a new proof of the lower bound of (d^2-1)^2+1 on the number of unitaries in a 2-design [Gross et al.], which lends itself to a generalization to approximate 2-design. Furthermore, while in prime power dimension there is a unitary 2-design with =…

Discrete mathematicsQuantum Physicsbusiness.industryDimension (graph theory)FOS: Physical sciencesStatistical and Nonlinear PhysicsState (functional analysis)Encryption01 natural sciencesUnitary stateUpper and lower bounds010305 fluids & plasmasQuantum state0103 physical sciencesQuantum informationQuantum Physics (quant-ph)010306 general physicsbusinessPrime powerMathematical PhysicsComputer Science::Cryptography and SecurityMathematicsJournal of Mathematical Physics
researchProduct

Error-Free Affine, Unitary, and Probabilistic OBDDs

2021

We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las-Vegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results for the automata counterparts of these models.

Discrete mathematicsState complexityComputer Science::Logic in Computer ScienceComputer Science (miscellaneous)Probabilistic logicAffine transformationComputer Science::Computational ComplexityComputer Science::Artificial IntelligenceUnitary stateComputer Science::DatabasesMathematicsZero errorInternational Journal of Foundations of Computer Science
researchProduct

Energy Equalization and the Case of the “nZEB Hotels”

2020

Nowadays, energy equalization is one of the many issues concerning the energy policies on the urban scale and in the perspective of reducing the Urban Heat Island effects (UHI-e). The different economic-financial profiles of the interventions implemented in the buildings having a wide range of climatic locations, typological arrangements, architectural-historical constraints, need to be coordinated within unitary local energy-environmental policies inspired by economic-financial as well as environmental issues. The renovation of existing hotels to achieve a nearly Zero-Energy performance is one of the goals of the 2050 EU’s energy policy. This paper presents the nZEB retrofit case of an exi…

EnergyComputer scienceEqualization (audio)Economic analysisEnvironmental economicsUnitary stateHotelsEnergy policyHotelEffective energyOrder (exchange)nZEBSettore ICAR/22 - EstimoUrban scaleUrban heat islandEnergy (signal processing)
researchProduct

Supervised Quantum Learning without Measurements

2017

We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation that introduces feedback in the dynamics and eliminates the necessity of intermediate measurements. The performance of the quantum algorithm is analyzed by comparing the results obtained in numerical simulations with the outcome of classical machine learning methods for the same problem. The use of time-delayed equations enhances the toolbox of the field of quantum machine learning, which may enable unprecedented applications in quantum technologies. The…

FOS: Computer and information sciencesQuantum machine learningField (physics)Computer Science - Artificial IntelligenceComputer sciencelcsh:MedicineFOS: Physical sciencesMachine Learning (stat.ML)01 natural sciencesUnitary stateArticle010305 fluids & plasmasSuperconductivity (cond-mat.supr-con)Statistics - Machine Learning0103 physical sciencesMesoscale and Nanoscale Physics (cond-mat.mes-hall)lcsh:Science010306 general physicsQuantumProtocol (object-oriented programming)Quantum PhysicsClass (computer programming)MultidisciplinaryCondensed Matter - Mesoscale and Nanoscale PhysicsCondensed Matter - Superconductivitylcsh:RQuantum technologyArtificial Intelligence (cs.AI)ComputerSystemsOrganization_MISCELLANEOUSlcsh:QQuantum algorithmQuantum Physics (quant-ph)Algorithm
researchProduct

Masslessness in n-Dimensions

1998

We determine the representations of the ``conformal'' group ${\bar{SO}}_0(2, n)$, the restriction of which on the ``Poincar\'e'' subgroup ${\bar{SO}}_0(1, n-1).T_n$ are unitary irreducible. We study their restrictions to the ``De Sitter'' subgroups ${\bar{SO}}_0(1, n)$ and ${\bar{SO}}_0(2, n-1)$ (they remain irreducible or decompose into a sum of two) and the contraction of the latter to ``Poincar\'e''. Then we discuss the notion of masslessness in $n$ dimensions and compare the situation for general $n$ with the well-known case of 4-dimensional space-time, showing the specificity of the latter.

High Energy Physics - TheoryCombinatoricsPhysicsHigh Energy Physics - Theory (hep-th)FOS: Physical sciencesStatistical and Nonlinear PhysicsUnitary stateMathematical PhysicsReviews in Mathematical Physics
researchProduct