Search is not available for this dataset
query
stringlengths 1
13.4k
| pos
stringlengths 1
61k
| neg
stringlengths 1
63.9k
| query_lang
stringclasses 147
values | __index_level_0__
int64 0
3.11M
|
|---|---|---|---|---|
I am trying to grasp some aspects of the quantum entanglement, but the existing resources (including some of the links here) seem a bit confusing. I am trying to find an answer to the following questions. If two particles are entangled and then separated, will affecting one of them affect the other (for example, the particle is placed in a field that would set some property of it in a specific direction), or will it disentangle the system? If affecting one particle affects the other, then how is it not possible to use this effect to transfer information (once; for example by affecting the spin of the first particle to be up the other particle would have its spin down)? Is affecting the particle equivalent to measuring the property affected (for example the spin)? When a property of the particle is measured, does the particle get entangled with the measuring apparatus? More precisely, does interaction imply entanglement of a sort? I apologize if the questions are trivial or nonsensical, but I am asking as a layman in the field. | Bearing in mind I am a layman - with no background in physics - please could someone explain what the "big deal" is with quantum entanglement? I used to think I understood it - that 2 particles, say a light-year apart spatially, could affect each other physically, instantly. Here I would understand the "big deal". On further reading I've come to understand (maybe incorrectly) that the spatially separated particles may not affect each other, but in knowing one's properties you can infer the other's. If that it the case, I don't see what the big deal is... 2 things have some properties set in correlation to each other at the point of entanglement, they are separated, measured, and found to have these properties...? What am I missing? Is it that the particles properties are in an "un-set" state, and only when measured do they get set? (i.e. the wave-function collapses). If this is true - why do we think this instead of the more intuitive thought that the properties were set at an earlier time? | It is often stated, particularly in popular physics articles and videos, that if one measures a particle A that is entangled with some other particle B, then this measurement will immediately affect the state of the entangled partner. For example, if Alice and Bob share an entangled pair of electrons and Alice measures her spin in the $x$ direction, then Bob's spin will also end up spinning in that direction, and similarly if she measures in the $z$ direction. Moreover, the effect will be instantaneous, regardless of the spatial distance between the two particles, which seems at odds with special relativity. Can I use a scheme like this to communicate faster than light? | eng_Latn | 4,100 |
Nonrelativistic QM can be applied to bound states like a hydrogen atom. QFT is used for free particles (whatever one means by particles) that shortly interact with each other and are free again after the interaction. Can QFT also be used for bound states? | Is there a theorem that says that QFT reduces to QM in a suitable limit? Of course, it should be, as QFT is relativisitc quantum mechanics. But, is there a more manifest one? such as Ehrenfest's theorem which dictates the transition from QM to Classical Mechanics. I am curious as the basic object in QM is wave function whereas the basic object in QFT is quantized operator, which looks very different, and wondering how the comparison works. (Of course, I am aware that QFT can calculate corrections for Coulomb potential energy, which may seem to be a transition from QFT to QM, but I want one more manifest than that.) | I don't understand how quantum mechanics (and therefore also quantum computers) can work given that while we work with quantum states, particles that this quantum state consist of cannot be observed, which is the most fundamental requirement. If I am not mistaken, by "observed" we mean interaction with any other particle (photon, gluon, electron or whatever else). So my very important questions: Aren't the particles this quantum state consists of interacting with each other? Why doesn't that cause the state to collapse? Aren't all particles in the universe interacting with Higgs field and gravitons etc? Why doesn't that cause every quantum state to collapse? I feel there is something very fundamental in quantum mechanics that I am not aware of, hence I would be very pleased to have these questions answered. | eng_Latn | 4,101 |
The road towards quantum computers have so many obstacles, which are deeply different and more challenging than the problems that we had with the development of classical computers. There are reasons to believe that quantum computers with a "large enough" number of qubits and low decoherence to be actually useful. Yet, there are so many investments and there's so much research around that to suggest that the whole community believes that it's certain that we will have quantum computers sooner or later. Where does this belief come from? Are there factual, scientific arguments to support that? | I mean are we certain that they will be able to provide us a huge improvements (in some tasks) compared to clasical computers? | I mean are we certain that they will be able to provide us a huge improvements (in some tasks) compared to clasical computers? | eng_Latn | 4,102 |
Measuring quantum entanglement in paper by Ma et al | Delayed choice entanglement swapping: why are Alice & Bob's measurements useless without Victor's? | Does measurement, quantum in particular, always increase the total entropy? | eng_Latn | 4,103 |
How are quantum computers more powerful than classical computers? | What exactly makes quantum computers faster than classical computers? | What exactly makes quantum computers faster than classical computers? | eng_Latn | 4,104 |
Questions about Schrodinger's cat | What is an observer in quantum mechanics? | A fiber bundle over Euclidean space is trivial. | eng_Latn | 4,105 |
Invariance of maximally entangled state | Invariance of a maximally entangled state under unitary operation $U \otimes U^\dagger$ | (Why) Has Kohonen-style SOM fallen out of favor? | eng_Latn | 4,106 |
What does observation mean in two-slit electron diffraction experiment? | What constitutes an observation/measurement in QM? | Totally disconnected space that is not $T_2$ | eng_Latn | 4,107 |
Which mode is a cantilever oscillating at when twanged at one side and changing the length? | Derive equation for a cantilever in SHM | Delayed choice entanglement swapping: why are Alice & Bob's measurements useless without Victor's? | eng_Latn | 4,108 |
How viable is using Quantum Entanglement for long distance communication? | Quantum entanglement as practical method of superluminal communication | A fiber bundle over Euclidean space is trivial. | eng_Latn | 4,109 |
Quantum Entanglement and transfer of time information, is it possible? If two particles are quantum entangled...let’s call them particle A and particle B. You measure the state of particle A. At this point, can you know the exact time at which the particle B goes from superposition into a known state due to the remote measurement of particle A, only by waiting on particle B without knowledge of A? If that’s possible, then it seems to me, you could use Morse code to send information over quantum entangled particals. Consider the following protocol: logic 0 defined as $\le 50$ millisecond time interval in superposition before not in superposition detected logic 1 defined as $\le 100$ milliseconds and $\gt 50$ millisecond time interval in superposition before not in superposition detected $\gt$ 100 millisecond time interval of superposition state defined as “Hangup” “hangup” followed by “logic 0” defined as “Start” I define “superposition” as the “quantum entangled state”, Where the “Schrödinger's cat” is both alive and dead at the same time. Who really cares about the changed the vale of an entangled particle from the transmitter side... I just want to know if particle B is in a superposition or a non-superposition state, and the exact time that state transitions from superposition to a known state... and without direct knowledge of particle A | The choice of measurement basis on one half of an entangled state affects the other half. Can this be used to communicate faster than light? It is often stated, particularly in popular physics articles and videos, that if one measures a particle A that is entangled with some other particle B, then this measurement will immediately affect the state of the entangled partner. For example, if Alice and Bob share an entangled pair of electrons and Alice measures her spin in the $x$ direction, then Bob's spin will also end up spinning in that direction, and similarly if she measures in the $z$ direction. Moreover, the effect will be instantaneous, regardless of the spatial distance between the two particles, which seems at odds with special relativity. Can I use a scheme like this to communicate faster than light? | Is a hash a zero-knowledge proof? I’m trying to wrap my head around zero knowledge proofs, but I’m having trouble understanding it. In my current understanding, zero-knowledge proofs prove to the recipient that the sender has a certain knowledge without disclosing it. Like trying to say your password without actually giving it. Many sources go at it with a convoluted method like a tunnel where there’s a hidden gate, and Bob is trying to know if Alice can go through the hidden gate. But then it starts saying that Bob should not see Alice enter. Wouldn’t it be easier for Bob to just see Alice go in one tunnel and come out the other? That would not disclose the secret way of opening the tunnel, right? In that line of thinking, given a one-way function like a hash, couldn’t the other person just hash their secret and let the other see that the hashes compare? I must be missing something (as there’s a lot of research going into it and hashes are well-known), but I can’t wrap my head around it. Can someone tell me what’s wrong with my understanding of zero knowledge proofs? | eng_Latn | 4,110 |
Clarification on the information content of a qubit I saw a video in which a guy from IBM was explaining (very generally) quantum computing, it's difference with classical computing etc. The talk was not technical at all, it was intended for a broad audience. At some point he told that, if we need to represent our position on the planet with only one bit, we could only tell for example if we are on the North or South hemisphere, but with a qubit we could tell exactly where we where. He did this example to explain the difference in how much information can a bit and a qubit contain and to give a little idea of what a superposition is (I think). Now, my question: From what I know a qubit has more than one state, but when I read it I can only have one or zero, so why this example was made? From what I can understand a qubit can hold more information but I can't read it, so basically it's useless. | How can infinite information be theoretically encoded or stored in a single qubit? I've just gotten started with Nielsen and Chuang's text, and I'm a little stuck. They mention that theoretically, it would be possible to store an infinite amount of information in the state of a single qubit. I'm not sure I completely comprehend this. Here's how I rationalized it: You take all the information you want to store, put it in binary form, and make it the real component of $\alpha $ or $\beta$ (the coefficients of the computational basis states). Now I'm not sure if I've understood it right, but since it's still fuzzy in my head it would be great to get some kind of ELI5 explanation or possibly a more detailed picture of how this would, even theoretically, be possible. Apologies if the question doesn't meet standards. I'm new to the forum and would be open to feedback regarding asking questions or answering them. | What do the supercharges in extended supersymmetry do? What do the supercharges in do? In ${\cal N}=1$ supersymmetry there are a certain number of fermions and and equal number of bosons. You can transform all fermions to the bosons (and vice versa) in a 1 to 1 fashion using a single supercharge, $Q$. So what happens when you have, for example, ${\cal N}=2$ supersymmetry with 8 supercharges? Since $Q$ is a generator of supersymmetry transformations, is it a linear combination of these supercharges that act on the particles? In which case could one particle be acted on by two separate linear combinations of $Q$? Or is it strictly one linear combination of $Q$ per fermion/boson? Also, what does ${\cal N}$ mean physically? What difference does ${\cal N}=2$ have to ${\cal N}=1$ other than more supercharges? Or is that the only difference between the two theories? | eng_Latn | 4,111 |
How does one cluster multiple machines to act as one to run multiple virtual machines on this single-seeming machine? How does one take multiple computers and make them act as one, such that all their processors and memory are combined now and you are running any application such that yo are running them on a single very fast computer. Such that it can be used to run virtual machines (on software like vmware). What operating system(s) can this be accomplished with? Or what software is needed? | Multiple servers acting like a single one with all the hardware? by now I have 10 servers for hpc, power computing oriented. My users need to launch several processes using qmake. The users are used to work with ubuntu 9.10, and the software from the repositories is switable for them. I've deployed ubuntu 9.10 to all 10 servers (pxe rocks). By now we work with parallel-ssh and cluster-ssh, which allows as to launch the same process to all servers. With this tools this tools the servers remain as independent but with the same software and the same launched command. Now we would like to go to next step and see all the servers as a single one with all the resources from the other 9 as if was its resources. The difference would be substantial in time to process and also time to design the command to launch. Any advice on wich software to use will be very useful? Thanks | What does a "real" quantum computer need for cryptanalysis and/or cryptographic attack purposes? The cryptographic world has been buzzing the word "quantum" for a while now (even the NSA is currently preparing itself for a post-quantum crypto world) and quantum-related hardware engineering is evolving constantly. For example: the 5-qubit quantum computer created at MIT by using the technique of ion traps succeeded in prime-factorizing 15. Does that mean that since it succesfully managed that, that it is a all-purpose quantum computer which could be used for cryptanalysis and/or cryptographic attacks? If that's not the case, what exactly would a "real" quantum computer need (think: rough description of expected technical abilities, aka specs) to enable its users to use it for cryptanalysis and/or cryptographic attack purposes? And - ignoring rumours about potentially existing but confidential governmental projects - does any such system already exist today? | eng_Latn | 4,112 |
Can quantum correlations due to measurement be used for quantum communication? My understanding of quantum entanglement is that when you measure the state of an entangled particle, its counterpart will measure a correlated state, i.e. we know for sure that if for example Particle A is measured to be in state A, then particle B will definitely be measured to be in a correlated state B at the same instance. So my question is, can we not exploit this property for communication? The way this could be done is that we fix two frequences, say 10 times/second and 20 times/second. At the destination, we always measure 20 times/sec, at the source we measure 10 times/second or 20 times/second depending on whether we want to transmit a 0 or a 1. Then at the destination, based on the measured probability of states, we can decide whether the source was transmitting a 0 or a 1. Would this work? | Why is quantum entanglement considered to be an active link between particles? From everything I've read about quantum mechanics and quantum entanglement phenomena, it's not obvious to me why quantum entanglement is considered to be an active link. That is, it's stated every time that measurement of one particle affects the other. In my head, there is a less magic explanation: the entangling measurement affects both particles in a way which makes their states identical, though unknown. In this case measuring one particle will reveal information about state of the other, but without a magical instant modification of remote entangled particle. Obviously, I'm not the only one who had this idea. What are the problems associated with this view, and why is the magic view preferred? | Why is channel capacity a factor of bandwidth instead of frequency? I'm trying to understand the concept of capacity for a wireless channel. Some help would be appreciated. For a AWGN channel capacity is calculated as: $$C=B \cdot log_2(1 + S/N)\text{ bits/sec}$$ B = bandwidth. This is what I don't understand. Why isn't it a factor of frequency? To me considering bandwidth only makes sense in cases where the system changes frequency. Bandwidth is the difference between an upper and lower frequency range. Well, what if I'm using a fixed-frequency signal? Fupper and Flower would be the same value, right? So does that mean B=0? So a fixed frequency signal can't carry any data? We know that's not true, AM radio does it. So what am I missing? According to this formula, a fixed-frequency signal would have the same performance regardless of whether it's at high or low frequency. This makes no sense to me. For example say my bandwidth is 1Hz at a fixed frequency of 1Hz. Compare this with a bandwidth of 1Hz at a frequency of 2.4GHz. It's plainly obvious that I can cram way more bits into 2.4 x 109 cycles/second than I can with just 1/sec. But according to this formula I can't. Please help. What about fractional differences? Waveforms are analog in nature, so we could have a 1Hz signal and a 1.5Hz signal. Likewise at the high frequency range. Say 2.4GHz minus 0.5Hz. There is an infinite amount of space between 1 and 1.5. Could not 1Hz and 1.001Hz serve as two separate channels? In terms of practicality I realize this would be difficult, nearly impossible to measure this difference with modern electronics, especially with noise added, but in pure theory you could have two channels. So in that sense, shouldn't there be an infinite amount of bandwidth between two frequencies? Or do we only count in 1Hz whole number increments? | eng_Latn | 4,113 |
What lives in the Hilbert Space? Consider the eigenvalue equation: $$\hat{Q}\Psi = q\Psi$$ where $q$ and $\Psi$ are eigenvalues and eigenfunctions of the hermitian operator $\hat{Q}$. If the spectrum of the hermitian operator is discrete, then the eigenfunctions lie in the Hilbert Space and constitute physically realizable states. Why do discrete eigenvalues imply that their associated eigenfunctions are square-integrable (and hence live in the Hilbert Space)? | Why are eigenfunctions which correspond to discrete/continuous eigenvalue spectra guaranteed to be normalizable/non-normalizable? These facts are taken for granted in a QM text I read. The purportedly guaranteed non-normalizability of eigenfunctions which correspond to a continuous eigenvalue spectrum is only partly justified by the author, who merely states that the non-normalizability is linked to the fact that such eigenfunctions do not tend to zero at infinity. Not a very satisfying answer. What I'm really after is an explanation based in functional analysis. I believe there is a generalized result about inner products being finite for discrete spectra but infinite for continuous spectra. Can anyone shed some light on this? | Quantum Hall effect for dummies In the past few days I've become increasingly intrigued by the QHE, mainly thanks to very interesting questions and answers that have appeared here. Unfortunately, I am as of yet very confused by all the (seemingly disparate) stuff I learned. First, here are some random points that I've been able to gather I(nteger)QHE occurs due to the presence of Landau levels IQHE is an embodiment of topological order and the states are characterized by the Chern number that tells us about topologically inequivalent Hamiltonians defined on the Brillouin zone IQHE requires negligible electron-electron interations and so is dependent on the presence of impurities that shield from Coulomb force F(ractional)QHE occurs because of formation of anyons. In this case Coulomb interaction can't be neglected but it turns out an effective non-interacting description emerges with particles obeying parastatistics and having fractional charge FQHE has again something to do with topology, TQFT, Chern-Simons theory, braiding groups and lots of other stuff FQHE has something to do with hierarchy states So, here are the questions Most importantly, do these points make sense? Please correct any mistakes I made and/or fill in other important observations How do explanations 1. and 2. of IQHE come together? Landau quantization only talks about electron states while topological picture doesn't mention them at all (they should be replaced by global topological states that are stable w.r.t. perturbations) How do explanations 4., 5. and 6. relate together Is there any accessible introductory literature into these matters? Do IQHE and FQHE have anything (besides last three letters) in common so that e.g. IQHE can be treated as a special case? My understanding (based on 3.) is that this is not the case but several points hint into opposite direction. That's also why I ask about both QHE in a single question | eng_Latn | 4,114 |
Thermodynamic process with a decrease in entropy | Don't certain processes decrease entropy? | Does measurement, quantum in particular, always increase the total entropy? | eng_Latn | 4,115 |
Need help understanding weird definition of pure states | Differences between pure/mixed/entangled/separable/superposed states | Does moving leave the object in a usable state? | eng_Latn | 4,116 |
Are quantum computers just massively parallel computers? | Can a parallel computer simulate a quantum computer? Is BQP inside NP? | SQL not engaging parallelism for extremely large query | eng_Latn | 4,117 |
Is the spin of a particle always a 50/50 chance of being different after measuring it in Quantum Entanglement | Is the wave function of a particle re-created after a measurement stops? | Story where the protagonist is turned off from an automated system of professional attribution and instant learning | eng_Latn | 4,118 |
Does quantum entanglement imply a universal "now"? | Why is quantum entanglement considered to be an active link between particles? | FireFox 66 Quantum disabled all my extensions at midnight! | eng_Latn | 4,119 |
Quantum Harmonic Oscillator: is it impossible that the particle is at certain points? | Is there actually a 0 probability of finding an electron in an orbital node? | Consistent, complete, and generalized description of the quantum harmonic oscillator | eng_Latn | 4,120 |
Difference between classical spin and quantum spin | What is spin as it relates to subatomic particles? | What exactly makes quantum computers faster than classical computers? | eng_Latn | 4,121 |
Can we use quantum entanglement as a way to send information or data? | Quantum entanglement: does it necessarily imply superluminal information transfer? | Why we don't use gamma rays, x-rays or ultraviolet to transmit data? | eng_Latn | 4,122 |
I find there are two methods to calculate the amplitude in QFT. Is it equivalent? | Quantum Field Theory without LSZ, how is it possible? | Why there is no operator for time in QM? | eng_Latn | 4,123 |
go to http://www.cs.caltech.edu/~westside/quantum-intro.html\nand then go to the second image/experiment.\n\nwhy does detector A, and not B, register 100% of the time?\n\ncauses detector A to register 100% of the time, and never at detector B! \n\nPlease note that my question is a bit different --\n\nI am asking what is the location/arragement of detector B...that causes A to register all the time instead of B?\n\ni get that there is interference happening. But how does intereference favor location of A? | I admire mathematician's concise answers, but in this case some additional explanation may be due:\n\nWhen a wave is partially transmitted and partially reflected the two outgoing waves are shifted in phase from the incident wave. If energy or probability is to be conserved, the difference between the two phase shifts is pi/2 (90°). In this diagram each of the two possible outgoing beams consist of components from two paths (R=Reflection,T=Transmission):\n\nOutgoing Horizontal: TRR + RRT\nOutgoing Vertical: TRT + RRR\n\nIn the first case the relative phase shift between the two components is 0 and in the second case it's pi (180°) ==> the two components are negatives of each other and interfere destructively. | Check to verify the IP addresses of both laptops do not match. This is one potential reason for only one working at a time.\n\nI suggest placing both laptops in DHCP mode. | eng_Latn | 4,124 |
Enhanced Quantum Synchronization via Quantum Machine Learning | Selected techniques for data mining in medicine. | An ambulatory surgical procedure under local anesthesia for treatment of female urinary incontinence | eng_Latn | 4,125 |
Analyzing, Detecting, and Exploiting Sentiment in Web Queries | A taxonomy of web search | Strengths and Weaknesses of Quantum Computing | eng_Latn | 4,126 |
Towards a Quantum World Wide Web | Quantum Interference and Superposition in Cognition: Development of a Theory for the Disjunction of Concepts | Mosaics of scenes with moving objects | kor_Hang | 4,127 |
Quantum Communication in Rindler Spacetime | Quantum Computation and Quantum Information | A scalable modular antenna configuration to extend the detection volume of a near-field UHF-RFID desktop reader | eng_Latn | 4,128 |
Quantum machine learning for electronic structure calculations | Towards Quantum Chemistry on a Quantum Computer | The Trotter Step Size Required for Accurate Quantum Simulation of Quantum Chemistry | eng_Latn | 4,129 |
Efficient mapping of quantum circuits to the IBM QX architectures | A fast quantum mechanical algorithm for database search | Auditory brainstem responses with optimized chirp signals compensating basilar-membrane dispersion. | eng_Latn | 4,130 |
A linear-optical proof that the permanent is #P-hard | Quantum Computation and Quantum Information | Who, when, and why: a machine learning approach to prioritizing students at risk of not graduating high school on time | eng_Latn | 4,131 |
Optimizing Quantum Circuits for Arithmetic | quantum algorithm for linear systems of equations . | End-to-End Learnable Histogram Filters | eng_Latn | 4,132 |
Evolution in Quantum Computing | Quantum Computation and Quantum Information | Scalable Dense Non-rigid Structure-from-Motion: A Grassmannian Perspective | kor_Hang | 4,133 |
Quantum Public-Key Cryptosystems | Strengths and Weaknesses of Quantum Computing | Miniaturized antenna for LTE wireless USB dongle applications | kor_Hang | 4,134 |
Applying Quantum Optimization Algorithms for Linear Programming | Quantum Machine Learning Algorithms : Read the Fine Print | Designing for the Safety of Pedestrians, Cyclists, and Motorists in Urban Environments | eng_Latn | 4,135 |
Fuzzy multi-objective mathematical programming on reliability optimization model | fuzzy set theory ― and its applications . | Designing a Million-Qubit Quantum Computer Using a Resource Performance Simulator | eng_Latn | 4,136 |
Inverse Optimization : A New Perspective on the Black-Litterman Model | The Intuition Behind Black-Litterman Model Portfolios | quantum dice or , testable exponential randomness expansion . | yue_Hant | 4,137 |
Quantum computation, quantum theory and AI | THE EMPEROR'S NEW MIND Concerning Computers, Minds and the Laws of Physics | Imbalances in Dietary Consumption of Fatty Acids, Vegetables, and Fruits Are Associated With Risk for Crohn's Disease in Children | yue_Hant | 4,138 |
Quantum reinforcement learning | Quantum Computation and Quantum Information | The multiprocessor real -time scheduling of general task systems | eng_Latn | 4,139 |
Towards a quantum programming language | Algorithms for Quantum Computation: Discrete Log and Factoring (Extended Abstract) | Automatic 3D ear reconstruction based on binocular stereo vision | eng_Latn | 4,140 |
A construction of cryptography system based on quantum neural network | Classification of Substitution Ciphers using Neural Networks | Physical-Layer Network Coding: Tutorial, Survey, and Beyond | eng_Latn | 4,141 |
Communicating quantum processes | Quantum Computation and Quantum Information | Turning the crown upside down: gene tree parsimony roots the eukaryotic tree of life. | eng_Latn | 4,142 |
Simulating quantum computers with probabilistic methods | the heisenberg representation of quantum computers . | IRWRLDA: improved random walk with restart for lncRNA-disease association prediction | eng_Latn | 4,143 |
Discovering Combos in Fighting Games with Evolutionary Algorithms | An experiment in automatic game design | Control of Quantum-Confined Stark Effect in InGaN-Based Quantum Wells | eng_Latn | 4,144 |
Projective simulation for artificial intelligence | quantum mechanics helps in searching for a needle in a haystack . | vlsi implementation of deep neural networks using integral stochastic computing . | eng_Latn | 4,145 |
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects | Quantum Computation and Quantum Information | Two sisters resembling Gorlin-Chaudhry-Moss syndrome. | eng_Latn | 4,146 |
Quantum cognition goes beyond-quantum: modeling the collective participant in psychological measurements | Quantum Interference and Superposition in Cognition: Development of a Theory for the Disjunction of Concepts | Sequential vs. Hierarchical Syntactic Models of Human Incremental Sentence Processing | eng_Latn | 4,147 |
What is the quantum for energy and quantum of time? | If there is a quantum for time, it must be on the order of 10 to the minus fortieth power seconds, the time required for the smallest particle interaction between two particles that are separated by the theoretical diameter of the smaller of the two-- in other words, they are already nearly touching. Nothing shorter than that could be measured. Whether time is quantized, that is, whether it goes in discrete steps, multiples of the above unit, we do not yet know. | "We are in an age of discovery, we live in the world of the uknown. That's the only place to live." —Lloyd Quarterman(1918-1982)\n\n\nDr. Lloyd Quarterman was one of the African American nuclear scientists involved in the production of the atomic bomb. He worked with two of the most illustrious scientific minds of the 20th century—Einstein and Fermi." | eng_Latn | 4,148 |
Blockchained Post-Quantum Signatures | Algorithms for quantum computation: discrete logarithms and factoring | A Real-Time Augmented Reality System to See-Through Cars | eng_Latn | 4,149 |
Quantum aspects of high dimensional formal representation of conceptual spaces | A new three-dimensional model for emotions and monoamine neurotransmitters | Exploiting Tri-Relationship for Fake News Detection. | eng_Latn | 4,150 |
Quantum computation, quantum theory and AI | Elementary Gates for Quantum Computation | Filtering Spam by Using Factors Hyperbolic Trees | yue_Hant | 4,151 |
Quantum Logical Neural Networks | Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer | Direct Raytracing of Particle-based Fluid Surfaces Using Anisotropic Kernels | yue_Hant | 4,152 |
Quantum computing: a survey | Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer | A General Architecture of IoT System | eng_Latn | 4,153 |
Demo: WEBee: Physical-Layer Cross-Technology Communication via Emulation | B 2 W 2 : NWay Concurrent Communication for IoT Devices | Foundations of Quantum Programming (Extended Abstract) | eng_Latn | 4,154 |
Q WIRE : A QRAM-Inspired Quantum Circuit Language | A blueprint for building a quantum computer | Answering Complicated Question Intents Expressed in Decomposed Question Sequences | yue_Hant | 4,155 |
Exponential algorithmic speedup by a quantum walk | Quantum Computation and Quantum Information | System for authoring highly interactive, personality-rich interactive characters | eng_Latn | 4,156 |
Feature-Guided Black-Box Safety Testing of Deep Neural Networks | Simple Black-Box Adversarial Perturbations for Deep Networks | Quantum speed-up of Markov chain based algorithms | eng_Latn | 4,157 |
The Internet Dark Matter - on the Missing Links in the AS Connectivity Map | Emergence of scaling in random networks | On-Chip Microwave Quantum Hall Circulator | eng_Latn | 4,158 |
T-splines and T-NURCCs | Non-uniform recursive subdivision surfaces | quantum algorithm for linear systems of equations . | eng_Latn | 4,159 |
Generating entangled photon pairs in a parallel crystal geometry | Quantum Communication Technology | E-Commerce and the Undulating Distribution Channel | eng_Latn | 4,160 |
How far away is the Quantum Internet from becoming a reality? | Quantum Computation: How far away is the Quantum Internet from becoming a reality? | What are your thoughts on "quantum computing"? | eng_Latn | 4,161 |
Quantum cognition goes beyond-quantum: modeling the collective participant in psychological measurements | Quantum Interference and Superposition in Cognition: Development of a Theory for the Disjunction of Concepts | Focused Hierarchical RNNs for Conditional Sequence Processing | eng_Latn | 4,162 |
The Abstract Structure of Quantum Algorithms | Quantum support vector machine for big data classification | efficacy and safety of a decision rule for using antibiotics in children with pneumonia and vaccinated against pneumococcus . a randomized controlled trial . | kor_Hang | 4,163 |
Using Quantum Computers for Quantum Simulation | Simulating quantum computers with probabilistic methods | A Long Reset-Time Power-On Reset Circuit With Brown-Out Detection Capability | kor_Hang | 4,164 |
circuit for shor ' s algorithm using 2n + 3 qubits . | Quantum Computation and Quantum Information | An unusual case of transient neonatal pustular melanosis: a diagnostic puzzle | eng_Latn | 4,165 |
Efficient mapping of quantum circuits to the IBM QX architectures | Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer | Web-based statistical fact checking of textual documents | eng_Latn | 4,166 |
Quantum-inspired genetic algorithms | a method for obtaining digital signatures and public - key cryptosystems ( reprint ) . | A systematic literature review: Information security culture | eng_Latn | 4,167 |
Uncertain Fate of Fair Sampling in Quantum Annealing | Quantum Annealing and Analog Quantum Computation | Smart wearable systems: Current status and future challenges | eng_Latn | 4,168 |
J-Force: Forced Execution on JavaScript | Cloak and dagger: dynamics of web search cloaking | Overview and Comparison of Gate Level Quantum Software Platforms | eng_Latn | 4,169 |
A quantum particle swarm optimization | Comparison between Genetic Algorithms and Particle Swarm Optimization | Component Software: Beyond Object-Oriented Programming | eng_Latn | 4,170 |
Electronic Energy Transfer | Quantum Computation and Quantum Information | Fault-tolerant quantum computation | eng_Latn | 4,171 |
Boosting Algorithms as Gradient Descent | Bagging Predictors | On quantum algorithms | eng_Latn | 4,172 |
Quantum Programming Languages: An Introductory Overview | Functional Quantum Programming | Computational Capabilities of Graph Neural Networks | yue_Hant | 4,173 |
Quantum aspects of high dimensional formal representation of conceptual spaces | Quantum Interference and Superposition in Cognition: Development of a Theory for the Disjunction of Concepts | HINDI SPEECH RECOGNITION SYSTEM USING HTK | eng_Latn | 4,174 |
Quantum computing: a survey | Quantum Computation and Quantum Information | Unpacking the privacy paradox: Irrational decision-making within the privacy calculus | eng_Latn | 4,175 |
Quantum resistant public key cryptography: a survey | Universal classes of hash functions (Extended Abstract) | Infinitely Many-Armed Bandits with Budget Constraints | eng_Latn | 4,176 |
Fermionic Linear Optics and Matchgates | On the power of quantum computation | Flexible Network Binarization with Layer-Wise Priority | eng_Latn | 4,177 |
Hardware design of an NTT-based polynomial multiplier | Algorithms for quantum computation: discrete logarithms and factoring | Orientation sensitivity to graspable objects: An fMRI adaptation study | eng_Latn | 4,178 |
Synthesis of quantum-logic circuits | quantum mechanics helps in searching for a needle in a haystack . | An improved ant algorithm with LDA-based representation for text document clustering | eng_Latn | 4,179 |
Quantum-enhanced machine learning | Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming | Compact Pulse Topology for Adjustable High-Voltage Pulse Generation Using an SOS Diode | eng_Latn | 4,180 |
Quantum Communication in Rindler Spacetime | Quantum Computation and Quantum Information | Quantum circuits with mixed states | eng_Latn | 4,181 |
What are your thoughts on "quantum computing"? | What are your thoughts on quantum computing? | Could quantum computers in the future access parallel realities? | eng_Latn | 4,182 |
Topological quantum | the heisenberg representation of quantum computers . | Compiling Little Languages in Python | eng_Latn | 4,183 |
Asymmetric Cryptography for Mobile Devices | Quantum Cryptography | monte carlo methods for portfolio credit risk . | eng_Latn | 4,184 |
Lattice-based Cryptography | Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer | Transpositions in stator bars of large turbogenerators | eng_Latn | 4,185 |
ScaffCC: a framework for compilation and analysis of quantum computing programs | Quantum Computation and Quantum Information | a noise ‐ aware filter for real ‐ time depth upsampling . | eng_Latn | 4,186 |
A quantum associative memory based on grover’s algorithm | Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer | Ray Casting of Trimmed NURBS Surfaces on the GPU | eng_Latn | 4,187 |
Detailed shape representation with parallax mapping | A subdivision algorithm for computer display of curved surfaces | Linear optical quantum computing with photonic qubits | eng_Latn | 4,188 |
Building personal maps from gps data | policy recognition in the abstract hidden markov model . | Micromachined Integrated Quantum Circuit Containing a Superconducting Qubit | eng_Latn | 4,189 |
What are the benefits of a quantum computer? | What will be the benefits of quantum computing? | How much will programming change if a quantum computer is introduced? | eng_Latn | 4,190 |
Has anyone built a quantum computer? | Has Anyone Built Their Own Quantum Computer? | How fast is quantum computer? | eng_Latn | 4,191 |
Quantum Computation by Adiabatic Evolution | Strengths and Weaknesses of Quantum Computing | Group value and intention to use - A study of multi-agency disaster management information systems for public safety | kor_Hang | 4,192 |
what is quantum leap | Quantum leaps are the sole cause of the emission of electromagnetic radiation, including light, which occurs in the form of quantized units called photons. Ironically, when laymen use the term colloquially, they use it to describe large jumps in progress, when in reality a quantum leap is a very small change of state. | Quantum Rehab, a Pride Mobility Products Corporation company, designs and manufactures high-end complex rehabilitation solutions that allow end users to achieve their mobility goals. | eng_Latn | 4,193 |
what is quantum entrainment | Quantum Entrainment. What is it? Quantum Entrainment (QE) is a natural technique that produces immediate harmony in body, mind and spirit. With traditional energy healing methods there is always a movement of energy from or through the healer. | Benefits of Quantum Pendant to Human CLICK HERE. What is Scalar Energy? According to the principle of conservation of energy, energy is perpetual but can be transformed. During the process of transformation, part of the energy will be converted into heat in order to maintain its balanced condition. | eng_Latn | 4,194 |
who is schmitty | Schmitty The Weather Dog is a philanthropic pup and celebrity in her own right. After 9/11, Schmitty became the inspiration and model for New Yorkie Greetingss, a line of greeting cards created to raise money for the Uniformed Firefighters Association Scholarship Fund, a fund for fallen firefighter and their families. | Schmitt trigger. © A Dictionary of Computing 2004, originally published by Oxford University Press 2004. Schmitt trigger A discrete or integrated circuit whose output has two stable states, i.e. two sustainable values of output voltage, to which it is driven by the movement of its input voltage past two well-defined trigger values. A rise in input voltage above one trigger level causes the output to switch to one state. A fall in input voltage below the other trigger level causes the output to switch to the other state. The difference between the positive and negative thresholds is known as the circuits hysteresis. For the output to change, the input must exceed the hysteresis and be of the appropriate polarity. | eng_Latn | 4,195 |
who is the maker of quantum | The quantum computing technology developed by D-Wave gets ongoing scientific debate, but it's also getting money, $28 million last week, bringing its total funding to about $150 million. This Canadian company was started 15 years ago and is one of the most tenacious and longest-running tech start-ups around. | Quantum physicists discovered that physical atoms are made up of vorticies of energy that are constantly spinning and vibrating. Matter, at itâs tiniest observable level, is energy, and human consciousness is connected to it, human consciousness can influence itâs behavior and even re-structure it. âEverything we call real is made of things that cannot be regarded as realâ â Niels Bohr. | eng_Latn | 4,196 |
Generalised basis independent relationship between Von Neumann Entropy and Purity of a quantum state | What is the relation between linear purity and von Neumann entropy of a state? | What is the relation between linear purity and von Neumann entropy of a state? | eng_Latn | 4,197 |
Time-evolution operator written through a commutator | Time ordering operator if commutator is $c$-number function | Why there is no operator for time in QM? | eng_Latn | 4,198 |
Undergraduate quantum book treating density operators, mixed states, and entanglement | Quantum information references | A fiber bundle over Euclidean space is trivial. | eng_Latn | 4,199 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.