Filtry
wszystkich: 3887
wybranych: 3083
-
Katalog
- Publikacje 3083 wyników po odfiltrowaniu
- Czasopisma 56 wyników po odfiltrowaniu
- Konferencje 28 wyników po odfiltrowaniu
- Osoby 19 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Kursy Online 8 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 691 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: COMBINATORIAL BOUND
-
Combinatorial-topological framework for the analysis of global dynamics
Publikacja -
Selection of Effective HTRA3 Activators Using Combinatorial Chemistry
Publikacja -
Cyclic Peptidic Furin Inhibitors Developed by Combinatorial Chemistry
Publikacja -
Anab initiostudy of (H3B←NH3)−—a dipole-bound anion supported by the dative charge-transfer bond in the neutral host
Publikacja -
A dipole-bound dianion
Publikacja -
Design of selective substrates of proteinase 3 using combinatorial chemistry methods
Publikacja -
Extended Hopfield models of neural networks for combinatorial multiobjective optimization problems
Publikacja -
Dipole-bound and dispersion-bound anions supported by the asymmetric tautomers of aminophosphine: H3NPH and HNPH3
Publikacja -
Development of sensitive cathepsin G fluorogenic substrate using combinatorial chemistry methods
Publikacja -
A simple method for selection of trypsin chromogenic substrates using combinatorial chemistry approach
Publikacja -
Selection of New Chromogenic Substrates of Serine Proteinases Using Combinatorial Chemistry Methods
Publikacja -
12 [Chapter]. Bound entanglement
PublikacjaKwantowe splątanie jest jednym z podstawowych elementów kwantowej teorii informacji. Jak wiadomo niskowymiarowe (2otimes 2 i 2otimes 3) splątane stany kwantowe są zawsze destylowalne. W wyższych wymiarach jednak istnieją stany, które mimo, że są splątane nie pozwalają na destylację. Ten rodzaj splątania, nazywany związanym, jest często trudny do wykrycia i pozornie bezużyteczny. Jak pokazują jednak liczne badania splątanie związane...
-
Bi-dipole-bound anions
Publikacja -
The correlation-bound anion of p-chloroaniline
Publikacja -
Lower bound on the domination number of a tree.
PublikacjaW pracy przedstawiono dolne ograniczenie na liczbę dominowania w drzewach oraz przedstawiono pełną charakterystykę grafów ekstremalnych.
-
Secure key from bound entanglement
PublikacjaScharakteryzowaliśmy zestaw dzielonych kwantowych stanów, który zawiera kryptograficznie prywatny klucz. Pozwala nam to przerobić teorię prywatności jako paradygmat blisko związany z tą, która jest używana w manipulacjach splątania.
-
Dipole-bound anions supported by charge-transfer interaction: valence- and dipole-bound anionic states of H3N→BF3
Publikacja -
Rotationally invariant bipartite states and bound entanglement
PublikacjaW pracy rozważano stany kwantowe niezmiennicze na działanie grupy SO(3). Pokazano, że w przypadku, gdy pierwszy podukład ma parzysty wymiar większy lub równy cztery oraz drugi podukład ma wymiar dowolny, większy niż pierwszy to pośród takich stanów zawsze istnieje splątanie związane.
-
Theoretical study of the dipole-bound anion (HPPH3)−
Publikacja -
Is 9-acridinamine anion a dispersion-bound anion?
Publikacja -
Bound entanglement for continuous variables is a rare phenomenon
PublikacjaWykazano, że splątanie związane w przypadku zmiennych ciągłych jest rzadkimfenomenem. W szczególności pokazano, że zbiór stanów niedestylowalnych jestnigdzie gęsty w zbiorze wszystkich stanów kwantowych. Poddano dyskusji splą-tanie związane w kontekście liczby Schmidta.
-
On quantum cryptography with bipartite bound entangled states
PublikacjaOstatnio pokazano bezpośrednie zastosowanie splątania związanego w kryptografii kwantowej. W niniejszym artykule dokonano przeglądu niektórych najnowszych osiągnięć dotyczących tego zagadnienia. W szczególności przypomniano istotne pojęcia i definicje. Ponadto podano nową konstrukcję stanów o splątaniu związanym, posiadających bezpieczne korelacje, dostarczając w ten sposób niskowymiarowe (6x6) stany o splątaniu związanym z niezerowym...
-
Lower bound on the paired domination number of a tree
PublikacjaW pracy przedstawione jest ograniczenie dolne dla liczby dominowania parami oraz scharakteryzowane są wszystkie drzewa ekstremalne.
-
Quantum metrology: Heisenberg limit with bound entanglement
PublikacjaQuantum entanglement may provide a huge boost in the precision of parameter estimation. However, quantum metrology seems to be extremely sensitive to noise in the probe state. There is an important still open question: What type of entanglement is useful as a resource in quantum metrology? Here we raise this question in relation to entanglement distillation. We provide a counterintuitive example of a family of bound entangled states...
-
Multipartite secret key distillation and bound entanglement
PublikacjaRecently it has been shown that quantum cryptography beyond pure entanglement distillation is possible and a paradigm for the associated protocols has been established. Here we systematically generalize the whole paradigm to the multipartite scenario. We provide constructions of new classes of multipartite bound entangled states, i.e., those with underlying twisted Greenberger-Horne-Zeilinger (GHZ) structure and nonzero distillable...
-
Design of serine proteinase inhibitors by combinatorial chemistry using trypsin inhibitor SFTI‐1 as a starting structure
Publikacja -
Combinatorial scheme of finding minimal number of periodic points for smooth self-maps of simply connected manifolds
PublikacjaLet M be a closed smooth connected and simply connected manifold of dimension m at least 3, and let r be a fixed natural number. The topological invariant D^m_r [f], defined by the authors in [Forum Math. 21 (2009), 491-509], is equal to the minimal number of r-periodic points in the smooth homotopy class of f, a given self-map of M. In this paper, we present a general combinatorial scheme of computing D^m_r [f] for arbitrary dimension...
-
Fate of Dipole-Bound Anion States when Hydrated
Publikacja -
Is the p-chloroaniline anion bound almost entirely by correlation?
Publikacja -
Molecular dynamics of fentanyl bound to μ-opioid receptor
Publikacja -
On the lower smoothing bound in identification of time-varying systems
PublikacjaIn certain applications of nonstationary system identification the model-based decisions can be postponed, i.e. executed with a delay. This allows one to incorporate in the identification process not only the currently available information, but also a number of ''future'' data points. The resulting estimation schemes, which involve smoothing, are not causal. Assuming that the infinite observation history is available, the paper...
-
Lower bound on the weakly connected domination number of a tree
PublikacjaPraca dotyczy dolnego ograniczenia liczby dominowania słabo spójnego w drzewach (ograniczenie ze względu na ilość wierzchołków i ilość wierzchołków końcowych w drzewie).
-
On trees attaining an upper bound on the total domination number
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
A few steps more towards NPT bound entanglement
PublikacjaIn this paper, existence of bound entangled states with nonpositive partial transpose (NPT) is considered. As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover, it would rule out a simple mathematical description of the set of distillable states. The particular state, known to be 1-copy nondistillable and supposed to be bound entangled, is considered. The problem of...
-
Distinguishing views in symmetric networks: A tight lower bound
PublikacjaThe view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers n ≥ D ≥ 1, there exists a port-labeled network with at most n nodes and diameter at most D which contains a pair of nodes whose (infinite) views are different, but whose views truncated to depth Omega( D log(n/ D )) are identical.
-
Lower bound on the distance k-domination number of a tree
PublikacjaW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Sacral sound-engineering
PublikacjaOrganologic and campanologic acoustical problems due to applications to sacral objects are characterized on ground of numerous reviewed publications and engineering reports. Participations of several involved research centres, mostly Polish, at solving these problems are evaluated. Some desirable future developments are indicated. Appendices bring examples of documentation on selected investigated objects.
-
Dipole-Bound Anions of Glycine Based on the Zwitterion and Neutral Structures
Publikacja -
An excess electron bound to urea. I. Canonical and zwitterionic tautomers
Publikacja -
An excess electron bound to urea oligomers. II. Chains and ribbons
Publikacja -
Rank two bibartite bound entangled states do not exist.
PublikacjaWykazano, że nie istnieją stany rzędu dwa które zawierałyby splątanie. Pokazano związki między lokalnym a globalnym rzędem macierzy gęstości oraz ewentualną możliwością wydestylowania kwantowego splątania.
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Zero-range potentials for Dirac particles: Bound-state problems
PublikacjaA model in which a massive Dirac particle in $\mathbb{R}^{3}$ is bound by $N\geqslant1$ spatially distributed zero-range potentials is presented. Interactions between the particle and the potentials are modeled by subjecting a particle's bispinor wave function to certain limiting conditions at the potential centers. Each of these conditions is parametrized by a $2\times2$ Hermitian matrix (or, equivalently, a real scalar and a...
-
Bound on Bell inequalities by fraction of determinism and reverse triangle inequality
PublikacjaIt is an established fact that entanglement is a resource. Sharing an entangled state leads to nonlocal correlations and to violations of Bell inequalities. Such nonlocal correlations illustrate the advantage of quantum resources over classical resources. In this paper, we quantitatively study Bell inequalities with 2 × n inputs. As found in Gisin et al. [Int. J. Quantum. Inform. 05, 525 (2007)], quantum mechanical correlations...
-
W-like bound entangled states and secure key distillation
PublikacjaWe construct multipartite entangled states with underlying W-type structuresatisfying positive partial transpose (PPT) condition under any (N −1)|1 partition. Then we showhow to distill a N-partite secure key from the states using two different methods: direct applicationof local filtering and novel random key distillation scheme in which we adopt the idea from recentresults on entanglement distillation. Open problems and possible...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...