The tag has no usage guidance.

learn more… | top users | synonyms (2)

0
votes
1answer
41 views

Clarification on paper: “Information Flow in Entangled Quantum Systems” - David Deutsch and Patrick Hayden

Referencing paper "Information Flow in Entangled Quantum Systems" by David Deutsch and Patrick Hayden, specifically the section concerning Quantum Teleportation: ...
0
votes
0answers
24 views

Are quantum computers just massively parallel computers? [duplicate]

I am a computer engineering major so I do not understand a lot of quantum science but from what I hear about quantum computers, it sounds like they are just massively parallel computers. In quantum ...
2
votes
3answers
120 views

Are quantum computers at least build able?

Assuming a highly unrealistic where you basically have unlimited money to burn. Is it possible to a build a size scalable quantum computer? My premise is that I often read tha people have a made a ...
2
votes
1answer
98 views

Understanding measurement based quantum computing

I am currently reading M. A. Nielsen's review on Cluster-state Quantum Computation (Nielsen, Michael A. "Cluster-state quantum computation." Reports on Mathematical Physics 57.1 (2006): 147-161.). ...
5
votes
2answers
198 views

Nobel Prize challenge: Could neutrinos be used for quantum information processing?

We know that two scientists, Takaaki Kajita and Arthur B. McDonald, working on Neutrinos have just been awarded the 2015 Nobel Prize in Physics. My question as a Nobel Prize Challenge Question is: ...
0
votes
1answer
39 views

What determines the anyon fusion outcome (if several are possible)?

Given the fusion rule (for anyons) "A x B = 1 + C" it is possible for the anyons A and B to fuse to the vacuum "1" or to fuse to the anyon C. What determines what will happen if they fuse? Is the ...
0
votes
0answers
13 views

Is the truncated Wigner method efficiently classical simulatable?

The continuous-variable Gottesman-knill theorem says that the operation which varying the initial state described as the gaussian function (such as vacuum) to the final state described as the gaussian ...
3
votes
1answer
118 views

How can I derive Fusion-Rules for Anyons?

I am reading Pachos "Introduction to Topological Quantum Computation". Pachos writes that a model for anyons consists of a list of all anyons and a fusion rule for them. Given a model with anyonic ...
2
votes
2answers
277 views

How could memory be organized in quantum computers?

A classical computer has a memory made up of bits, where each bit represents either a one or a zero and its implemented by two-state transistor logic. However, a quantum computer maintains a sequence ...
0
votes
2answers
135 views

How Much Computing Power would be Required to Fully Simulate a Cubic Meter? [closed]

Imagine you want to simulate a cubic meter down to the particle. By following the Standard Model and other basic physical equations, how much computing power would be required to do this, in say, a ...
2
votes
1answer
92 views

Eigenvalues of density operator under quantum channel

Consider a 2x2 density operator $\rho$ with eigenvalues $\lambda_{1},\lambda_{2}$ (where $\lambda_{1}\geq\lambda_{2}$) evolving into a 4x4 density operator $\rho'$ (with eigenvalues ...
7
votes
1answer
285 views

Quantum and classical scaling of memory

In the literature of Quantum Computation (QC), when discussing the simulation of quantum systems, one usually comes across comparisons with the classical digital analog such as: "Classically the size ...
-1
votes
2answers
61 views

Rotation Operators [closed]

How can I rotate a state $|\psi>=\alpha|0>+\beta|1>$ to $|\psi'>=\delta|0>+\gamma|1>$ using a unitary U, where the values of $\alpha, \beta, \gamma, \delta$ are known?
0
votes
2answers
49 views

Is this model of a finite quantum coprocessor violating physical principles?

I want to consider a classical computer without any artificial restrictions, which has a single quantum coprocessor with a fixed finite number of qubits. It can perform the following three types of ...
0
votes
1answer
84 views

Relationship between Toffoli gate and Deutsch gate

I am reading a book called "Quantum Computing for computer scientists" and stuck at this exercise for a day. Bellow is the description of Deutsch gate: And here is the description of Toffoli ...
-3
votes
2answers
145 views

Quantum computers for string theory? [closed]

I read something about that locating our space in the multitude of multidimensional spaces of M-theory (and so identifying particular particles which we can measure with particular strings) is a too ...
2
votes
1answer
610 views

Controlled Phase Gates

The Quantum Fourier Transform consists of 2 gates. Controlled Phase Gates, and Hadamard gates. I'm assuming the Controlled Phase Gate is a combination of a Control Gate, and a Phase Gate. But what ...
1
vote
0answers
55 views

How is this circuit equivalent to a Bell measurement?

The circuit elements are : CNOT gate, first qubit is the control bit Hadamard gate (H) The dials represent measurements made in the computational basis Therefore, the circuit (without the ...
0
votes
0answers
36 views

How to find a single coefficient of quantum Fourier transform reliably

Quantum Fourier transform transform $X \in \mathbb{C}^{2^n}$ to $Y \in \mathbb{C}^{2^n}$. Suppose one wishes to find $y_0$, the first coefficient of "vector" $Y$. However, as this is quantum process, ...
0
votes
1answer
68 views

Can a classical 50/50 probability be distinguished from a quantum superposition with a single measurement?

$\renewcommand{\ket}[1]{|#1\rangle}$ A "false" (equally superimposed qubit) is created by mechanically firing with 50/50 probability a resonance photon at a Hydrogen atom qubit in the ground state. ...
0
votes
1answer
65 views

Is a universal quantum computer expected to be able to shed any light on the measurement problem? - Part B [closed]

Following up on Part A. Suppose we build a universal quantum computer and it functions as we currently expect it to. Is there any reason to suggest that, beyond its uses for things like ...
2
votes
0answers
79 views

Is a universal quantum computer expected to be able to shed any light on the measurement problem? - Part A [closed]

Suppose we build a universal quantum computer and it functions as we currently expect it to. Is there any reason to suggest that, beyond its uses for things like cryptography and quantum system ...
4
votes
1answer
143 views

How is classical information put into and retrieved from a quantum computer?

How, if you had to find the factors of say a 256 digit number, would you go about inputting the data and how do the proper answers "drop out" of a quantum computer. Other than terms such as qubits, ...
0
votes
1answer
72 views

Classical Computation without NOT [closed]

Is it possible to do universal classical computation using bits and 2-bit gates when you cannot perform a NOT operation on a single bit (hence cant do CNOT and so on). If yes, what are the possible ...
20
votes
7answers
6k views

Could quantum computers break any cipher? [closed]

I've been told that physicists and computer scientists are working on computers that could use quantum physics to increase significantly computation capabilities and break any cipher so cryptography ...
0
votes
1answer
100 views

What are typical error rates of quantum computers?

I read in an article that in order to perform error correction on a quantum computer there can only be one error per 10.000 calculations (=unitary transformations). This sounds pretty high but how ...
0
votes
1answer
56 views

Why does a measurement on one qubit force another one into a given state in Simon's algorithm?

This comes from trying to understand the "Simon's algorithm". So we have a set of $2^n$ kets $|x_i >$ one each for $i \in \{0,1\}^n$. Each $x_j \in \{0,1\}^n$. And we have the further constraint ...
0
votes
3answers
100 views

The $n$-th root of the NOT gate

I simply can not find material containing facts about the $n$-th root of the NOT gate and it's realization in Q.M. and also in C.M.. Does anyone have material? A comparison of the $n$-th root NOT ...
1
vote
1answer
66 views

What causes continuous errors in a qubit?

I read that due to decoherence a qubit in a superpositon gets destroyed or put into one definite eigenstate. This kind of error seems to occur due to interactions with other stuff like the environment ...
1
vote
1answer
85 views

Quantum computing can be done via measurement alone, why is this significant?

I read in the Afterword section of Nielsen and Chuang's book Quantum Computation and Quantum Information that A second area of progress has been in understanding of what physical resources are ...
3
votes
1answer
137 views

Approximating a target operator

I was wondering if anyone knew how the author got to equation 12 on page four of this paper, I will attempt to explain the situation below. Given $C$, a target operator, we wish to create an ...
0
votes
1answer
44 views

Why do Transformations on Qubits for Quantum Computation have to be Unitary?

In the quantum circuit model we prepare some inital state $|\psi\rangle$ and throw our algorithm in form of some unitary transformation(s) $U$ on it to get our result $|\Psi\rangle$: ...
0
votes
1answer
203 views

How to apply Controlled-NOT gate?

look at the figure below it is about an example to multiply two qubits by 3 Controlled gate to get the SWAP operation .. I'm trying to follow this step-by-step but I couldn't know how this is ...
1
vote
0answers
16 views

Creating an arbitrary state of the quantum simple harmonic oscillator [duplicate]

Suppose $\mathcal{B}=\{\lvert 0\rangle, \lvert 1\rangle, \lvert 2\rangle, ... \}$ is the energy eigen-basis of a quantum simple harmonic oscillator. I want to create the state \begin{equation} ...
1
vote
1answer
58 views

Do we have algorithms that are polynomial on a Q-Computer but not poly. on a classical Computer?

I am currently reading “Introduction to Topological Quantum Computation” by J.K. Pachos. In the book the author mentions that Shor’s factoring algorithm is polynomial (with regard to the complexity ...
0
votes
0answers
136 views

Limitations of Quantum Simulations on a Classical Computer

My question is on the simulation of a quantum computer on a classical machine. I understand that a classical computer to simulate any quantum algorithm--the problem is that the quantum computer does ...
0
votes
0answers
71 views

Proof that Quantum Computation cannot be simulated on classical computers

I have read , for example , in chapter 3, Computer-aided-design Methods for Emerging Quantum Computing Technologies By David Dov Yehuda Feinstein this statement several times, but I am not able to ...
2
votes
1answer
95 views

How powerful would a quantum computer need to be to break RSA encrytion codes?

First off, just to reassure everybody, I have no motive other than pure curiosity for asking this question. I don't want my bank account hacked any more than you want the same done to yours. My ...
3
votes
0answers
104 views

Anyonic Braiding and Conformal Field Theory

I am looking for resources (both pedagogical and newer research articles) on the connection between topological quantum computation and conformal field theory. In particular, a CFT description of ...
1
vote
1answer
42 views

Is the first excited state of a superconducting qubit a stationary state?

A superconducting qubit is essentially an anharmonic oscillator with uneven spacings of the eigenstates. These states are eigenstates of the overall hamiltonian, which should mean that it is an energy ...
1
vote
0answers
100 views

How useful is the study of entanglement entropy to quantum computing? [closed]

My question is somewhat conceptual: how, exactly, can we get closer to building a quantum computer by studying entanglement entropy? I've been reading all about the AdS/CFT correspondence and watching ...
0
votes
1answer
59 views

How does one measure the state probabilities of a 2 level Hydrogen atom qubit?

I have been struggling with trying to understand how one could measure the probabilities of a superimposed Hydrogen atom's two energy states. Say the atom is in a superimposed state: Psi = a|0> + ...
4
votes
1answer
117 views

Rigorous definition of superselection sector/quasiparticle type in anyon systems

The systems I have in mind are for example Kitaev's toric code model (arXiv:quant-ph/9707021) and Kitaev's honeycomb model (arXiv:cond-mat/0506438). What I'm looking for is a mathematically rigorous ...
2
votes
2answers
337 views

Why is a transmon a charge qubit?

The classic charge qubit is the cooper pair box which is a capacitor in series with a Josephson junction. In my understanding, by changing the gate voltage at the capacitor, one can create a ...
3
votes
1answer
134 views

which are the non-abelian anyons for universal quantum computation

I am trying to get a list of non-abelian anyons that can be used for universal quantum computation by implementing gates via braiding. I found that Majorana fermions and para-fermions (not sure about ...
2
votes
1answer
179 views

Topological Quantum Computing beyond Anyonic Braiding

In materials such as those that exhibit fractional quantum hall states, the ground-state topological degeneracy is known to be robust against external perturbations. This ultimately tells us that we ...
2
votes
1answer
136 views

are there known fundamental limits of quantum computer scaling?

Quantum computers provide exponential speedup relative to classical computers. However, it is empirical fact that increasing of number of qubits makes the the computer harder and harder to keep ...
0
votes
2answers
130 views

Why can't a classical bit behave like a qubit?

For example i have a 2 qubits which can have 4 possibilities i.e. 00, 01, 10, 11 so this shows that the 2 qubits can contain four bits of information as they are superpositioned but i think 2 ...
4
votes
1answer
162 views

How does quantum superposition make calculation faster?

In every description of a quantum computer I've seen (that isn't extremely technical), they've been described as computers that use qubits, that use a superposition of 1 and 0 to make processing ...
0
votes
2answers
102 views

Dilemma: Fusion space from a direct sum of anyons or NOT

In Preskill's note, 9.1.2 in page 44, concerning the fusion space, it states that: The fusion rules of the model specify the possible values of the total charge $c$ when the constituents have ...